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.r389-oct2-167903713400299.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 itstools
Input is ShieldIIPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 512K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679187110033

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 00:51:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:51:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:51:52] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-19 00:51:52] [INFO ] Transformed 2103 places.
[2023-03-19 00:51:52] [INFO ] Transformed 1953 transitions.
[2023-03-19 00:51:52] [INFO ] Found NUPN structural information;
[2023-03-19 00:51:52] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 322 places :
Symmetric choice reduction at 0 with 322 rule applications. Total rules 322 place count 1781 transition count 1631
Iterating global reduction 0 with 322 rules applied. Total rules applied 644 place count 1781 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 1780 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 1780 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 1779 transition count 1629
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 1779 transition count 1629
Applied a total of 648 rules in 1133 ms. Remains 1779 /2103 variables (removed 324) and now considering 1629/1953 (removed 324) transitions.
// Phase 1: matrix 1629 rows 1779 cols
[2023-03-19 00:51:54] [INFO ] Computed 271 place invariants in 22 ms
[2023-03-19 00:51:55] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2023-03-19 00:51:55] [INFO ] Invariant cache hit.
[2023-03-19 00:51:57] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 3538 ms to find 0 implicit places.
[2023-03-19 00:51:57] [INFO ] Invariant cache hit.
[2023-03-19 00:51:58] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1779/2103 places, 1629/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5860 ms. Remains : 1779/2103 places, 1629/1953 transitions.
Support contains 25 out of 1779 places after structural reductions.
[2023-03-19 00:51:59] [INFO ] Flatten gal took : 128 ms
[2023-03-19 00:51:59] [INFO ] Flatten gal took : 67 ms
[2023-03-19 00:51:59] [INFO ] Input system was already deterministic with 1629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 00:52:00] [INFO ] Invariant cache hit.
[2023-03-19 00:52:01] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 00:52:02] [INFO ] [Nat]Absence check using 271 positive place invariants in 208 ms returned sat
[2023-03-19 00:52:05] [INFO ] After 2344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 00:52:05] [INFO ] Deduced a trap composed of 24 places in 441 ms of which 9 ms to minimize.
[2023-03-19 00:52:06] [INFO ] Deduced a trap composed of 18 places in 457 ms of which 2 ms to minimize.
[2023-03-19 00:52:06] [INFO ] Deduced a trap composed of 22 places in 534 ms of which 2 ms to minimize.
[2023-03-19 00:52:07] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 2 ms to minimize.
[2023-03-19 00:52:07] [INFO ] Deduced a trap composed of 26 places in 457 ms of which 5 ms to minimize.
[2023-03-19 00:52:08] [INFO ] Deduced a trap composed of 18 places in 347 ms of which 1 ms to minimize.
[2023-03-19 00:52:08] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 1 ms to minimize.
[2023-03-19 00:52:08] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 0 ms to minimize.
[2023-03-19 00:52:09] [INFO ] Deduced a trap composed of 31 places in 495 ms of which 1 ms to minimize.
[2023-03-19 00:52:09] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2023-03-19 00:52:10] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 1 ms to minimize.
[2023-03-19 00:52:10] [INFO ] Deduced a trap composed of 24 places in 325 ms of which 1 ms to minimize.
[2023-03-19 00:52:10] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 1 ms to minimize.
[2023-03-19 00:52:11] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2023-03-19 00:52:11] [INFO ] Deduced a trap composed of 34 places in 392 ms of which 2 ms to minimize.
[2023-03-19 00:52:12] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 1 ms to minimize.
[2023-03-19 00:52:12] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 2 ms to minimize.
[2023-03-19 00:52:12] [INFO ] Deduced a trap composed of 37 places in 252 ms of which 0 ms to minimize.
[2023-03-19 00:52:13] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 1 ms to minimize.
[2023-03-19 00:52:13] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 1 ms to minimize.
[2023-03-19 00:52:13] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 1 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 1 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 0 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 1 ms to minimize.
[2023-03-19 00:52:14] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 0 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2023-03-19 00:52:15] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 0 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 43 places in 478 ms of which 0 ms to minimize.
[2023-03-19 00:52:16] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 0 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 1 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 16 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 0 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2023-03-19 00:52:17] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 0 ms to minimize.
[2023-03-19 00:52:18] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 12979 ms
[2023-03-19 00:52:18] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2023-03-19 00:52:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-19 00:52:18] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 2 ms to minimize.
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 2 ms to minimize.
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 0 ms to minimize.
[2023-03-19 00:52:19] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 0 ms to minimize.
[2023-03-19 00:52:20] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2023-03-19 00:52:20] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2023-03-19 00:52:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1781 ms
[2023-03-19 00:52:21] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2023-03-19 00:52:21] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2023-03-19 00:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2023-03-19 00:52:21] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-19 00:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-19 00:52:22] [INFO ] After 19496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1129 ms.
[2023-03-19 00:52:23] [INFO ] After 22081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 833 ms.
Support contains 19 out of 1779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 1779 transition count 1282
Reduce places removed 347 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 350 rules applied. Total rules applied 697 place count 1432 transition count 1279
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 700 place count 1429 transition count 1279
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 700 place count 1429 transition count 1044
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1170 place count 1194 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1172 place count 1192 transition count 1042
Iterating global reduction 3 with 2 rules applied. Total rules applied 1174 place count 1192 transition count 1042
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1174 place count 1192 transition count 1041
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1176 place count 1191 transition count 1041
Performed 513 Post agglomeration using F-continuation condition.Transition count delta: 513
Deduced a syphon composed of 513 places in 3 ms
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 3 with 1026 rules applied. Total rules applied 2202 place count 678 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2203 place count 678 transition count 527
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2205 place count 677 transition count 526
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 2375 place count 592 transition count 575
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2376 place count 592 transition count 574
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2378 place count 592 transition count 572
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2380 place count 590 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 2409 place count 590 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2410 place count 589 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2412 place count 587 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2412 place count 587 transition count 570
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2414 place count 586 transition count 570
Applied a total of 2414 rules in 436 ms. Remains 586 /1779 variables (removed 1193) and now considering 570/1629 (removed 1059) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 586/1779 places, 570/1629 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 570 rows 586 cols
[2023-03-19 00:52:25] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:52:25] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 00:52:25] [INFO ] [Nat]Absence check using 269 positive place invariants in 105 ms returned sat
[2023-03-19 00:52:26] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 00:52:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:52:27] [INFO ] After 356ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 00:52:27] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-19 00:52:28] [INFO ] After 2433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 19 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 570/570 transitions.
Applied a total of 0 rules in 27 ms. Remains 586 /586 variables (removed 0) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 586/586 places, 570/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:52:28] [INFO ] Invariant cache hit.
[2023-03-19 00:52:28] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:52:28] [INFO ] [Nat]Absence check using 269 positive place invariants in 39 ms returned sat
[2023-03-19 00:52:29] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:52:29] [INFO ] After 132ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:29] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 00:52:29] [INFO ] After 1091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 117 ms.
Support contains 9 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 570/570 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 586 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 584 transition count 568
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 584 transition count 565
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 581 transition count 565
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 579 transition count 563
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 575 transition count 569
Applied a total of 22 rules in 76 ms. Remains 575 /586 variables (removed 11) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 575/586 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 176021 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176021 steps, saw 112176 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 569 rows 575 cols
[2023-03-19 00:52:33] [INFO ] Computed 269 place invariants in 15 ms
[2023-03-19 00:52:33] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:52:33] [INFO ] [Nat]Absence check using 269 positive place invariants in 41 ms returned sat
[2023-03-19 00:52:34] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:52:34] [INFO ] After 136ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:34] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-19 00:52:34] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 80 ms.
Support contains 9 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 569/569 transitions.
Applied a total of 0 rules in 28 ms. Remains 575 /575 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 575/575 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 569/569 transitions.
Applied a total of 0 rules in 19 ms. Remains 575 /575 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-19 00:52:34] [INFO ] Invariant cache hit.
[2023-03-19 00:52:35] [INFO ] Implicit Places using invariants in 402 ms returned [564]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 416 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 569/569 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 573 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 573 transition count 568
Applied a total of 2 rules in 20 ms. Remains 573 /574 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 573 cols
[2023-03-19 00:52:35] [INFO ] Computed 268 place invariants in 15 ms
[2023-03-19 00:52:35] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-19 00:52:35] [INFO ] Invariant cache hit.
[2023-03-19 00:52:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:52:36] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 573/575 places, 568/569 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1879 ms. Remains : 573/575 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 178559 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178559 steps, saw 113330 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:52:39] [INFO ] Invariant cache hit.
[2023-03-19 00:52:39] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:52:40] [INFO ] [Nat]Absence check using 268 positive place invariants in 65 ms returned sat
[2023-03-19 00:52:40] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:52:40] [INFO ] After 61ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:40] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-19 00:52:40] [INFO ] After 788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 67 ms.
Support contains 9 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 573 /573 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 573/573 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 568/568 transitions.
Applied a total of 0 rules in 24 ms. Remains 573 /573 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:52:40] [INFO ] Invariant cache hit.
[2023-03-19 00:52:41] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-19 00:52:41] [INFO ] Invariant cache hit.
[2023-03-19 00:52:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:52:41] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-19 00:52:42] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-19 00:52:42] [INFO ] Invariant cache hit.
[2023-03-19 00:52:42] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1520 ms. Remains : 573/573 places, 568/568 transitions.
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 573 transition count 568
Applied a total of 58 rules in 21 ms. Remains 573 /573 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 568 rows 573 cols
[2023-03-19 00:52:42] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:52:42] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:52:42] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2023-03-19 00:52:42] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:42] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-19 00:52:43] [INFO ] After 231ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:52:43] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 13 ms to minimize.
[2023-03-19 00:52:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-19 00:52:43] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-19 00:52:43] [INFO ] After 1337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 479 stabilizing places and 479 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1771 transition count 1621
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1771 transition count 1621
Applied a total of 16 rules in 161 ms. Remains 1771 /1779 variables (removed 8) and now considering 1621/1629 (removed 8) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-19 00:52:44] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-19 00:52:45] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-19 00:52:45] [INFO ] Invariant cache hit.
[2023-03-19 00:52:47] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2023-03-19 00:52:47] [INFO ] Invariant cache hit.
[2023-03-19 00:52:48] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1779 places, 1621/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3873 ms. Remains : 1771/1779 places, 1621/1629 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s636 0) (EQ s1325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1066 ms.
Product exploration explored 100000 steps with 50000 reset in 947 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-01 finished in 6390 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(X(X(X(F((p0 U (G(p0)||p1))))))))'
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1773 transition count 1623
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1773 transition count 1623
Applied a total of 12 rules in 203 ms. Remains 1773 /1779 variables (removed 6) and now considering 1623/1629 (removed 6) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-19 00:52:50] [INFO ] Computed 271 place invariants in 15 ms
[2023-03-19 00:52:51] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-19 00:52:51] [INFO ] Invariant cache hit.
[2023-03-19 00:52:53] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2023-03-19 00:52:53] [INFO ] Invariant cache hit.
[2023-03-19 00:52:54] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1773/1779 places, 1623/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3554 ms. Remains : 1773/1779 places, 1623/1629 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1720 0) (EQ s944 1)), p0:(OR (EQ s764 0) (EQ s919 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18427 reset in 438 ms.
Product exploration explored 100000 steps with 18466 reset in 403 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1773 stabilizing places and 479/1623 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:52:55] [INFO ] Invariant cache hit.
[2023-03-19 00:52:56] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:52:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 71 ms returned sat
[2023-03-19 00:52:57] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:52:57] [INFO ] Deduced a trap composed of 35 places in 449 ms of which 9 ms to minimize.
[2023-03-19 00:52:58] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 1 ms to minimize.
[2023-03-19 00:52:58] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 1 ms to minimize.
[2023-03-19 00:52:58] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 1 ms to minimize.
[2023-03-19 00:52:59] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 1 ms to minimize.
[2023-03-19 00:52:59] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 1 ms to minimize.
[2023-03-19 00:52:59] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 1 ms to minimize.
[2023-03-19 00:53:00] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 1 ms to minimize.
[2023-03-19 00:53:00] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 1 ms to minimize.
[2023-03-19 00:53:00] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 1 ms to minimize.
[2023-03-19 00:53:01] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 1 ms to minimize.
[2023-03-19 00:53:01] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 1 ms to minimize.
[2023-03-19 00:53:01] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 0 ms to minimize.
[2023-03-19 00:53:02] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 5 ms to minimize.
[2023-03-19 00:53:02] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 1 ms to minimize.
[2023-03-19 00:53:03] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 1 ms to minimize.
[2023-03-19 00:53:03] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2023-03-19 00:53:03] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 1 ms to minimize.
[2023-03-19 00:53:04] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2023-03-19 00:53:04] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 0 ms to minimize.
[2023-03-19 00:53:04] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2023-03-19 00:53:05] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 1 ms to minimize.
[2023-03-19 00:53:05] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 0 ms to minimize.
[2023-03-19 00:53:05] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 1 ms to minimize.
[2023-03-19 00:53:05] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2023-03-19 00:53:06] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2023-03-19 00:53:06] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2023-03-19 00:53:06] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 1 ms to minimize.
[2023-03-19 00:53:07] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 1 ms to minimize.
[2023-03-19 00:53:07] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2023-03-19 00:53:07] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2023-03-19 00:53:08] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 2 ms to minimize.
[2023-03-19 00:53:08] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 0 ms to minimize.
[2023-03-19 00:53:08] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2023-03-19 00:53:08] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 0 ms to minimize.
[2023-03-19 00:53:09] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 0 ms to minimize.
[2023-03-19 00:53:09] [INFO ] Deduced a trap composed of 40 places in 336 ms of which 1 ms to minimize.
[2023-03-19 00:53:09] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 0 ms to minimize.
[2023-03-19 00:53:10] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 1 ms to minimize.
[2023-03-19 00:53:10] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2023-03-19 00:53:10] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 0 ms to minimize.
[2023-03-19 00:53:10] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2023-03-19 00:53:10] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2023-03-19 00:53:11] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 13832 ms
[2023-03-19 00:53:11] [INFO ] After 14720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 00:53:11] [INFO ] After 15141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1773 transition count 1266
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1416 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1415 transition count 1265
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 716 place count 1415 transition count 1025
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1196 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2214 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2395 place count 576 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2396 place count 576 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2425 place count 576 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2426 place count 575 transition count 571
Applied a total of 2426 rules in 264 ms. Remains 575 /1773 variables (removed 1198) and now considering 571/1623 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 575/1773 places, 571/1623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306783 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306783 steps, saw 200426 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 571 rows 575 cols
[2023-03-19 00:53:14] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-19 00:53:14] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:14] [INFO ] [Nat]Absence check using 271 positive place invariants in 59 ms returned sat
[2023-03-19 00:53:15] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:53:15] [INFO ] After 34ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:15] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 00:53:15] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 42 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 575/575 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 10 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-19 00:53:15] [INFO ] Invariant cache hit.
[2023-03-19 00:53:16] [INFO ] Implicit Places using invariants in 572 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 580 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 571/571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 570
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 570
Applied a total of 2 rules in 14 ms. Remains 573 /574 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 573 cols
[2023-03-19 00:53:16] [INFO ] Computed 270 place invariants in 3 ms
[2023-03-19 00:53:16] [INFO ] Implicit Places using invariants in 382 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 572/575 places, 570/571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 28 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2023-03-19 00:53:16] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:53:16] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-19 00:53:16] [INFO ] Invariant cache hit.
[2023-03-19 00:53:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:53:17] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 571/575 places, 569/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2123 ms. Remains : 571/575 places, 569/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308989 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308989 steps, saw 198507 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:53:20] [INFO ] Invariant cache hit.
[2023-03-19 00:53:20] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:21] [INFO ] [Nat]Absence check using 269 positive place invariants in 71 ms returned sat
[2023-03-19 00:53:21] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:53:21] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:21] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-03-19 00:53:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-19 00:53:21] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-19 00:53:21] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 22 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 17 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-19 00:53:21] [INFO ] Invariant cache hit.
[2023-03-19 00:53:22] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-19 00:53:22] [INFO ] Invariant cache hit.
[2023-03-19 00:53:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:53:23] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2023-03-19 00:53:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:53:23] [INFO ] Invariant cache hit.
[2023-03-19 00:53:24] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2193 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1515 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 21 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:53:24] [INFO ] Computed 268 place invariants in 4 ms
[2023-03-19 00:53:24] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:24] [INFO ] [Nat]Absence check using 268 positive place invariants in 55 ms returned sat
[2023-03-19 00:53:24] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-19 00:53:24] [INFO ] After 108ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:24] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 00:53:24] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Applied a total of 0 rules in 123 ms. Remains 1773 /1773 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-19 00:53:25] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-19 00:53:26] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-19 00:53:26] [INFO ] Invariant cache hit.
[2023-03-19 00:53:28] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2023-03-19 00:53:28] [INFO ] Invariant cache hit.
[2023-03-19 00:53:29] [INFO ] Dead Transitions using invariants and state equation in 1143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3936 ms. Remains : 1773/1773 places, 1623/1623 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1773 stabilizing places and 479/1623 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:53:30] [INFO ] Invariant cache hit.
[2023-03-19 00:53:30] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:30] [INFO ] [Nat]Absence check using 271 positive place invariants in 81 ms returned sat
[2023-03-19 00:53:32] [INFO ] After 1310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:32] [INFO ] Deduced a trap composed of 35 places in 414 ms of which 1 ms to minimize.
[2023-03-19 00:53:33] [INFO ] Deduced a trap composed of 50 places in 331 ms of which 1 ms to minimize.
[2023-03-19 00:53:33] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 0 ms to minimize.
[2023-03-19 00:53:33] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 1 ms to minimize.
[2023-03-19 00:53:34] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2023-03-19 00:53:34] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 0 ms to minimize.
[2023-03-19 00:53:34] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 2 ms to minimize.
[2023-03-19 00:53:35] [INFO ] Deduced a trap composed of 16 places in 331 ms of which 1 ms to minimize.
[2023-03-19 00:53:35] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-19 00:53:35] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 1 ms to minimize.
[2023-03-19 00:53:36] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 0 ms to minimize.
[2023-03-19 00:53:36] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 1 ms to minimize.
[2023-03-19 00:53:36] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2023-03-19 00:53:37] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 1 ms to minimize.
[2023-03-19 00:53:37] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 0 ms to minimize.
[2023-03-19 00:53:37] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 1 ms to minimize.
[2023-03-19 00:53:38] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 0 ms to minimize.
[2023-03-19 00:53:38] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 2 ms to minimize.
[2023-03-19 00:53:38] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 1 ms to minimize.
[2023-03-19 00:53:39] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 1 ms to minimize.
[2023-03-19 00:53:39] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 0 ms to minimize.
[2023-03-19 00:53:39] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 0 ms to minimize.
[2023-03-19 00:53:40] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 0 ms to minimize.
[2023-03-19 00:53:40] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 1 ms to minimize.
[2023-03-19 00:53:40] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 1 ms to minimize.
[2023-03-19 00:53:41] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 0 ms to minimize.
[2023-03-19 00:53:41] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 0 ms to minimize.
[2023-03-19 00:53:41] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 0 ms to minimize.
[2023-03-19 00:53:42] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 1 ms to minimize.
[2023-03-19 00:53:42] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 1 ms to minimize.
[2023-03-19 00:53:42] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2023-03-19 00:53:42] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 0 ms to minimize.
[2023-03-19 00:53:42] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2023-03-19 00:53:43] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 0 ms to minimize.
[2023-03-19 00:53:43] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 1 ms to minimize.
[2023-03-19 00:53:43] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 1 ms to minimize.
[2023-03-19 00:53:44] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 0 ms to minimize.
[2023-03-19 00:53:44] [INFO ] Deduced a trap composed of 44 places in 320 ms of which 1 ms to minimize.
[2023-03-19 00:53:44] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 13 ms to minimize.
[2023-03-19 00:53:45] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 1 ms to minimize.
[2023-03-19 00:53:45] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
[2023-03-19 00:53:45] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 0 ms to minimize.
[2023-03-19 00:53:45] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 1 ms to minimize.
[2023-03-19 00:53:46] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 13889 ms
[2023-03-19 00:53:46] [INFO ] After 15238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-19 00:53:46] [INFO ] After 15731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1773 transition count 1266
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1416 transition count 1265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1415 transition count 1265
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 716 place count 1415 transition count 1025
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1196 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 2214 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2215 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2217 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2395 place count 576 transition count 573
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2396 place count 576 transition count 572
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2425 place count 576 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2426 place count 575 transition count 571
Applied a total of 2426 rules in 270 ms. Remains 575 /1773 variables (removed 1198) and now considering 571/1623 (removed 1052) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 575/1773 places, 571/1623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327964 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327964 steps, saw 214231 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 571 rows 575 cols
[2023-03-19 00:53:49] [INFO ] Computed 271 place invariants in 3 ms
[2023-03-19 00:53:49] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:49] [INFO ] [Nat]Absence check using 271 positive place invariants in 43 ms returned sat
[2023-03-19 00:53:50] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:53:50] [INFO ] After 47ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:50] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 00:53:50] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 575 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 21 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 575/575 places, 571/571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 575/575 places, 571/571 transitions.
Applied a total of 0 rules in 15 ms. Remains 575 /575 variables (removed 0) and now considering 571/571 (removed 0) transitions.
[2023-03-19 00:53:50] [INFO ] Invariant cache hit.
[2023-03-19 00:53:50] [INFO ] Implicit Places using invariants in 465 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 469 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/575 places, 571/571 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 570
Applied a total of 2 rules in 13 ms. Remains 573 /574 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 573 cols
[2023-03-19 00:53:50] [INFO ] Computed 270 place invariants in 13 ms
[2023-03-19 00:53:51] [INFO ] Implicit Places using invariants in 396 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 406 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 572/575 places, 570/571 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 571 transition count 569
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 569
Applied a total of 2 rules in 21 ms. Remains 571 /572 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 571 cols
[2023-03-19 00:53:51] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:53:51] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-19 00:53:51] [INFO ] Invariant cache hit.
[2023-03-19 00:53:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:53:52] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 571/575 places, 569/571 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2057 ms. Remains : 571/575 places, 569/571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 317214 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317214 steps, saw 203918 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:53:55] [INFO ] Invariant cache hit.
[2023-03-19 00:53:55] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:55] [INFO ] [Nat]Absence check using 269 positive place invariants in 45 ms returned sat
[2023-03-19 00:53:56] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:53:56] [INFO ] After 26ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:56] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-03-19 00:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-19 00:53:56] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-19 00:53:56] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 18 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 15 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-19 00:53:56] [INFO ] Invariant cache hit.
[2023-03-19 00:53:57] [INFO ] Implicit Places using invariants in 818 ms returned []
[2023-03-19 00:53:57] [INFO ] Invariant cache hit.
[2023-03-19 00:53:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:53:58] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2023-03-19 00:53:58] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-19 00:53:58] [INFO ] Invariant cache hit.
[2023-03-19 00:53:58] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1968 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1515 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 15 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:53:58] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:53:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:53:58] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2023-03-19 00:53:58] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:58] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-19 00:53:58] [INFO ] After 66ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:53:59] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-19 00:53:59] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 259 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18475 reset in 505 ms.
Product exploration explored 100000 steps with 18429 reset in 462 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1773 transition count 1623
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 358 place count 1773 transition count 1714
Deduced a syphon composed of 478 places in 3 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 478 place count 1773 transition count 1714
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1079 places in 2 ms
Iterating global reduction 1 with 601 rules applied. Total rules applied 1079 place count 1773 transition count 1716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1080 place count 1773 transition count 1715
Renaming transitions due to excessive name length > 1024 char.
Discarding 242 places :
Symmetric choice reduction at 2 with 242 rule applications. Total rules 1322 place count 1531 transition count 1471
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 242 rules applied. Total rules applied 1564 place count 1531 transition count 1471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1565 place count 1531 transition count 1471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1567 place count 1529 transition count 1469
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1569 place count 1529 transition count 1469
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 937 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1670 place count 1529 transition count 2002
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1771 place count 1428 transition count 1800
Deduced a syphon composed of 836 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1872 place count 1428 transition count 1800
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 852 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1888 place count 1428 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1904 place count 1412 transition count 1860
Deduced a syphon composed of 836 places in 2 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1412 transition count 1860
Deduced a syphon composed of 836 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1929 place count 1412 transition count 1851
Deduced a syphon composed of 836 places in 2 ms
Applied a total of 1929 rules in 1040 ms. Remains 1412 /1773 variables (removed 361) and now considering 1851/1623 (removed -228) transitions.
[2023-03-19 00:54:03] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1851 rows 1412 cols
[2023-03-19 00:54:03] [INFO ] Computed 271 place invariants in 23 ms
[2023-03-19 00:54:04] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1412/1773 places, 1851/1623 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2075 ms. Remains : 1412/1773 places, 1851/1623 transitions.
Built C files in :
/tmp/ltsmin18050424958220541054
[2023-03-19 00:54:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18050424958220541054
Running compilation step : cd /tmp/ltsmin18050424958220541054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18050424958220541054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18050424958220541054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1773/1773 places, 1623/1623 transitions.
Applied a total of 0 rules in 124 ms. Remains 1773 /1773 variables (removed 0) and now considering 1623/1623 (removed 0) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-19 00:54:07] [INFO ] Computed 271 place invariants in 34 ms
[2023-03-19 00:54:08] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-19 00:54:08] [INFO ] Invariant cache hit.
[2023-03-19 00:54:09] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
[2023-03-19 00:54:09] [INFO ] Invariant cache hit.
[2023-03-19 00:54:10] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3329 ms. Remains : 1773/1773 places, 1623/1623 transitions.
Built C files in :
/tmp/ltsmin11959412386550390408
[2023-03-19 00:54:10] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11959412386550390408
Running compilation step : cd /tmp/ltsmin11959412386550390408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2772 ms.
Running link step : cd /tmp/ltsmin11959412386550390408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin11959412386550390408;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16265477904796189440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 00:54:25] [INFO ] Flatten gal took : 51 ms
[2023-03-19 00:54:25] [INFO ] Flatten gal took : 48 ms
[2023-03-19 00:54:25] [INFO ] Time to serialize gal into /tmp/LTL8272396768975954579.gal : 11 ms
[2023-03-19 00:54:25] [INFO ] Time to serialize properties into /tmp/LTL8063782844196765231.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8272396768975954579.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15290941370692467792.hoa' '-atoms' '/tmp/LTL8063782844196765231.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8063782844196765231.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15290941370692467792.hoa
Detected timeout of ITS tools.
[2023-03-19 00:54:41] [INFO ] Flatten gal took : 48 ms
[2023-03-19 00:54:41] [INFO ] Flatten gal took : 45 ms
[2023-03-19 00:54:41] [INFO ] Time to serialize gal into /tmp/LTL581549650521706856.gal : 6 ms
[2023-03-19 00:54:41] [INFO ] Time to serialize properties into /tmp/LTL5989247550120249368.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL581549650521706856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5989247550120249368.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F(("((p899==0)||(p1083==1))")U(("((p2037==0)||(p1112==1))")||(G("((p899==0)||(p1083==1))"))))))))))
Formula 0 simplified : XXXXG(!"((p899==0)||(p1083==1))" M !"((p2037==0)||(p1112==1))")
Detected timeout of ITS tools.
[2023-03-19 00:54:56] [INFO ] Flatten gal took : 66 ms
[2023-03-19 00:54:56] [INFO ] Applying decomposition
[2023-03-19 00:54:56] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8359979987228648616.txt' '-o' '/tmp/graph8359979987228648616.bin' '-w' '/tmp/graph8359979987228648616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8359979987228648616.bin' '-l' '-1' '-v' '-w' '/tmp/graph8359979987228648616.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:54:57] [INFO ] Decomposing Gal with order
[2023-03-19 00:54:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:54:57] [INFO ] Removed a total of 299 redundant transitions.
[2023-03-19 00:54:57] [INFO ] Flatten gal took : 222 ms
[2023-03-19 00:54:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-19 00:54:57] [INFO ] Time to serialize gal into /tmp/LTL16067425254939534869.gal : 39 ms
[2023-03-19 00:54:57] [INFO ] Time to serialize properties into /tmp/LTL6491270771612595655.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16067425254939534869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6491270771612595655.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F(("((i13.i5.u285.p899==0)||(i16.i2.u338.p1083==1))")U(("((i29.i0.u637.p2037==0)||(i16.i4.u348.p1112==1))")||(G("((i13.i5.u...203
Formula 0 simplified : XXXXG(!"((i13.i5.u285.p899==0)||(i16.i2.u338.p1083==1))" M !"((i29.i0.u637.p2037==0)||(i16.i4.u348.p1112==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11791737981240611516
[2023-03-19 00:55:12] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11791737981240611516
Running compilation step : cd /tmp/ltsmin11791737981240611516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11791737981240611516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11791737981240611516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-03 finished in 145451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1778 transition count 1273
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 1423 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 712 place count 1422 transition count 1272
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 712 place count 1422 transition count 1035
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1186 place count 1185 transition count 1035
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1191 place count 1180 transition count 1030
Iterating global reduction 3 with 5 rules applied. Total rules applied 1196 place count 1180 transition count 1030
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1196 place count 1180 transition count 1027
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1202 place count 1177 transition count 1027
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2224 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2225 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2227 place count 665 transition count 514
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2401 place count 578 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2403 place count 576 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2405 place count 574 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2405 place count 574 transition count 565
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2407 place count 573 transition count 565
Applied a total of 2407 rules in 435 ms. Remains 573 /1779 variables (removed 1206) and now considering 565/1629 (removed 1064) transitions.
// Phase 1: matrix 565 rows 573 cols
[2023-03-19 00:55:16] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:55:16] [INFO ] Implicit Places using invariants in 505 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1779 places, 565/1629 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 564
Applied a total of 2 rules in 18 ms. Remains 571 /572 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 571 cols
[2023-03-19 00:55:16] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:55:17] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-19 00:55:17] [INFO ] Invariant cache hit.
[2023-03-19 00:55:17] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1779 places, 564/1629 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2002 ms. Remains : 571/1779 places, 564/1629 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s156 0) (EQ s196 1)), p0:(AND (EQ s231 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-04 finished in 2146 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(X(G(((!p1 U (p2||G(!p1)))&&p0)))))'
Support contains 5 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1773 transition count 1623
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1773 transition count 1623
Applied a total of 12 rules in 372 ms. Remains 1773 /1779 variables (removed 6) and now considering 1623/1629 (removed 6) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2023-03-19 00:55:18] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-19 00:55:19] [INFO ] Implicit Places using invariants in 821 ms returned []
[2023-03-19 00:55:19] [INFO ] Invariant cache hit.
[2023-03-19 00:55:21] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
[2023-03-19 00:55:21] [INFO ] Invariant cache hit.
[2023-03-19 00:55:22] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1773/1779 places, 1623/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4451 ms. Remains : 1773/1779 places, 1623/1629 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s1220 0) (EQ s1273 1)), p2:(AND (NOT (AND (OR (EQ s918 0) (EQ s668 1)) (OR (EQ s1273 0) (EQ s1220 1)))) (NOT (AND (NOT (OR (EQ s1273 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-06 finished in 4672 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 5 out of 1779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1778 transition count 1273
Reduce places removed 355 places and 0 transitions.
Iterating post reduction 1 with 355 rules applied. Total rules applied 710 place count 1423 transition count 1273
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 710 place count 1423 transition count 1034
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1188 place count 1184 transition count 1034
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1193 place count 1179 transition count 1029
Iterating global reduction 2 with 5 rules applied. Total rules applied 1198 place count 1179 transition count 1029
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1198 place count 1179 transition count 1026
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1204 place count 1176 transition count 1026
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2222 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2223 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2225 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2403 place count 577 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2405 place count 575 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2407 place count 573 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2407 place count 573 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2409 place count 572 transition count 570
Applied a total of 2409 rules in 284 ms. Remains 572 /1779 variables (removed 1207) and now considering 570/1629 (removed 1059) transitions.
// Phase 1: matrix 570 rows 572 cols
[2023-03-19 00:55:23] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:55:23] [INFO ] Implicit Places using invariants in 372 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1779 places, 570/1629 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 569
Applied a total of 2 rules in 17 ms. Remains 570 /571 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:55:23] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:55:23] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-19 00:55:23] [INFO ] Invariant cache hit.
[2023-03-19 00:55:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:24] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1779 places, 569/1629 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1911 ms. Remains : 570/1779 places, 569/1629 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s414 0) (EQ s384 1) (EQ s286 1) (EQ s35 0) (EQ s288 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 622 ms.
Product exploration explored 100000 steps with 0 reset in 890 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 201 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 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 301257 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301257 steps, saw 184442 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:55:29] [INFO ] Invariant cache hit.
[2023-03-19 00:55:29] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:55:30] [INFO ] [Nat]Absence check using 268 positive place invariants in 59 ms returned sat
[2023-03-19 00:55:30] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:30] [INFO ] After 27ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:30] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 00:55:30] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 570 transition count 568
Applied a total of 1 rules in 13 ms. Remains 570 /570 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 570/570 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306573 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306573 steps, saw 196500 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-19 00:55:33] [INFO ] Computed 268 place invariants in 4 ms
[2023-03-19 00:55:33] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:55:33] [INFO ] [Nat]Absence check using 268 positive place invariants in 64 ms returned sat
[2023-03-19 00:55:34] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:34] [INFO ] After 26ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:34] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 00:55:34] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 19 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 570/570 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:55:34] [INFO ] Invariant cache hit.
[2023-03-19 00:55:34] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-19 00:55:34] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2023-03-19 00:55:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1542 ms. Remains : 570/570 places, 568/568 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 570 transition count 568
Applied a total of 60 rules in 18 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-19 00:55:35] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-19 00:55:35] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:55:36] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-19 00:55:36] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:36] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-19 00:55:36] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 215 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 570/570 places, 569/569 transitions.
Applied a total of 0 rules in 24 ms. Remains 570 /570 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:55:36] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:55:37] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-19 00:55:37] [INFO ] Invariant cache hit.
[2023-03-19 00:55:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:38] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-19 00:55:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:55:38] [INFO ] Invariant cache hit.
[2023-03-19 00:55:38] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1691 ms. Remains : 570/570 places, 569/569 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325911 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325911 steps, saw 198700 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:55:41] [INFO ] Invariant cache hit.
[2023-03-19 00:55:41] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:55:42] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2023-03-19 00:55:42] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:42] [INFO ] After 33ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:42] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-19 00:55:42] [INFO ] After 580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 570 transition count 568
Applied a total of 1 rules in 21 ms. Remains 570 /570 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 570/570 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323125 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323125 steps, saw 206696 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-19 00:55:45] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:55:45] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:55:45] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2023-03-19 00:55:46] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:46] [INFO ] After 65ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:46] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-19 00:55:46] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 23 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 570/570 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-19 00:55:46] [INFO ] Invariant cache hit.
[2023-03-19 00:55:47] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-19 00:55:47] [INFO ] Invariant cache hit.
[2023-03-19 00:55:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:47] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
[2023-03-19 00:55:47] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-19 00:55:47] [INFO ] Invariant cache hit.
[2023-03-19 00:55:48] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1783 ms. Remains : 570/570 places, 568/568 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 570 transition count 568
Applied a total of 60 rules in 46 ms. Remains 570 /570 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 570 cols
[2023-03-19 00:55:48] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:55:48] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:55:48] [INFO ] [Nat]Absence check using 268 positive place invariants in 42 ms returned sat
[2023-03-19 00:55:48] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:55:49] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-19 00:55:49] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 581 ms.
Product exploration explored 100000 steps with 0 reset in 739 ms.
Built C files in :
/tmp/ltsmin16361509425654107238
[2023-03-19 00:55:50] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2023-03-19 00:55:50] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:55:50] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2023-03-19 00:55:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:55:50] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2023-03-19 00:55:50] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 00:55:50] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16361509425654107238
Running compilation step : cd /tmp/ltsmin16361509425654107238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1392 ms.
Running link step : cd /tmp/ltsmin16361509425654107238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin16361509425654107238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6592872446414747108.hoa' '--buchi-type=spotba'
LTSmin run took 7732 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-09 finished in 37294 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)||X(G((p1&&X(p2))))))'
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1772 transition count 1622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1772 transition count 1622
Applied a total of 14 rules in 183 ms. Remains 1772 /1779 variables (removed 7) and now considering 1622/1629 (removed 7) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-19 00:56:00] [INFO ] Computed 271 place invariants in 9 ms
[2023-03-19 00:56:00] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-19 00:56:00] [INFO ] Invariant cache hit.
[2023-03-19 00:56:02] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2310 ms to find 0 implicit places.
[2023-03-19 00:56:02] [INFO ] Invariant cache hit.
[2023-03-19 00:56:03] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1779 places, 1622/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3445 ms. Remains : 1772/1779 places, 1622/1629 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s1507 0) (EQ s992 1)), p1:(EQ s883 1), p2:(EQ s478 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][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 ShieldIIPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-12 finished in 3840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1778 transition count 1270
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1420 transition count 1270
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 716 place count 1420 transition count 1032
Deduced a syphon composed of 238 places in 2 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1192 place count 1182 transition count 1032
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1198 place count 1176 transition count 1026
Iterating global reduction 2 with 6 rules applied. Total rules applied 1204 place count 1176 transition count 1026
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1204 place count 1176 transition count 1022
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1212 place count 1172 transition count 1022
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2230 place count 663 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2231 place count 663 transition count 512
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2233 place count 662 transition count 511
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2411 place count 573 transition count 570
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2413 place count 571 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2415 place count 569 transition count 568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2415 place count 569 transition count 567
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2417 place count 568 transition count 567
Applied a total of 2417 rules in 260 ms. Remains 568 /1779 variables (removed 1211) and now considering 567/1629 (removed 1062) transitions.
// Phase 1: matrix 567 rows 568 cols
[2023-03-19 00:56:04] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-19 00:56:04] [INFO ] Implicit Places using invariants in 359 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1779 places, 567/1629 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 566
Applied a total of 2 rules in 16 ms. Remains 566 /567 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 566 cols
[2023-03-19 00:56:04] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:56:04] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-19 00:56:04] [INFO ] Invariant cache hit.
[2023-03-19 00:56:05] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 566/1779 places, 566/1629 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1474 ms. Remains : 566/1779 places, 566/1629 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s226 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 544 ms.
Stuttering criterion allowed to conclude after 27980 steps with 0 reset in 187 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-13 finished in 2334 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))))'
Support contains 3 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1772 transition count 1622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1772 transition count 1622
Applied a total of 14 rules in 205 ms. Remains 1772 /1779 variables (removed 7) and now considering 1622/1629 (removed 7) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-19 00:56:06] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-19 00:56:07] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-19 00:56:07] [INFO ] Invariant cache hit.
[2023-03-19 00:56:09] [INFO ] Implicit Places using invariants and state equation in 1977 ms returned []
Implicit Place search using SMT with State Equation took 2629 ms to find 0 implicit places.
[2023-03-19 00:56:09] [INFO ] Invariant cache hit.
[2023-03-19 00:56:10] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1779 places, 1622/1629 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3856 ms. Remains : 1772/1779 places, 1622/1629 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s92 0) (EQ s512 1)), p0:(EQ s1534 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-15 finished in 4031 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(X(X(X(F((p0 U (G(p0)||p1))))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-030B-LTLCardinality-03
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1779 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1779/1779 places, 1629/1629 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1778 transition count 1273
Reduce places removed 355 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 1423 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 712 place count 1422 transition count 1272
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 712 place count 1422 transition count 1033
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1190 place count 1183 transition count 1033
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1194 place count 1179 transition count 1029
Iterating global reduction 3 with 4 rules applied. Total rules applied 1198 place count 1179 transition count 1029
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1198 place count 1179 transition count 1025
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1206 place count 1175 transition count 1025
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2222 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2223 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2225 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2403 place count 577 transition count 574
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2405 place count 575 transition count 572
Applied a total of 2405 rules in 378 ms. Remains 575 /1779 variables (removed 1204) and now considering 572/1629 (removed 1057) transitions.
// Phase 1: matrix 572 rows 575 cols
[2023-03-19 00:56:11] [INFO ] Computed 271 place invariants in 2 ms
[2023-03-19 00:56:11] [INFO ] Implicit Places using invariants in 390 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 405 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 574/1779 places, 572/1629 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 574 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 573 transition count 571
Applied a total of 2 rules in 10 ms. Remains 573 /574 variables (removed 1) and now considering 571/572 (removed 1) transitions.
// Phase 1: matrix 571 rows 573 cols
[2023-03-19 00:56:11] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-19 00:56:11] [INFO ] Implicit Places using invariants in 323 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 324 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 572/1779 places, 571/1629 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 570
Applied a total of 2 rules in 15 ms. Remains 571 /572 variables (removed 1) and now considering 570/571 (removed 1) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-19 00:56:11] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-19 00:56:12] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-19 00:56:12] [INFO ] Invariant cache hit.
[2023-03-19 00:56:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:56:13] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 571/1779 places, 570/1629 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2391 ms. Remains : 571/1779 places, 570/1629 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s557 0) (EQ s304 1)), p0:(OR (EQ s243 0) (EQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 774 ms.
Product exploration explored 100000 steps with 20000 reset in 742 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/571 stabilizing places and 4/570 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:56:15] [INFO ] Invariant cache hit.
[2023-03-19 00:56:15] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:56:15] [INFO ] [Nat]Absence check using 269 positive place invariants in 33 ms returned sat
[2023-03-19 00:56:15] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:56:15] [INFO ] After 97ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:15] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 00:56:15] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 570/570 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 569
Applied a total of 1 rules in 9 ms. Remains 571 /571 variables (removed 0) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 571/571 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 348464 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348464 steps, saw 251164 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 571 cols
[2023-03-19 00:56:18] [INFO ] Computed 269 place invariants in 0 ms
[2023-03-19 00:56:19] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:56:19] [INFO ] [Nat]Absence check using 269 positive place invariants in 37 ms returned sat
[2023-03-19 00:56:19] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:56:19] [INFO ] After 48ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-19 00:56:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-19 00:56:19] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-19 00:56:19] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 9 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 9 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-19 00:56:19] [INFO ] Invariant cache hit.
[2023-03-19 00:56:20] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-19 00:56:20] [INFO ] Invariant cache hit.
[2023-03-19 00:56:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:56:20] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-19 00:56:20] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 00:56:20] [INFO ] Invariant cache hit.
[2023-03-19 00:56:21] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1349 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1403 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 30 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:56:21] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:56:21] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:56:21] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2023-03-19 00:56:21] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:56:21] [INFO ] After 21ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:21] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-19 00:56:21] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 6 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-19 00:56:22] [INFO ] Computed 269 place invariants in 0 ms
[2023-03-19 00:56:22] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 00:56:22] [INFO ] Invariant cache hit.
[2023-03-19 00:56:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:56:23] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-03-19 00:56:23] [INFO ] Invariant cache hit.
[2023-03-19 00:56:23] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1606 ms. Remains : 571/571 places, 570/570 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/571 stabilizing places and 4/570 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:56:24] [INFO ] Invariant cache hit.
[2023-03-19 00:56:24] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:56:24] [INFO ] [Nat]Absence check using 269 positive place invariants in 32 ms returned sat
[2023-03-19 00:56:25] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 00:56:25] [INFO ] After 29ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:25] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 00:56:25] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 570/570 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 571 transition count 569
Applied a total of 1 rules in 20 ms. Remains 571 /571 variables (removed 0) and now considering 569/570 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 571/571 places, 569/570 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335925 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335925 steps, saw 241503 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 571 cols
[2023-03-19 00:56:28] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-19 00:56:28] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:56:28] [INFO ] [Nat]Absence check using 269 positive place invariants in 47 ms returned sat
[2023-03-19 00:56:28] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:56:28] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-19 00:56:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-19 00:56:29] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 00:56:29] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 20 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 571/571 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 569/569 transitions.
Applied a total of 0 rules in 15 ms. Remains 571 /571 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2023-03-19 00:56:29] [INFO ] Invariant cache hit.
[2023-03-19 00:56:30] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2023-03-19 00:56:30] [INFO ] Invariant cache hit.
[2023-03-19 00:56:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 00:56:31] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-19 00:56:31] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 00:56:31] [INFO ] Invariant cache hit.
[2023-03-19 00:56:31] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2502 ms. Remains : 571/571 places, 569/569 transitions.
Graph (complete) has 1403 edges and 571 vertex of which 570 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 570 transition count 569
Applied a total of 63 rules in 17 ms. Remains 570 /571 variables (removed 1) and now considering 569/569 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 569 rows 570 cols
[2023-03-19 00:56:31] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-19 00:56:31] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:56:31] [INFO ] [Nat]Absence check using 268 positive place invariants in 68 ms returned sat
[2023-03-19 00:56:32] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:56:32] [INFO ] After 43ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:56:32] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 00:56:32] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 288 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 740 ms.
Product exploration explored 100000 steps with 20000 reset in 898 ms.
Applying partial POR strategy [false, false, false, false, true]
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 571/571 places, 570/570 transitions.
Applied a total of 0 rules in 10 ms. Remains 571 /571 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2023-03-19 00:56:35] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 570 rows 571 cols
[2023-03-19 00:56:35] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-19 00:56:36] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 571/571 places, 570/570 transitions.
Built C files in :
/tmp/ltsmin78939402634533672
[2023-03-19 00:56:36] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin78939402634533672
Running compilation step : cd /tmp/ltsmin78939402634533672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1019 ms.
Running link step : cd /tmp/ltsmin78939402634533672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin78939402634533672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased722049433629613319.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-03 finished in 27329 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-03 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-19 00:56:37] [INFO ] Flatten gal took : 54 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 285264 ms.

BK_STOP 1679187398002

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-PT-030B, 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 r389-oct2-167903713400299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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