fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903715600691
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldPPPt-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2267.184 714727.00 879686.00 136.20 FTF?TFTFFFFTTFFT normal

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-167903715600691.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 ShieldPPPt-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K Feb 25 21:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 21:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 21:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:13 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.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 21:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 21:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 21:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 685K 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 ShieldPPPt-PT-100A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679280919323

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=ShieldPPPt-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:55:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:55:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:55:22] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-20 02:55:22] [INFO ] Transformed 2503 places.
[2023-03-20 02:55:22] [INFO ] Transformed 1803 transitions.
[2023-03-20 02:55:22] [INFO ] Found NUPN structural information;
[2023-03-20 02:55:22] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 286 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-20 02:55:22] [INFO ] Computed 1101 place invariants in 56 ms
[2023-03-20 02:55:23] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-20 02:55:23] [INFO ] Invariant cache hit.
[2023-03-20 02:55:27] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 4265 ms to find 0 implicit places.
[2023-03-20 02:55:27] [INFO ] Invariant cache hit.
[2023-03-20 02:55:29] [INFO ] Dead Transitions using invariants and state equation in 2600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7160 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 28 out of 2503 places after structural reductions.
[2023-03-20 02:55:30] [INFO ] Flatten gal took : 267 ms
[2023-03-20 02:55:30] [INFO ] Flatten gal took : 178 ms
[2023-03-20 02:55:30] [INFO ] Input system was already deterministic with 1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-20 02:55:33] [INFO ] Invariant cache hit.
[2023-03-20 02:55:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 448 ms returned sat
[2023-03-20 02:55:39] [INFO ] After 5687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 02:55:40] [INFO ] [Nat]Absence check using 1101 positive place invariants in 462 ms returned sat
[2023-03-20 02:55:44] [INFO ] After 2836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 02:55:47] [INFO ] After 5436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1645 ms.
[2023-03-20 02:55:48] [INFO ] After 9599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1083 ms.
Support contains 24 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 391 times.
Drop transitions removed 391 transitions
Iterating global reduction 0 with 391 rules applied. Total rules applied 395 place count 2501 transition count 1800
Applied a total of 395 rules in 584 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 104265 steps, run timeout after 6005 ms. (steps per millisecond=17 ) properties seen :{8=1}
Probabilistic random walk after 104265 steps, saw 100124 distinct states, run finished after 6007 ms. (steps per millisecond=17 ) properties seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-20 02:55:58] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-20 02:55:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 269 ms returned sat
[2023-03-20 02:56:03] [INFO ] After 4374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:56:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 348 ms returned sat
[2023-03-20 02:56:07] [INFO ] After 2302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:56:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 02:56:09] [INFO ] After 1734ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:56:10] [INFO ] Deduced a trap composed of 7 places in 584 ms of which 2 ms to minimize.
[2023-03-20 02:56:10] [INFO ] Deduced a trap composed of 7 places in 515 ms of which 14 ms to minimize.
[2023-03-20 02:56:11] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 1 ms to minimize.
[2023-03-20 02:56:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1981 ms
[2023-03-20 02:56:13] [INFO ] Deduced a trap composed of 6 places in 554 ms of which 13 ms to minimize.
[2023-03-20 02:56:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 723 ms
[2023-03-20 02:56:14] [INFO ] After 6581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1669 ms.
[2023-03-20 02:56:15] [INFO ] After 12781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 545 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 1800
Applied a total of 1 rules in 364 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 53579 steps, run timeout after 3002 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53579 steps, saw 50688 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-20 02:56:21] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-20 02:56:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 409 ms returned sat
[2023-03-20 02:56:26] [INFO ] After 5112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:56:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 285 ms returned sat
[2023-03-20 02:56:31] [INFO ] After 2618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:56:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 02:56:33] [INFO ] After 1622ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:56:34] [INFO ] Deduced a trap composed of 7 places in 418 ms of which 1 ms to minimize.
[2023-03-20 02:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 628 ms
[2023-03-20 02:56:36] [INFO ] After 4807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1577 ms.
[2023-03-20 02:56:37] [INFO ] After 11119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 495 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 84 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 109 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-20 02:56:38] [INFO ] Invariant cache hit.
[2023-03-20 02:56:45] [INFO ] Implicit Places using invariants in 6400 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6425 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 196 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-20 02:56:45] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-20 02:56:46] [INFO ] Implicit Places using invariants in 1657 ms returned []
[2023-03-20 02:56:46] [INFO ] Invariant cache hit.
[2023-03-20 02:56:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 02:56:55] [INFO ] Implicit Places using invariants and state equation in 8761 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10441 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 455 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 02:56:56] [INFO ] Computed 1098 place invariants in 12 ms
[2023-03-20 02:56:58] [INFO ] Implicit Places using invariants in 2007 ms returned []
[2023-03-20 02:56:58] [INFO ] Invariant cache hit.
[2023-03-20 02:56:59] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-20 02:57:05] [INFO ] Implicit Places using invariants and state equation in 7635 ms returned []
Implicit Place search using SMT with State Equation took 9645 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 27271 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 60572 steps, run timeout after 3002 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60572 steps, saw 57472 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-20 02:57:10] [INFO ] Invariant cache hit.
[2023-03-20 02:57:11] [INFO ] [Real]Absence check using 1098 positive place invariants in 314 ms returned sat
[2023-03-20 02:57:16] [INFO ] After 5308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:57:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 346 ms returned sat
[2023-03-20 02:57:24] [INFO ] After 6610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:57:24] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-20 02:57:27] [INFO ] After 3248ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:57:30] [INFO ] After 6058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1861 ms.
[2023-03-20 02:57:32] [INFO ] After 16367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 2900 steps, including 2 resets, run visited all 1 properties in 45 ms. (steps per millisecond=64 )
Parikh walk visited 11 properties in 1263 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(p0)&&F(G(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 243 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-20 02:57:34] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-20 02:57:35] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2023-03-20 02:57:35] [INFO ] Invariant cache hit.
[2023-03-20 02:57:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:57:40] [INFO ] Implicit Places using invariants and state equation in 5032 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6572 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 195 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-20 02:57:41] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-20 02:57:44] [INFO ] Implicit Places using invariants in 3575 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3582 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 235 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 02:57:45] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 02:57:46] [INFO ] Implicit Places using invariants in 1550 ms returned []
[2023-03-20 02:57:46] [INFO ] Invariant cache hit.
[2023-03-20 02:57:51] [INFO ] Implicit Places using invariants and state equation in 4904 ms returned []
Implicit Place search using SMT with State Equation took 6470 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 17299 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2003 0) (EQ s163 1)), p1:(AND (EQ s1628 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1373 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 111 in 3 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-00 finished in 19290 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' '!((p0 U X(G(p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 138 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-20 02:57:53] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-20 02:57:55] [INFO ] Implicit Places using invariants in 1757 ms returned []
[2023-03-20 02:57:55] [INFO ] Invariant cache hit.
[2023-03-20 02:57:59] [INFO ] Implicit Places using invariants and state equation in 4581 ms returned []
Implicit Place search using SMT with State Equation took 6358 ms to find 0 implicit places.
[2023-03-20 02:57:59] [INFO ] Invariant cache hit.
[2023-03-20 02:58:01] [INFO ] Dead Transitions using invariants and state equation in 2087 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8607 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1439 ms.
Product exploration explored 100000 steps with 0 reset in 1836 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 p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 571 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76373 steps, run timeout after 3002 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76373 steps, saw 75506 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:58:10] [INFO ] Invariant cache hit.
[2023-03-20 02:58:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 591 ms returned sat
[2023-03-20 02:58:13] [INFO ] After 1603ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-20 02:58:14] [INFO ] After 2226ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:58:14] [INFO ] After 3606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:58:15] [INFO ] [Nat]Absence check using 1101 positive place invariants in 322 ms returned sat
[2023-03-20 02:58:17] [INFO ] After 2163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:58:18] [INFO ] After 3039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 515 ms.
[2023-03-20 02:58:18] [INFO ] After 4884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2174 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 367 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59555 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59555 steps, saw 56486 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-20 02:58:25] [INFO ] Computed 1101 place invariants in 18 ms
[2023-03-20 02:58:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 345 ms returned sat
[2023-03-20 02:58:28] [INFO ] After 2391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:58:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 214 ms returned sat
[2023-03-20 02:58:32] [INFO ] After 3639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:58:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-20 02:58:36] [INFO ] After 3712ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:58:39] [INFO ] After 6711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12658 ms.
[2023-03-20 02:58:52] [INFO ] After 24005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7582 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 99 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 125 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-20 02:58:59] [INFO ] Invariant cache hit.
[2023-03-20 02:59:02] [INFO ] Implicit Places using invariants in 2593 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2599 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 147 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-20 02:59:02] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-20 02:59:04] [INFO ] Implicit Places using invariants in 2233 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2255 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 213 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 02:59:05] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 02:59:06] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2023-03-20 02:59:06] [INFO ] Invariant cache hit.
[2023-03-20 02:59:08] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 02:59:16] [INFO ] Implicit Places using invariants and state equation in 10478 ms returned []
Implicit Place search using SMT with State Equation took 11907 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 17246 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 57268 steps, run timeout after 3002 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57268 steps, saw 54264 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:59:20] [INFO ] Invariant cache hit.
[2023-03-20 02:59:21] [INFO ] [Real]Absence check using 1098 positive place invariants in 398 ms returned sat
[2023-03-20 02:59:23] [INFO ] After 2792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:59:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 241 ms returned sat
[2023-03-20 02:59:28] [INFO ] After 3983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:59:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 02:59:32] [INFO ] After 3796ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:59:33] [INFO ] After 5337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1170 ms.
[2023-03-20 02:59:34] [INFO ] After 11346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 3409 steps, including 1 resets, run visited all 2 properties in 84 ms. (steps per millisecond=40 )
Parikh walk visited 4 properties in 914 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 536 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 138 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-20 02:59:36] [INFO ] Computed 1101 place invariants in 9 ms
[2023-03-20 02:59:38] [INFO ] Implicit Places using invariants in 1554 ms returned []
[2023-03-20 02:59:38] [INFO ] Invariant cache hit.
[2023-03-20 02:59:42] [INFO ] Implicit Places using invariants and state equation in 4531 ms returned []
Implicit Place search using SMT with State Equation took 6101 ms to find 0 implicit places.
[2023-03-20 02:59:42] [INFO ] Invariant cache hit.
[2023-03-20 02:59:44] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8109 ms. Remains : 2503/2503 places, 1802/1802 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 614 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 66283 steps, run timeout after 3008 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66283 steps, saw 65466 distinct states, run finished after 3008 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:59:49] [INFO ] Invariant cache hit.
[2023-03-20 02:59:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 494 ms returned sat
[2023-03-20 02:59:52] [INFO ] After 1626ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-20 02:59:52] [INFO ] After 2189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:59:53] [INFO ] After 3489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:59:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 348 ms returned sat
[2023-03-20 02:59:56] [INFO ] After 2074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:59:57] [INFO ] After 2922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 576 ms.
[2023-03-20 02:59:57] [INFO ] After 4624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1906 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 342 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71167 steps, run timeout after 3097 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 71167 steps, saw 67763 distinct states, run finished after 3098 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-20 03:00:03] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-20 03:00:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 381 ms returned sat
[2023-03-20 03:00:06] [INFO ] After 2985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:00:07] [INFO ] [Nat]Absence check using 1101 positive place invariants in 269 ms returned sat
[2023-03-20 03:00:11] [INFO ] After 3719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:00:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-20 03:00:15] [INFO ] After 3999ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 03:00:18] [INFO ] After 7097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12343 ms.
[2023-03-20 03:00:30] [INFO ] After 24169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7941 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 109 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 118 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-20 03:00:39] [INFO ] Invariant cache hit.
[2023-03-20 03:00:40] [INFO ] Implicit Places using invariants in 1570 ms returned []
[2023-03-20 03:00:40] [INFO ] Invariant cache hit.
[2023-03-20 03:00:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-20 03:00:43] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 4492 ms to find 0 implicit places.
[2023-03-20 03:00:43] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-20 03:00:43] [INFO ] Invariant cache hit.
[2023-03-20 03:00:45] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6045 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 104 place count 2498 transition count 1798
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 203 place count 2498 transition count 1699
Applied a total of 203 rules in 364 ms. Remains 2498 /2501 variables (removed 3) and now considering 1699/1800 (removed 101) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1699 rows 2498 cols
[2023-03-20 03:00:45] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:00:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 286 ms returned sat
[2023-03-20 03:00:47] [INFO ] After 2382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:00:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 271 ms returned sat
[2023-03-20 03:00:52] [INFO ] After 3140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:00:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:00:52] [INFO ] After 599ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 03:00:53] [INFO ] After 1637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 651 ms.
[2023-03-20 03:00:54] [INFO ] After 6604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 494 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1533 ms.
Product exploration explored 100000 steps with 0 reset in 1759 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 1802
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 952 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-20 03:01:00] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-20 03:01:00] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-20 03:01:01] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 1802/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2241 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 84 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-20 03:01:01] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-20 03:01:03] [INFO ] Implicit Places using invariants in 2364 ms returned []
[2023-03-20 03:01:03] [INFO ] Invariant cache hit.
[2023-03-20 03:01:07] [INFO ] Implicit Places using invariants and state equation in 4249 ms returned []
Implicit Place search using SMT with State Equation took 6656 ms to find 0 implicit places.
[2023-03-20 03:01:08] [INFO ] Invariant cache hit.
[2023-03-20 03:01:09] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8585 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 196754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 351 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2023-03-20 03:01:10] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-20 03:01:12] [INFO ] Implicit Places using invariants in 2282 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2285 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2503 places, 1797/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2493 transition count 1795
Applied a total of 4 rules in 221 ms. Remains 2493 /2495 variables (removed 2) and now considering 1795/1797 (removed 2) transitions.
// Phase 1: matrix 1795 rows 2493 cols
[2023-03-20 03:01:12] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:01:15] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2023-03-20 03:01:15] [INFO ] Invariant cache hit.
[2023-03-20 03:01:19] [INFO ] Implicit Places using invariants and state equation in 4452 ms returned []
Implicit Place search using SMT with State Equation took 6764 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2493/2503 places, 1795/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9621 ms. Remains : 2493/2503 places, 1795/1802 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1686 0) (NEQ s1257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1247 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 14 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-05 finished in 11022 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)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 87 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-20 03:01:21] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-20 03:01:23] [INFO ] Implicit Places using invariants in 2293 ms returned []
[2023-03-20 03:01:23] [INFO ] Invariant cache hit.
[2023-03-20 03:01:24] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 3729 ms to find 0 implicit places.
[2023-03-20 03:01:24] [INFO ] Invariant cache hit.
[2023-03-20 03:01:27] [INFO ] Dead Transitions using invariants and state equation in 2109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5930 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s2324 0) (NEQ s1528 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-07 finished in 6060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (G(!p1)||(!p1&&G(!p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 102 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-20 03:01:27] [INFO ] Invariant cache hit.
[2023-03-20 03:01:28] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2023-03-20 03:01:28] [INFO ] Invariant cache hit.
[2023-03-20 03:01:33] [INFO ] Implicit Places using invariants and state equation in 4666 ms returned []
Implicit Place search using SMT with State Equation took 6089 ms to find 0 implicit places.
[2023-03-20 03:01:33] [INFO ] Invariant cache hit.
[2023-03-20 03:01:35] [INFO ] Dead Transitions using invariants and state equation in 1763 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7974 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) p1), (NOT p0), p1, true, (AND p1 p2), p2]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1873 1), p2:(OR (EQ s795 0) (EQ s530 1)), p1:(OR (EQ s172 0) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-08 finished in 8291 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)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 115 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-20 03:01:35] [INFO ] Invariant cache hit.
[2023-03-20 03:01:37] [INFO ] Implicit Places using invariants in 1855 ms returned []
[2023-03-20 03:01:37] [INFO ] Invariant cache hit.
[2023-03-20 03:01:42] [INFO ] Implicit Places using invariants and state equation in 5276 ms returned []
Implicit Place search using SMT with State Equation took 7179 ms to find 0 implicit places.
[2023-03-20 03:01:42] [INFO ] Invariant cache hit.
[2023-03-20 03:01:44] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9240 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s917 0) (EQ s1024 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 6846 ms.
Product exploration explored 100000 steps with 50000 reset in 7244 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-12 finished in 23640 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) U p1)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 110 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-20 03:01:59] [INFO ] Invariant cache hit.
[2023-03-20 03:02:00] [INFO ] Implicit Places using invariants in 1348 ms returned []
[2023-03-20 03:02:00] [INFO ] Invariant cache hit.
[2023-03-20 03:02:05] [INFO ] Implicit Places using invariants and state equation in 4402 ms returned []
Implicit Place search using SMT with State Equation took 5763 ms to find 0 implicit places.
[2023-03-20 03:02:05] [INFO ] Invariant cache hit.
[2023-03-20 03:02:07] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8044 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s858 0) (EQ s1171 1) (EQ s772 1)), p0:(EQ s1496 1)], nbAcceptance=0, 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 50000 reset in 7041 ms.
Product exploration explored 100000 steps with 50000 reset in 7165 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 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-15 finished in 22646 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' '!((p0 U X(G(p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-100A-LTLCardinality-03
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 240 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-20 03:02:22] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-20 03:02:24] [INFO ] Implicit Places using invariants in 2345 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2349 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 244 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-20 03:02:24] [INFO ] Computed 1100 place invariants in 17 ms
[2023-03-20 03:02:27] [INFO ] Implicit Places using invariants in 2335 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2338 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 242 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 03:02:27] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-20 03:02:29] [INFO ] Implicit Places using invariants in 2309 ms returned []
[2023-03-20 03:02:29] [INFO ] Invariant cache hit.
[2023-03-20 03:02:34] [INFO ] Implicit Places using invariants and state equation in 4594 ms returned []
Implicit Place search using SMT with State Equation took 6925 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 12338 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1348 ms.
Product exploration explored 100000 steps with 0 reset in 1722 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 p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 501 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 65590 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65590 steps, saw 64753 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 03:02:42] [INFO ] Invariant cache hit.
[2023-03-20 03:02:42] [INFO ] [Real]Absence check using 1098 positive place invariants in 273 ms returned sat
[2023-03-20 03:02:44] [INFO ] After 1481ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-20 03:02:45] [INFO ] After 1997ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:02:45] [INFO ] After 2891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:02:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 254 ms returned sat
[2023-03-20 03:02:49] [INFO ] After 3224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:02:50] [INFO ] After 4337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 955 ms.
[2023-03-20 03:02:51] [INFO ] After 6346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1949 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 396 times.
Drop transitions removed 396 transitions
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2494 transition count 1796
Applied a total of 396 rules in 209 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68327 steps, run timeout after 3015 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68327 steps, saw 64875 distinct states, run finished after 3015 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 03:02:57] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:02:58] [INFO ] [Real]Absence check using 1098 positive place invariants in 298 ms returned sat
[2023-03-20 03:03:00] [INFO ] After 2804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:03:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 781 ms returned sat
[2023-03-20 03:03:04] [INFO ] After 2968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:03:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 03:03:08] [INFO ] After 3669ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 03:03:09] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 0 ms to minimize.
[2023-03-20 03:03:09] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 2 ms to minimize.
[2023-03-20 03:03:10] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 0 ms to minimize.
[2023-03-20 03:03:10] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2023-03-20 03:03:10] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 6 ms to minimize.
[2023-03-20 03:03:11] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 1 ms to minimize.
[2023-03-20 03:03:11] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 1 ms to minimize.
[2023-03-20 03:03:12] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 0 ms to minimize.
[2023-03-20 03:03:12] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-20 03:03:13] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 1 ms to minimize.
[2023-03-20 03:03:13] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 0 ms to minimize.
[2023-03-20 03:03:13] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 0 ms to minimize.
[2023-03-20 03:03:14] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-20 03:03:14] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-20 03:03:14] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 0 ms to minimize.
[2023-03-20 03:03:15] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2023-03-20 03:03:15] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 5 ms to minimize.
[2023-03-20 03:03:15] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-20 03:03:16] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-20 03:03:16] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 1 ms to minimize.
[2023-03-20 03:03:16] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 0 ms to minimize.
[2023-03-20 03:03:17] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-20 03:03:17] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 0 ms to minimize.
[2023-03-20 03:03:18] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-20 03:03:18] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 1 ms to minimize.
[2023-03-20 03:03:19] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 1 ms to minimize.
[2023-03-20 03:03:19] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 0 ms to minimize.
[2023-03-20 03:03:19] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-20 03:03:21] [INFO ] Deduced a trap composed of 6 places in 1282 ms of which 0 ms to minimize.
[2023-03-20 03:03:21] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 1 ms to minimize.
[2023-03-20 03:03:21] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
[2023-03-20 03:03:22] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 0 ms to minimize.
[2023-03-20 03:03:23] [INFO ] Deduced a trap composed of 7 places in 418 ms of which 1 ms to minimize.
[2023-03-20 03:03:23] [INFO ] Deduced a trap composed of 7 places in 347 ms of which 13 ms to minimize.
[2023-03-20 03:03:24] [INFO ] Deduced a trap composed of 7 places in 357 ms of which 1 ms to minimize.
[2023-03-20 03:03:24] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2023-03-20 03:03:25] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-20 03:03:25] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:03:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:03:25] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 3929 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 92 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 92 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-20 03:03:29] [INFO ] Invariant cache hit.
[2023-03-20 03:03:31] [INFO ] Implicit Places using invariants in 1488 ms returned []
[2023-03-20 03:03:31] [INFO ] Invariant cache hit.
[2023-03-20 03:03:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 03:03:39] [INFO ] Implicit Places using invariants and state equation in 8602 ms returned []
Implicit Place search using SMT with State Equation took 10115 ms to find 0 implicit places.
[2023-03-20 03:03:39] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-20 03:03:39] [INFO ] Invariant cache hit.
[2023-03-20 03:03:42] [INFO ] Dead Transitions using invariants and state equation in 2225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12516 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 260 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2023-03-20 03:03:42] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:03:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 276 ms returned sat
[2023-03-20 03:03:44] [INFO ] After 2579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:03:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 262 ms returned sat
[2023-03-20 03:03:49] [INFO ] After 3120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:03:50] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 22 ms to minimize.
[2023-03-20 03:03:51] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 1 ms to minimize.
[2023-03-20 03:03:51] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-20 03:03:51] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 03:03:51] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-20 03:03:51] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-20 03:03:52] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-20 03:03:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1882 ms
[2023-03-20 03:03:54] [INFO ] After 8914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1301 ms.
[2023-03-20 03:03:56] [INFO ] After 11230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 516 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 83 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 03:03:56] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:03:59] [INFO ] Implicit Places using invariants in 2311 ms returned []
[2023-03-20 03:03:59] [INFO ] Invariant cache hit.
[2023-03-20 03:04:03] [INFO ] Implicit Places using invariants and state equation in 4431 ms returned []
Implicit Place search using SMT with State Equation took 6763 ms to find 0 implicit places.
[2023-03-20 03:04:03] [INFO ] Invariant cache hit.
[2023-03-20 03:04:04] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8017 ms. Remains : 2494/2494 places, 1796/1796 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 438 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63591 steps, run timeout after 3027 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63591 steps, saw 62764 distinct states, run finished after 3027 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 03:04:09] [INFO ] Invariant cache hit.
[2023-03-20 03:04:10] [INFO ] [Real]Absence check using 1098 positive place invariants in 307 ms returned sat
[2023-03-20 03:04:12] [INFO ] After 1674ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-20 03:04:12] [INFO ] After 2228ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:04:12] [INFO ] After 3298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:04:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 294 ms returned sat
[2023-03-20 03:04:16] [INFO ] After 3173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:04:18] [INFO ] After 4243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 816 ms.
[2023-03-20 03:04:18] [INFO ] After 6095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1986 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 396 times.
Drop transitions removed 396 transitions
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2494 transition count 1796
Applied a total of 396 rules in 215 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 57029 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57029 steps, saw 53900 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 03:04:24] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:04:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 363 ms returned sat
[2023-03-20 03:04:27] [INFO ] After 2701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:04:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 259 ms returned sat
[2023-03-20 03:04:31] [INFO ] After 2819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:04:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 03:04:35] [INFO ] After 3758ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 03:04:35] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 0 ms to minimize.
[2023-03-20 03:04:36] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 0 ms to minimize.
[2023-03-20 03:04:36] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-20 03:04:36] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-20 03:04:37] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-20 03:04:37] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 3 ms to minimize.
[2023-03-20 03:04:37] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2023-03-20 03:04:38] [INFO ] Deduced a trap composed of 7 places in 373 ms of which 1 ms to minimize.
[2023-03-20 03:04:38] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-20 03:04:39] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-20 03:04:39] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-20 03:04:39] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-20 03:04:40] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2023-03-20 03:04:40] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 0 ms to minimize.
[2023-03-20 03:04:40] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 2 ms to minimize.
[2023-03-20 03:04:41] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-20 03:04:41] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-20 03:04:41] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2023-03-20 03:04:42] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2023-03-20 03:04:42] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 0 ms to minimize.
[2023-03-20 03:04:43] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 0 ms to minimize.
[2023-03-20 03:04:43] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2023-03-20 03:04:43] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-20 03:04:44] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-20 03:04:44] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-20 03:04:44] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-20 03:04:45] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 0 ms to minimize.
[2023-03-20 03:04:45] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 1 ms to minimize.
[2023-03-20 03:04:45] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 0 ms to minimize.
[2023-03-20 03:04:46] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 1 ms to minimize.
[2023-03-20 03:04:46] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 0 ms to minimize.
[2023-03-20 03:04:46] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2023-03-20 03:04:47] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 1 ms to minimize.
[2023-03-20 03:04:48] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 0 ms to minimize.
[2023-03-20 03:04:48] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 0 ms to minimize.
[2023-03-20 03:04:49] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-03-20 03:04:49] [INFO ] Deduced a trap composed of 6 places in 394 ms of which 1 ms to minimize.
[2023-03-20 03:04:50] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2023-03-20 03:04:50] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-20 03:04:50] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-20 03:04:51] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-20 03:04:51] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2023-03-20 03:04:51] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 0 ms to minimize.
[2023-03-20 03:04:52] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-20 03:04:52] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:04:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:04:52] [INFO ] After 25143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 3784 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 109 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 86 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-20 03:04:56] [INFO ] Invariant cache hit.
[2023-03-20 03:04:58] [INFO ] Implicit Places using invariants in 1526 ms returned []
[2023-03-20 03:04:58] [INFO ] Invariant cache hit.
[2023-03-20 03:04:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 03:05:06] [INFO ] Implicit Places using invariants and state equation in 8495 ms returned []
Implicit Place search using SMT with State Equation took 10027 ms to find 0 implicit places.
[2023-03-20 03:05:06] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-20 03:05:06] [INFO ] Invariant cache hit.
[2023-03-20 03:05:09] [INFO ] Dead Transitions using invariants and state equation in 2267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12451 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 350 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2023-03-20 03:05:09] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:05:10] [INFO ] [Real]Absence check using 1098 positive place invariants in 294 ms returned sat
[2023-03-20 03:05:12] [INFO ] After 2513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:05:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 318 ms returned sat
[2023-03-20 03:05:16] [INFO ] After 3079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:05:17] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-20 03:05:18] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 0 ms to minimize.
[2023-03-20 03:05:18] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-20 03:05:18] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-20 03:05:19] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-20 03:05:19] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-20 03:05:19] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-20 03:05:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2131 ms
[2023-03-20 03:05:22] [INFO ] After 9055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1341 ms.
[2023-03-20 03:05:23] [INFO ] After 11451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 691 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1259 ms.
Product exploration explored 100000 steps with 0 reset in 1682 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 123 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-20 03:05:27] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-20 03:05:27] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-20 03:05:29] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1556 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 89 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-20 03:05:29] [INFO ] Invariant cache hit.
[2023-03-20 03:05:30] [INFO ] Implicit Places using invariants in 1471 ms returned []
[2023-03-20 03:05:30] [INFO ] Invariant cache hit.
[2023-03-20 03:05:35] [INFO ] Implicit Places using invariants and state equation in 4619 ms returned []
Implicit Place search using SMT with State Equation took 6113 ms to find 0 implicit places.
[2023-03-20 03:05:35] [INFO ] Invariant cache hit.
[2023-03-20 03:05:37] [INFO ] Dead Transitions using invariants and state equation in 2475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8699 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 196331 ms.
[2023-03-20 03:05:38] [INFO ] Flatten gal took : 170 ms
[2023-03-20 03:05:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 03:05:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 1802 transitions and 7204 arcs took 12 ms.
Total runtime 616332 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-100A
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLCardinality

BK_STOP 1679281634050

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-100A-LTLCardinality-03
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 2/32 ShieldPPPt-PT-100A-LTLCardinality-03 163775 m, 32755 m/sec, 565995 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 4/32 ShieldPPPt-PT-100A-LTLCardinality-03 332008 m, 33646 m/sec, 1221560 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 6/32 ShieldPPPt-PT-100A-LTLCardinality-03 511275 m, 35853 m/sec, 1874111 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 8/32 ShieldPPPt-PT-100A-LTLCardinality-03 668425 m, 31430 m/sec, 2523553 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 10/32 ShieldPPPt-PT-100A-LTLCardinality-03 818358 m, 29986 m/sec, 3175373 t fired, .

Time elapsed: 25 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 12/32 ShieldPPPt-PT-100A-LTLCardinality-03 983082 m, 32944 m/sec, 3827357 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 13/32 ShieldPPPt-PT-100A-LTLCardinality-03 1137606 m, 30904 m/sec, 4479191 t fired, .

Time elapsed: 35 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 15/32 ShieldPPPt-PT-100A-LTLCardinality-03 1290734 m, 30625 m/sec, 5131256 t fired, .

Time elapsed: 40 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 17/32 ShieldPPPt-PT-100A-LTLCardinality-03 1473424 m, 36538 m/sec, 5781199 t fired, .

Time elapsed: 45 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 19/32 ShieldPPPt-PT-100A-LTLCardinality-03 1631392 m, 31593 m/sec, 6434216 t fired, .

Time elapsed: 50 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3599 21/32 ShieldPPPt-PT-100A-LTLCardinality-03 1782035 m, 30128 m/sec, 7088394 t fired, .

Time elapsed: 55 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3599 22/32 ShieldPPPt-PT-100A-LTLCardinality-03 1935268 m, 30646 m/sec, 7742360 t fired, .

Time elapsed: 60 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3599 24/32 ShieldPPPt-PT-100A-LTLCardinality-03 2077274 m, 28401 m/sec, 8395159 t fired, .

Time elapsed: 65 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3599 26/32 ShieldPPPt-PT-100A-LTLCardinality-03 2212545 m, 27054 m/sec, 9048950 t fired, .

Time elapsed: 70 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/3599 27/32 ShieldPPPt-PT-100A-LTLCardinality-03 2360719 m, 29634 m/sec, 9702102 t fired, .

Time elapsed: 75 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/3599 29/32 ShieldPPPt-PT-100A-LTLCardinality-03 2503302 m, 28516 m/sec, 10356010 t fired, .

Time elapsed: 80 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/3599 30/32 ShieldPPPt-PT-100A-LTLCardinality-03 2637656 m, 26870 m/sec, 11010342 t fired, .

Time elapsed: 85 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/3599 32/32 ShieldPPPt-PT-100A-LTLCardinality-03 2795269 m, 31522 m/sec, 11667657 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for ShieldPPPt-PT-100A-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100A-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100A-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 95 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100A"
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 ShieldPPPt-PT-100A, 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-167903715600691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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