Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025500635.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025500635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 376K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653024163039

Running Version 202205111006
[2022-05-20 05:22:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 05:22:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 05:22:44] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-20 05:22:44] [INFO ] Transformed 1563 places.
[2022-05-20 05:22:44] [INFO ] Transformed 1423 transitions.
[2022-05-20 05:22:44] [INFO ] Found NUPN structural information;
[2022-05-20 05:22:44] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 287 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.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 218 places :
Symmetric choice reduction at 0 with 218 rule applications. Total rules 218 place count 1345 transition count 1205
Iterating global reduction 0 with 218 rules applied. Total rules applied 436 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 437 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 438 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 439 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 440 place count 1343 transition count 1203
Applied a total of 440 rules in 535 ms. Remains 1343 /1563 variables (removed 220) and now considering 1203/1423 (removed 220) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:22:45] [INFO ] Computed 221 place invariants in 28 ms
[2022-05-20 05:22:45] [INFO ] Implicit Places using invariants in 746 ms returned []
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:22:45] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:22:46] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:22:46] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-20 05:22:47] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1563 places, 1203/1423 transitions.
Finished structural reductions, in 1 iterations. Remains : 1343/1563 places, 1203/1423 transitions.
Support contains 28 out of 1343 places after structural reductions.
[2022-05-20 05:22:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 05:22:47] [INFO ] Flatten gal took : 135 ms
FORMULA ShieldPPPt-PT-020B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 05:22:47] [INFO ] Flatten gal took : 62 ms
[2022-05-20 05:22:48] [INFO ] Input system was already deterministic with 1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1203 rows 1343 cols
[2022-05-20 05:22:48] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:22:49] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 05:22:49] [INFO ] [Nat]Absence check using 221 positive place invariants in 92 ms returned sat
[2022-05-20 05:22:50] [INFO ] After 774ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-20 05:22:50] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 8 ms to minimize.
[2022-05-20 05:22:51] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2022-05-20 05:22:51] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 1 ms to minimize.
[2022-05-20 05:22:51] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2022-05-20 05:22:52] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2022-05-20 05:22:52] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2022-05-20 05:22:52] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2022-05-20 05:22:52] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2022-05-20 05:22:53] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2022-05-20 05:22:53] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 1 ms to minimize.
[2022-05-20 05:22:53] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2022-05-20 05:22:53] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 1 ms to minimize.
[2022-05-20 05:22:54] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2022-05-20 05:22:54] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 0 ms to minimize.
[2022-05-20 05:22:54] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2022-05-20 05:22:54] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2022-05-20 05:22:54] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2022-05-20 05:22:55] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2022-05-20 05:22:55] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-05-20 05:22:55] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-20 05:22:55] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2022-05-20 05:22:55] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-20 05:22:55] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2022-05-20 05:22:56] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-05-20 05:22:56] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2022-05-20 05:22:56] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5657 ms
[2022-05-20 05:22:56] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2022-05-20 05:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2022-05-20 05:22:57] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2022-05-20 05:22:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-20 05:22:57] [INFO ] After 7317ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 320 ms.
[2022-05-20 05:22:57] [INFO ] After 8242ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 218 ms.
Support contains 11 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Drop transitions removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 272 place count 1343 transition count 931
Reduce places removed 272 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 273 rules applied. Total rules applied 545 place count 1071 transition count 930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 546 place count 1070 transition count 930
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 546 place count 1070 transition count 772
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 862 place count 912 transition count 772
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 863 place count 911 transition count 771
Iterating global reduction 3 with 1 rules applied. Total rules applied 864 place count 911 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 864 place count 911 transition count 770
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 866 place count 910 transition count 770
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1538 place count 574 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1539 place count 574 transition count 433
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 1541 place count 573 transition count 432
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1655 place count 516 transition count 432
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1656 place count 516 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1657 place count 515 transition count 431
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1714 place count 515 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1715 place count 514 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1716 place count 513 transition count 430
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1716 place count 513 transition count 428
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1720 place count 511 transition count 428
Applied a total of 1720 rules in 379 ms. Remains 511 /1343 variables (removed 832) and now considering 428/1203 (removed 775) transitions.
Finished structural reductions, in 1 iterations. Remains : 511/1343 places, 428/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 428 rows 511 cols
[2022-05-20 05:22:58] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:22:59] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 05:22:59] [INFO ] [Nat]Absence check using 220 positive place invariants in 27 ms returned sat
[2022-05-20 05:22:59] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 05:22:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 05:22:59] [INFO ] After 112ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 05:22:59] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2022-05-20 05:22:59] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-20 05:22:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2022-05-20 05:22:59] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2022-05-20 05:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-20 05:22:59] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2022-05-20 05:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-20 05:23:00] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-20 05:23:00] [INFO ] After 1142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 9 out of 511 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 511/511 places, 428/428 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 511 transition count 426
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 509 transition count 426
Applied a total of 4 rules in 58 ms. Remains 509 /511 variables (removed 2) and now considering 426/428 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 509/511 places, 426/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 144832 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144832 steps, saw 113550 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 426 rows 509 cols
[2022-05-20 05:23:04] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:23:04] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 05:23:04] [INFO ] [Nat]Absence check using 220 positive place invariants in 37 ms returned sat
[2022-05-20 05:23:04] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 05:23:04] [INFO ] After 118ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:04] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-20 05:23:05] [INFO ] After 894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 9 out of 509 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 509/509 places, 426/426 transitions.
Applied a total of 0 rules in 13 ms. Remains 509 /509 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 509/509 places, 426/426 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 509/509 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 509 /509 variables (removed 0) and now considering 426/426 (removed 0) transitions.
// Phase 1: matrix 426 rows 509 cols
[2022-05-20 05:23:05] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:23:05] [INFO ] Implicit Places using invariants in 264 ms returned [492, 496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 507/509 places, 426/426 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 505 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 505 transition count 424
Applied a total of 4 rules in 17 ms. Remains 505 /507 variables (removed 2) and now considering 424/426 (removed 2) transitions.
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:05] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:05] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:05] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:23:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 05:23:06] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 505/509 places, 424/426 transitions.
Finished structural reductions, in 2 iterations. Remains : 505/509 places, 424/426 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 129693 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129693 steps, saw 104786 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:09] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:09] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 05:23:09] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:23:10] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 05:23:10] [INFO ] After 108ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:10] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2022-05-20 05:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-20 05:23:10] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 118 ms.
[2022-05-20 05:23:10] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 9 out of 505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 505/505 places, 424/424 transitions.
Applied a total of 0 rules in 9 ms. Remains 505 /505 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/505 places, 424/424 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 505/505 places, 424/424 transitions.
Applied a total of 0 rules in 10 ms. Remains 505 /505 variables (removed 0) and now considering 424/424 (removed 0) transitions.
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:10] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:23:11] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:11] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 05:23:11] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2022-05-20 05:23:11] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:11] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:11] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 505/505 places, 424/424 transitions.
Partial Free-agglomeration rule applied 112 times.
Drop transitions removed 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 505 transition count 424
Applied a total of 112 rules in 20 ms. Remains 505 /505 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 424 rows 505 cols
[2022-05-20 05:23:11] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:11] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 05:23:11] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2022-05-20 05:23:12] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:12] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-20 05:23:12] [INFO ] After 157ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:12] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2022-05-20 05:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-20 05:23:12] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 141 ms.
[2022-05-20 05:23:12] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-20 05:23:13] [INFO ] Flatten gal took : 24 ms
[2022-05-20 05:23:13] [INFO ] Flatten gal took : 23 ms
[2022-05-20 05:23:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3996047133450596791.gal : 33 ms
[2022-05-20 05:23:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12204093803033060448.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13754829156578354031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3996047133450596791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12204093803033060448.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12204093803033060448.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :18 after 180
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :180 after 221
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :221 after 338
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :338 after 4885
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :4885 after 49629
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :49629 after 542293
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :542293 after 7.47553e+07
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :7.47553e+07 after 4.06348e+08
Reachability property AtomicPropp2 is true.
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :4.06348e+08 after 2.09227e+12
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2.09227e+12 after 7.00843e+12
Reachability property AtomicPropp10 is true.
Reachability property AtomicPropp0 is true.
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7.00843e+12 after 1.11266e+16
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.11266e+16 after 3.1172e+17
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.1172e+17 after 9.94068e+19
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :9.94068e+19 after 6.58885e+26
Reachability property AtomicPropp15 is true.
Reachability property AtomicPropp14 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.99117e+31,10.2444,270160,2,30803,27,765576,6,0,2394,2.1483e+06,0
Total reachable state count : 19911660546451570496691419217920

Verifying 6 reachability properties.
Reachability property AtomicPropp0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp0,2.66961e+15,10.2481,270160,2,1588,27,765576,7,0,2400,2.1483e+06,0
Reachability property AtomicPropp2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp2,1.04282e+13,10.2503,270160,2,1542,27,765576,8,0,2405,2.1483e+06,0
Reachability property AtomicPropp6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,1.57824e+24,10.2517,270160,2,2149,27,765576,9,0,2410,2.1483e+06,0
Reachability property AtomicPropp10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,2.66961e+15,10.2535,270160,2,1588,27,765576,10,0,2412,2.1483e+06,0
Reachability property AtomicPropp14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp14,1.1522e+10,10.2559,270160,2,1106,27,765576,11,0,2417,2.1483e+06,0
Reachability property AtomicPropp15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp15,1.1522e+10,10.2573,270160,2,1106,27,765576,11,0,2417,2.1483e+06,0
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 318 stabilizing places and 318 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||X(F(p1))))||X(F((p1 U p0)))))'
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1342 transition count 1202
Applied a total of 2 rules in 84 ms. Remains 1342 /1343 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:23:23] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:23:24] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:23:24] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:23:25] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:23:25] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:23:25] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1343 places, 1202/1203 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1343 places, 1202/1203 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s304 0) (EQ s329 1)), p1:(OR (EQ s797 0) (EQ s1252 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 1215 ms.
Product exploration explored 100000 steps with 50000 reset in 1074 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-00 finished in 4639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1342 transition count 924
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 1064 transition count 924
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 556 place count 1064 transition count 765
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 874 place count 905 transition count 765
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 875 place count 904 transition count 764
Iterating global reduction 2 with 1 rules applied. Total rules applied 876 place count 904 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 876 place count 904 transition count 763
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 878 place count 903 transition count 763
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1554 place count 565 transition count 425
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 565 transition count 424
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 1557 place count 564 transition count 423
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1673 place count 506 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1675 place count 504 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1676 place count 503 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1676 place count 503 transition count 419
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1680 place count 501 transition count 419
Applied a total of 1680 rules in 173 ms. Remains 501 /1343 variables (removed 842) and now considering 419/1203 (removed 784) transitions.
// Phase 1: matrix 419 rows 501 cols
[2022-05-20 05:23:28] [INFO ] Computed 220 place invariants in 1 ms
[2022-05-20 05:23:28] [INFO ] Implicit Places using invariants in 289 ms returned [484, 488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1343 places, 419/1203 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 497 transition count 417
Applied a total of 4 rules in 14 ms. Remains 497 /499 variables (removed 2) and now considering 417/419 (removed 2) transitions.
// Phase 1: matrix 417 rows 497 cols
[2022-05-20 05:23:28] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:28] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 417 rows 497 cols
[2022-05-20 05:23:28] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 05:23:29] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1343 places, 417/1203 transitions.
Finished structural reductions, in 2 iterations. Remains : 497/1343 places, 417/1203 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-01 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 s103 0) (EQ s380 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 418 ms.
Stack based approach found an accepted trace after 24583 steps with 0 reset with depth 24584 and stack size 21406 in 155 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-01 finished in 1729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1343 transition count 923
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 877 place count 904 transition count 764
Iterating global reduction 2 with 1 rules applied. Total rules applied 878 place count 904 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 878 place count 904 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 880 place count 903 transition count 763
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1562 place count 562 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1563 place count 562 transition count 421
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 1565 place count 561 transition count 420
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 502 transition count 420
Applied a total of 1683 rules in 120 ms. Remains 502 /1343 variables (removed 841) and now considering 420/1203 (removed 783) transitions.
// Phase 1: matrix 420 rows 502 cols
[2022-05-20 05:23:30] [INFO ] Computed 221 place invariants in 10 ms
[2022-05-20 05:23:30] [INFO ] Implicit Places using invariants in 231 ms returned [495]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 232 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1343 places, 420/1203 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 501 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 499 transition count 418
Applied a total of 4 rules in 13 ms. Remains 499 /501 variables (removed 2) and now considering 418/420 (removed 2) transitions.
// Phase 1: matrix 418 rows 499 cols
[2022-05-20 05:23:30] [INFO ] Computed 220 place invariants in 2 ms
[2022-05-20 05:23:30] [INFO ] Implicit Places using invariants in 230 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 231 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/1343 places, 418/1203 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 495 transition count 416
Applied a total of 4 rules in 14 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2022-05-20 05:23:30] [INFO ] Computed 218 place invariants in 2 ms
[2022-05-20 05:23:30] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 416 rows 495 cols
[2022-05-20 05:23:30] [INFO ] Computed 218 place invariants in 1 ms
[2022-05-20 05:23:31] [INFO ] State equation strengthened by 136 read => feed constraints.
[2022-05-20 05:23:31] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 495/1343 places, 416/1203 transitions.
Finished structural reductions, in 3 iterations. Remains : 495/1343 places, 416/1203 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-03 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:(OR (EQ s326 0) (EQ s0 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 198 reset in 414 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-03 finished in 2463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(X(p1))))))'
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1341 transition count 1201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1341 transition count 1201
Applied a total of 4 rules in 78 ms. Remains 1341 /1343 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:32] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:23:32] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:32] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:23:33] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:33] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:23:34] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1343 places, 1201/1203 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1343 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s278 0) (EQ s1054 1)), p1:(OR (EQ s457 0) (EQ s995 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 638 ms.
Product exploration explored 100000 steps with 25000 reset in 604 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1341 stabilizing places and 318/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 8 states, 12 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:36] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:23:36] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 05:23:36] [INFO ] [Nat]Absence check using 221 positive place invariants in 53 ms returned sat
[2022-05-20 05:23:37] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 05:23:37] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 0 ms to minimize.
[2022-05-20 05:23:37] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2022-05-20 05:23:38] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2022-05-20 05:23:38] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 1 ms to minimize.
[2022-05-20 05:23:38] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2022-05-20 05:23:38] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
[2022-05-20 05:23:39] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2022-05-20 05:23:39] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 0 ms to minimize.
[2022-05-20 05:23:39] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2022-05-20 05:23:39] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 1 ms to minimize.
[2022-05-20 05:23:40] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2022-05-20 05:23:40] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2022-05-20 05:23:40] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2022-05-20 05:23:40] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 0 ms to minimize.
[2022-05-20 05:23:40] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 1 ms to minimize.
[2022-05-20 05:23:41] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2022-05-20 05:23:41] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2022-05-20 05:23:41] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 11 ms to minimize.
[2022-05-20 05:23:41] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2022-05-20 05:23:41] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 0 ms to minimize.
[2022-05-20 05:23:42] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2022-05-20 05:23:42] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2022-05-20 05:23:42] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2022-05-20 05:23:42] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2022-05-20 05:23:42] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2022-05-20 05:23:42] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2022-05-20 05:23:43] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2022-05-20 05:23:43] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2022-05-20 05:23:43] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2022-05-20 05:23:43] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2022-05-20 05:23:43] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6136 ms
[2022-05-20 05:23:43] [INFO ] After 6753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-20 05:23:43] [INFO ] After 7088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1341 transition count 925
Reduce places removed 276 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 277 rules applied. Total rules applied 553 place count 1065 transition count 924
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 554 place count 1064 transition count 924
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 554 place count 1064 transition count 765
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 872 place count 905 transition count 765
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1546 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1547 place count 568 transition count 427
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 1549 place count 567 transition count 426
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1665 place count 509 transition count 426
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 1724 place count 509 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1725 place count 508 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1726 place count 507 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1726 place count 507 transition count 423
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1730 place count 505 transition count 423
Applied a total of 1730 rules in 108 ms. Remains 505 /1341 variables (removed 836) and now considering 423/1201 (removed 778) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/1341 places, 423/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 114305 steps, run visited all 2 properties in 846 ms. (steps per millisecond=135 )
Probabilistic random walk after 114305 steps, saw 94170 distinct states, run finished after 847 ms. (steps per millisecond=134 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 7 states, 8 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Applied a total of 0 rules in 57 ms. Remains 1341 /1341 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:45] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:23:46] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:46] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:23:47] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:47] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:23:47] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1341 places, 1201/1201 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1341 stabilizing places and 318/1201 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 p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 7 states, 8 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 1190 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:23:49] [INFO ] Computed 221 place invariants in 7 ms
[2022-05-20 05:23:49] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 05:23:49] [INFO ] [Nat]Absence check using 221 positive place invariants in 56 ms returned sat
[2022-05-20 05:23:50] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 05:23:50] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2022-05-20 05:23:50] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2022-05-20 05:23:50] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2022-05-20 05:23:51] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2022-05-20 05:23:51] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2022-05-20 05:23:51] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 0 ms to minimize.
[2022-05-20 05:23:51] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2022-05-20 05:23:52] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2022-05-20 05:23:52] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
[2022-05-20 05:23:52] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 1 ms to minimize.
[2022-05-20 05:23:52] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2022-05-20 05:23:52] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2022-05-20 05:23:53] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 0 ms to minimize.
[2022-05-20 05:23:53] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 1 ms to minimize.
[2022-05-20 05:23:53] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 1 ms to minimize.
[2022-05-20 05:23:53] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 0 ms to minimize.
[2022-05-20 05:23:53] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2022-05-20 05:23:54] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2022-05-20 05:23:54] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2022-05-20 05:23:54] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 1 ms to minimize.
[2022-05-20 05:23:54] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2022-05-20 05:23:54] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-05-20 05:23:55] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2022-05-20 05:23:55] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2022-05-20 05:23:55] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2022-05-20 05:23:55] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2022-05-20 05:23:55] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-20 05:23:55] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2022-05-20 05:23:56] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2022-05-20 05:23:56] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2022-05-20 05:23:56] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6109 ms
[2022-05-20 05:23:56] [INFO ] After 6724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-20 05:23:56] [INFO ] After 7062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1341 transition count 925
Reduce places removed 276 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 277 rules applied. Total rules applied 553 place count 1065 transition count 924
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 554 place count 1064 transition count 924
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 554 place count 1064 transition count 765
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 872 place count 905 transition count 765
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1546 place count 568 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1547 place count 568 transition count 427
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 1549 place count 567 transition count 426
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1665 place count 509 transition count 426
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 1724 place count 509 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1725 place count 508 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1726 place count 507 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1726 place count 507 transition count 423
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1730 place count 505 transition count 423
Applied a total of 1730 rules in 104 ms. Remains 505 /1341 variables (removed 836) and now considering 423/1201 (removed 778) transitions.
Finished structural reductions, in 1 iterations. Remains : 505/1341 places, 423/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 114305 steps, run visited all 2 properties in 759 ms. (steps per millisecond=150 )
Probabilistic random walk after 114305 steps, saw 94170 distinct states, run finished after 759 ms. (steps per millisecond=150 ) properties seen :2
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 1215 ms. Reduced automaton from 7 states, 8 edges and 2 AP to 7 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 1517 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 580 ms.
Product exploration explored 100000 steps with 25000 reset in 571 ms.
Applying partial POR strategy [false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 1341 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1341/1341 places, 1201/1201 transitions.
Performed 277 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 1341 transition count 1201
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 277 place count 1341 transition count 1281
Deduced a syphon composed of 377 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 377 place count 1341 transition count 1281
Performed 376 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 753 places in 1 ms
Iterating global reduction 1 with 376 rules applied. Total rules applied 753 place count 1341 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 754 place count 1341 transition count 1281
Renaming transitions due to excessive name length > 1024 char.
Discarding 138 places :
Symmetric choice reduction at 2 with 138 rule applications. Total rules 892 place count 1203 transition count 1143
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 138 rules applied. Total rules applied 1030 place count 1203 transition count 1143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 616 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1031 place count 1203 transition count 1143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1033 place count 1201 transition count 1141
Deduced a syphon composed of 614 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1035 place count 1201 transition count 1141
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -330
Deduced a syphon composed of 692 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1113 place count 1201 transition count 1471
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1191 place count 1123 transition count 1315
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1269 place count 1123 transition count 1315
Deduced a syphon composed of 614 places in 0 ms
Applied a total of 1269 rules in 587 ms. Remains 1123 /1341 variables (removed 218) and now considering 1315/1201 (removed -114) transitions.
[2022-05-20 05:24:02] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1315 rows 1123 cols
[2022-05-20 05:24:02] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:24:03] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1123/1341 places, 1315/1201 transitions.
Finished structural reductions, in 1 iterations. Remains : 1123/1341 places, 1315/1201 transitions.
Product exploration explored 100000 steps with 25000 reset in 610 ms.
Product exploration explored 100000 steps with 25000 reset in 581 ms.
Built C files in :
/tmp/ltsmin12964305608216588648
[2022-05-20 05:24:05] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12964305608216588648
Running compilation step : cd /tmp/ltsmin12964305608216588648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2074 ms.
Running link step : cd /tmp/ltsmin12964305608216588648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12964305608216588648;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8570102951619315097.hoa' '--buchi-type=spotba'
LTSmin run took 544 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-05 finished in 35445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((X(p1)||p2)))))'
Support contains 6 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1341 transition count 1201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1341 transition count 1201
Applied a total of 4 rules in 78 ms. Remains 1341 /1343 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:08] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:24:08] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:08] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:24:09] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:09] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:24:09] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1343 places, 1201/1203 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1343 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s894 0) (EQ s599 1) (AND (EQ s1275 0) (EQ s511 1))), p2:(AND (EQ s184 0) (EQ s546 1)), p1:(AND (EQ s599 0) (EQ s894 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6592 steps with 0 reset in 39 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-10 finished in 2157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(G(p0))||G(X(p0)))))'
Support contains 1 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1341 transition count 1201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1341 transition count 1201
Applied a total of 4 rules in 75 ms. Remains 1341 /1343 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:10] [INFO ] Computed 221 place invariants in 4 ms
[2022-05-20 05:24:10] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:10] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:24:11] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:11] [INFO ] Computed 221 place invariants in 8 ms
[2022-05-20 05:24:12] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1343 places, 1201/1203 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1343 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-11 finished in 2080 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(!p2)&&p1)))'
Support contains 6 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1342 transition count 1202
Applied a total of 2 rules in 69 ms. Remains 1342 /1343 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:24:12] [INFO ] Computed 221 place invariants in 9 ms
[2022-05-20 05:24:12] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:24:12] [INFO ] Computed 221 place invariants in 6 ms
[2022-05-20 05:24:13] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
// Phase 1: matrix 1202 rows 1342 cols
[2022-05-20 05:24:13] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:24:14] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1342/1343 places, 1202/1203 transitions.
Finished structural reductions, in 1 iterations. Remains : 1342/1343 places, 1202/1203 transitions.
Stuttering acceptance computed with spot in 983 ms :[true, (OR (NOT p1) p2), p2, p2]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (OR (EQ s946 0) (EQ s978 1)) (OR (EQ s339 0) (EQ s1207 1))), p0:(AND (OR (EQ s946 0) (EQ s978 1)) (OR (EQ s339 0) (EQ s1207 1))), p2:(OR (EQ s814 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3623 steps with 0 reset in 21 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-13 finished in 3004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 2 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1341 transition count 1201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1341 transition count 1201
Applied a total of 4 rules in 96 ms. Remains 1341 /1343 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:15] [INFO ] Computed 221 place invariants in 5 ms
[2022-05-20 05:24:15] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:15] [INFO ] Computed 221 place invariants in 3 ms
[2022-05-20 05:24:16] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
// Phase 1: matrix 1201 rows 1341 cols
[2022-05-20 05:24:16] [INFO ] Computed 221 place invariants in 2 ms
[2022-05-20 05:24:17] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1341/1343 places, 1201/1203 transitions.
Finished structural reductions, in 1 iterations. Remains : 1341/1343 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s567 0) (EQ s180 1)), p0:(OR (EQ s567 0) (EQ s180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1065 ms.
Product exploration explored 100000 steps with 50000 reset in 1077 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 398 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-15 finished in 4691 ms.
All properties solved by simple procedures.
Total runtime 95645 ms.

BK_STOP 1653024259943

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020B"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025500635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;