Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715100307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679272546458

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:35:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:35:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:35:49] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-20 00:35:49] [INFO ] Transformed 763 places.
[2023-03-20 00:35:49] [INFO ] Transformed 563 transitions.
[2023-03-20 00:35:49] [INFO ] Found NUPN structural information;
[2023-03-20 00:35:49] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 94 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:35:49] [INFO ] Computed 361 place invariants in 24 ms
[2023-03-20 00:35:51] [INFO ] Implicit Places using invariants in 1950 ms returned []
[2023-03-20 00:35:51] [INFO ] Invariant cache hit.
[2023-03-20 00:35:53] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 3741 ms to find 0 implicit places.
[2023-03-20 00:35:53] [INFO ] Invariant cache hit.
[2023-03-20 00:35:53] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4523 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 24 out of 763 places after structural reductions.
[2023-03-20 00:35:54] [INFO ] Flatten gal took : 127 ms
[2023-03-20 00:35:54] [INFO ] Flatten gal took : 52 ms
[2023-03-20 00:35:54] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 22 out of 763 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 00:35:55] [INFO ] Invariant cache hit.
[2023-03-20 00:35:56] [INFO ] [Real]Absence check using 361 positive place invariants in 180 ms returned sat
[2023-03-20 00:35:57] [INFO ] After 1628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 00:35:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 82 ms returned sat
[2023-03-20 00:35:58] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 00:35:59] [INFO ] After 1676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 505 ms.
[2023-03-20 00:36:00] [INFO ] After 2801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 15 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 79 place count 761 transition count 560
Applied a total of 79 rules in 127 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 151470 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 151470 steps, saw 146035 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :7
Running SMT prover for 2 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-20 00:36:04] [INFO ] Computed 361 place invariants in 18 ms
[2023-03-20 00:36:05] [INFO ] [Real]Absence check using 361 positive place invariants in 91 ms returned sat
[2023-03-20 00:36:05] [INFO ] After 365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 00:36:05] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 00:36:05] [INFO ] After 58ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:36:05] [INFO ] After 742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:36:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 103 ms returned sat
[2023-03-20 00:36:06] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:36:06] [INFO ] After 201ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 00:36:06] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 00:36:06] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 761 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 760 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 758 transition count 558
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 757 transition count 558
Applied a total of 8 rules in 163 ms. Remains 757 /761 variables (removed 4) and now considering 558/560 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 757/761 places, 558/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 757 cols
[2023-03-20 00:36:07] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-20 00:36:07] [INFO ] [Real]Absence check using 359 positive place invariants in 52 ms returned sat
[2023-03-20 00:36:07] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:07] [INFO ] [Nat]Absence check using 359 positive place invariants in 48 ms returned sat
[2023-03-20 00:36:08] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-20 00:36:08] [INFO ] After 97ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:08] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 00:36:08] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 174 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 5 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 63 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2023-03-20 00:36:09] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-20 00:36:09] [INFO ] Implicit Places using invariants in 539 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 543 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 46 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-20 00:36:09] [INFO ] Computed 359 place invariants in 37 ms
[2023-03-20 00:36:10] [INFO ] Implicit Places using invariants in 563 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 564 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 37 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-20 00:36:10] [INFO ] Computed 358 place invariants in 6 ms
[2023-03-20 00:36:10] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-20 00:36:10] [INFO ] Invariant cache hit.
[2023-03-20 00:36:11] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2911 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s177 0) (EQ s729 1)), p0:(OR (EQ s7 0) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 789 ms.
Product exploration explored 100000 steps with 0 reset in 935 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 279522 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{1=1}
Probabilistic random walk after 279522 steps, saw 276054 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-20 00:36:17] [INFO ] Invariant cache hit.
[2023-03-20 00:36:17] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2023-03-20 00:36:18] [INFO ] After 406ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:36:18] [INFO ] After 481ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:18] [INFO ] After 703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 66 ms returned sat
[2023-03-20 00:36:19] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:19] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-20 00:36:19] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 756 transition count 558
Applied a total of 77 rules in 65 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334847 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334847 steps, saw 315220 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2023-03-20 00:36:22] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-20 00:36:22] [INFO ] [Real]Absence check using 358 positive place invariants in 74 ms returned sat
[2023-03-20 00:36:23] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:23] [INFO ] [Nat]Absence check using 358 positive place invariants in 65 ms returned sat
[2023-03-20 00:36:23] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 00:36:23] [INFO ] After 107ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:23] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-20 00:36:23] [INFO ] After 860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 415 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 33 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-20 00:36:24] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:36:25] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-20 00:36:25] [INFO ] Invariant cache hit.
[2023-03-20 00:36:26] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2023-03-20 00:36:26] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-20 00:36:26] [INFO ] Invariant cache hit.
[2023-03-20 00:36:26] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1957 ms. Remains : 756/756 places, 558/558 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 305311 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{1=1}
Probabilistic random walk after 305311 steps, saw 301548 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-20 00:36:30] [INFO ] Invariant cache hit.
[2023-03-20 00:36:30] [INFO ] [Real]Absence check using 358 positive place invariants in 83 ms returned sat
[2023-03-20 00:36:30] [INFO ] After 250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:36:30] [INFO ] After 313ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:30] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 88 ms returned sat
[2023-03-20 00:36:31] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:31] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-20 00:36:31] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 756 transition count 558
Applied a total of 77 rules in 37 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 756/756 places, 558/558 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306870 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306870 steps, saw 290427 distinct states, run finished after 3015 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 558 rows 756 cols
[2023-03-20 00:36:34] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-20 00:36:34] [INFO ] [Real]Absence check using 358 positive place invariants in 45 ms returned sat
[2023-03-20 00:36:35] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:36:35] [INFO ] [Nat]Absence check using 358 positive place invariants in 45 ms returned sat
[2023-03-20 00:36:35] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-20 00:36:35] [INFO ] After 112ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:36:36] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-20 00:36:36] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 232 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 473 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 654 ms.
Product exploration explored 100000 steps with 0 reset in 785 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 13 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-20 00:36:38] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:36:38] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-20 00:36:38] [INFO ] Invariant cache hit.
[2023-03-20 00:36:39] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2023-03-20 00:36:39] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-20 00:36:39] [INFO ] Invariant cache hit.
[2023-03-20 00:36:40] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1943 ms. Remains : 756/756 places, 558/558 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-02 finished in 31602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:36:40] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-20 00:36:41] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-20 00:36:41] [INFO ] Invariant cache hit.
[2023-03-20 00:36:41] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2023-03-20 00:36:41] [INFO ] Invariant cache hit.
[2023-03-20 00:36:42] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1879 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s748 1), p0:(OR (EQ s413 0) (EQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2133 reset in 873 ms.
Stack based approach found an accepted trace after 53 steps with 2 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-05 finished in 2903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:36:43] [INFO ] Invariant cache hit.
[2023-03-20 00:36:43] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-20 00:36:43] [INFO ] Invariant cache hit.
[2023-03-20 00:36:45] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2023-03-20 00:36:45] [INFO ] Invariant cache hit.
[2023-03-20 00:36:45] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2207 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s215 0), p1:(AND (NEQ s272 0) (NEQ s335 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 753 ms.
Product exploration explored 100000 steps with 0 reset in 820 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) 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 2) seen :0
Finished probabilistic random walk after 21412 steps, run visited all 2 properties in 262 ms. (steps per millisecond=81 )
Probabilistic random walk after 21412 steps, saw 20844 distinct states, run finished after 263 ms. (steps per millisecond=81 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:36:48] [INFO ] Invariant cache hit.
[2023-03-20 00:36:49] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-20 00:36:49] [INFO ] Invariant cache hit.
[2023-03-20 00:36:50] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2023-03-20 00:36:50] [INFO ] Invariant cache hit.
[2023-03-20 00:36:51] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2080 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21412 steps, run visited all 2 properties in 271 ms. (steps per millisecond=79 )
Probabilistic random walk after 21412 steps, saw 20844 distinct states, run finished after 272 ms. (steps per millisecond=78 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 428 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 708 ms.
Product exploration explored 100000 steps with 0 reset in 769 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 562
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 125 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:36:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:36:55] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-20 00:36:55] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 765 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:36:55] [INFO ] Computed 361 place invariants in 2 ms
[2023-03-20 00:36:56] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-20 00:36:56] [INFO ] Invariant cache hit.
[2023-03-20 00:36:57] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2023-03-20 00:36:57] [INFO ] Invariant cache hit.
[2023-03-20 00:36:57] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1910 ms. Remains : 763/763 places, 562/562 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-08 finished in 14323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U p1)) U !(X(p1)||F(p2))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 11 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:36:57] [INFO ] Invariant cache hit.
[2023-03-20 00:36:58] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-20 00:36:58] [INFO ] Invariant cache hit.
[2023-03-20 00:36:59] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2023-03-20 00:36:59] [INFO ] Invariant cache hit.
[2023-03-20 00:36:59] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1749 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR p2 p1), p1, p2, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s465 1), p1:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 678 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-12 finished in 2669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U p1)||G(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:37:00] [INFO ] Invariant cache hit.
[2023-03-20 00:37:00] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-20 00:37:00] [INFO ] Invariant cache hit.
[2023-03-20 00:37:02] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2023-03-20 00:37:02] [INFO ] Invariant cache hit.
[2023-03-20 00:37:02] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2232 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(NEQ s398 1), p0:(OR (EQ s470 0) (EQ s241 1)), p2:(OR (EQ s298 0) (EQ s653 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2180 ms.
Product exploration explored 100000 steps with 50000 reset in 2178 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) p0))))
Knowledge based reduction with 13 factoid took 658 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-13 finished in 7447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 31 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:37:07] [INFO ] Invariant cache hit.
[2023-03-20 00:37:08] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-20 00:37:08] [INFO ] Invariant cache hit.
[2023-03-20 00:37:09] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2023-03-20 00:37:09] [INFO ] Invariant cache hit.
[2023-03-20 00:37:10] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2184 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s88 1), p1:(AND (EQ s754 0) (EQ s29 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 697 ms.
Product exploration explored 100000 steps with 0 reset in 850 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 442 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 516 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 00:37:13] [INFO ] Invariant cache hit.
[2023-03-20 00:37:14] [INFO ] [Real]Absence check using 361 positive place invariants in 304 ms returned sat
[2023-03-20 00:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:37:14] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-20 00:37:14] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-20 00:37:14] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 763 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 17 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:37:14] [INFO ] Invariant cache hit.
[2023-03-20 00:37:15] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-20 00:37:15] [INFO ] Invariant cache hit.
[2023-03-20 00:37:16] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2023-03-20 00:37:16] [INFO ] Invariant cache hit.
[2023-03-20 00:37:16] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2183 ms. Remains : 763/763 places, 562/562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 00:37:17] [INFO ] Invariant cache hit.
[2023-03-20 00:37:18] [INFO ] [Real]Absence check using 361 positive place invariants in 226 ms returned sat
[2023-03-20 00:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:37:18] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-20 00:37:18] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-20 00:37:18] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 704 ms.
Product exploration explored 100000 steps with 0 reset in 835 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 562
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 59 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2023-03-20 00:37:20] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:37:20] [INFO ] Computed 361 place invariants in 1 ms
[2023-03-20 00:37:21] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 562/562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 596 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-20 00:37:21] [INFO ] Computed 361 place invariants in 4 ms
[2023-03-20 00:37:22] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-20 00:37:22] [INFO ] Invariant cache hit.
[2023-03-20 00:37:23] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
[2023-03-20 00:37:23] [INFO ] Invariant cache hit.
[2023-03-20 00:37:23] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2422 ms. Remains : 763/763 places, 562/562 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 16058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040A-LTLCardinality-08
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 67 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2023-03-20 00:37:24] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-20 00:37:24] [INFO ] Implicit Places using invariants in 517 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 520 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 18 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-20 00:37:24] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-20 00:37:25] [INFO ] Implicit Places using invariants in 588 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 589 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 20 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-20 00:37:25] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:37:26] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-20 00:37:26] [INFO ] Invariant cache hit.
[2023-03-20 00:37:27] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3129 ms. Remains : 756/763 places, 558/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s215 0), p1:(AND (NEQ s272 0) (NEQ s335 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 609 ms.
Product exploration explored 100000 steps with 0 reset in 806 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) 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 2) seen :0
Finished probabilistic random walk after 21444 steps, run visited all 2 properties in 319 ms. (steps per millisecond=67 )
Probabilistic random walk after 21444 steps, saw 20834 distinct states, run finished after 320 ms. (steps per millisecond=67 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 21 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-20 00:37:30] [INFO ] Invariant cache hit.
[2023-03-20 00:37:31] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-20 00:37:31] [INFO ] Invariant cache hit.
[2023-03-20 00:37:32] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2023-03-20 00:37:32] [INFO ] Invariant cache hit.
[2023-03-20 00:37:32] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1882 ms. Remains : 756/756 places, 558/558 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Finished probabilistic random walk after 21444 steps, run visited all 2 properties in 310 ms. (steps per millisecond=69 )
Probabilistic random walk after 21444 steps, saw 20834 distinct states, run finished after 311 ms. (steps per millisecond=68 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 343 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 741 ms.
Product exploration explored 100000 steps with 0 reset in 1151 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 44 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-20 00:37:36] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 00:37:36] [INFO ] Invariant cache hit.
[2023-03-20 00:37:37] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 756/756 places, 558/558 transitions.
Support contains 3 out of 756 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 8 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-20 00:37:37] [INFO ] Invariant cache hit.
[2023-03-20 00:37:37] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-20 00:37:37] [INFO ] Invariant cache hit.
[2023-03-20 00:37:38] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2023-03-20 00:37:38] [INFO ] Invariant cache hit.
[2023-03-20 00:37:39] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1959 ms. Remains : 756/756 places, 558/558 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-08 finished in 15107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040A-LTLCardinality-14
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Applied a total of 2 rules in 23 ms. Remains 762 /763 variables (removed 1) and now considering 561/562 (removed 1) transitions.
// Phase 1: matrix 561 rows 762 cols
[2023-03-20 00:37:39] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-20 00:37:39] [INFO ] Implicit Places using invariants in 612 ms returned [755]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 625 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 761/763 places, 561/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 761 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 560
Applied a total of 2 rules in 14 ms. Remains 760 /761 variables (removed 1) and now considering 560/561 (removed 1) transitions.
// Phase 1: matrix 560 rows 760 cols
[2023-03-20 00:37:40] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-20 00:37:40] [INFO ] Implicit Places using invariants in 379 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 385 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 759/763 places, 560/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 54 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-20 00:37:40] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:37:40] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-20 00:37:40] [INFO ] Invariant cache hit.
[2023-03-20 00:37:41] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 758/763 places, 559/562 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2597 ms. Remains : 758/763 places, 559/562 transitions.
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s88 1), p1:(AND (EQ s751 0) (EQ s29 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 859 ms.
Product exploration explored 100000 steps with 0 reset in 1035 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 475 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 462 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 00:37:45] [INFO ] Invariant cache hit.
[2023-03-20 00:37:45] [INFO ] [Real]Absence check using 359 positive place invariants in 169 ms returned sat
[2023-03-20 00:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:37:46] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2023-03-20 00:37:46] [INFO ] Computed and/alt/rep : 558/1990/558 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-20 00:37:46] [INFO ] Added : 0 causal constraints over 0 iterations in 104 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 758 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 559/559 transitions.
Applied a total of 0 rules in 10 ms. Remains 758 /758 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2023-03-20 00:37:46] [INFO ] Invariant cache hit.
[2023-03-20 00:37:47] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-20 00:37:47] [INFO ] Invariant cache hit.
[2023-03-20 00:37:48] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2023-03-20 00:37:48] [INFO ] Invariant cache hit.
[2023-03-20 00:37:49] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2117 ms. Remains : 758/758 places, 559/559 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 00:37:49] [INFO ] Invariant cache hit.
[2023-03-20 00:37:50] [INFO ] [Real]Absence check using 359 positive place invariants in 295 ms returned sat
[2023-03-20 00:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:37:51] [INFO ] [Real]Absence check using state equation in 983 ms returned sat
[2023-03-20 00:37:51] [INFO ] Computed and/alt/rep : 558/1990/558 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-20 00:37:51] [INFO ] Added : 0 causal constraints over 0 iterations in 134 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 757 ms.
Product exploration explored 100000 steps with 0 reset in 1060 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 559/559 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 758 transition count 559
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 50 ms. Remains 758 /758 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2023-03-20 00:37:54] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 559 rows 758 cols
[2023-03-20 00:37:54] [INFO ] Computed 359 place invariants in 19 ms
[2023-03-20 00:37:54] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/758 places, 559/559 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 539 ms. Remains : 758/758 places, 559/559 transitions.
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 559/559 transitions.
Applied a total of 0 rules in 8 ms. Remains 758 /758 variables (removed 0) and now considering 559/559 (removed 0) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-20 00:37:54] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:37:55] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-20 00:37:55] [INFO ] Invariant cache hit.
[2023-03-20 00:37:56] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
[2023-03-20 00:37:56] [INFO ] Invariant cache hit.
[2023-03-20 00:37:56] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2055 ms. Remains : 758/758 places, 559/559 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 17446 ms.
[2023-03-20 00:37:56] [INFO ] Flatten gal took : 51 ms
[2023-03-20 00:37:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-20 00:37:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 763 places, 562 transitions and 2404 arcs took 4 ms.
Total runtime 127674 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-040A
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
LTLCardinality

FORMULA ShieldIIPt-PT-040A-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679272700528

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 9 (type EXCL) for 6 ShieldIIPt-PT-040A-LTLCardinality-14
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 9 (type EXCL) for ShieldIIPt-PT-040A-LTLCardinality-14
lola: result : false
lola: markings : 17889
lola: fired transitions : 17889
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-040A-LTLCardinality-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldIIPt-PT-040A-LTLCardinality-08
lola: result : false
lola: markings : 17889
lola: fired transitions : 17889
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-040A-LTLCardinality-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040A-LTLCardinality-08: LTL false LTL model checker
ShieldIIPt-PT-040A-LTLCardinality-14: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040A-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 5/32 ShieldIIPt-PT-040A-LTLCardinality-02 301703 m, 60340 m/sec, 385317 t fired, .

Time elapsed: 6 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040A-LTLCardinality-08: LTL false LTL model checker
ShieldIIPt-PT-040A-LTLCardinality-14: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040A-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 9/32 ShieldIIPt-PT-040A-LTLCardinality-02 620517 m, 63762 m/sec, 827648 t fired, .

Time elapsed: 11 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040A-LTLCardinality-08: LTL false LTL model checker
ShieldIIPt-PT-040A-LTLCardinality-14: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040A-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 13/32 ShieldIIPt-PT-040A-LTLCardinality-02 942635 m, 64423 m/sec, 1273941 t fired, .

Time elapsed: 16 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040A-LTLCardinality-08: LTL false LTL model checker
ShieldIIPt-PT-040A-LTLCardinality-14: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040A-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 18/32 ShieldIIPt-PT-040A-LTLCardinality-02 1272924 m, 66057 m/sec, 1718795 t fired, .

Time elapsed: 21 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 1 (type EXCL) for ShieldIIPt-PT-040A-LTLCardinality-02
lola: result : false
lola: markings : 1492743
lola: fired transitions : 2039370
lola: time used : 23.000000
lola: memory pages used : 21
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040A-LTLCardinality-02: LTL false LTL model checker
ShieldIIPt-PT-040A-LTLCardinality-08: LTL false LTL model checker
ShieldIIPt-PT-040A-LTLCardinality-14: CONJ false LTL model checker


Time elapsed: 24 secs. Pages in use: 21

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-040A, 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 r391-oct2-167903715100307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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