Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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-030B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679466798420

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:33:21] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-22 06:33:21] [INFO ] Transformed 2343 places.
[2023-03-22 06:33:21] [INFO ] Transformed 2133 transitions.
[2023-03-22 06:33:21] [INFO ] Found NUPN structural information;
[2023-03-22 06:33:21] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 2022 transition count 1812
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 2022 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 2021 transition count 1811
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 2021 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 2020 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 2020 transition count 1810
Applied a total of 646 rules in 1064 ms. Remains 2020 /2343 variables (removed 323) and now considering 1810/2133 (removed 323) transitions.
// Phase 1: matrix 1810 rows 2020 cols
[2023-03-22 06:33:22] [INFO ] Computed 331 place invariants in 31 ms
[2023-03-22 06:33:23] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2023-03-22 06:33:23] [INFO ] Invariant cache hit.
[2023-03-22 06:33:26] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 3560 ms to find 0 implicit places.
[2023-03-22 06:33:26] [INFO ] Invariant cache hit.
[2023-03-22 06:33:27] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2020/2343 places, 1810/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5937 ms. Remains : 2020/2343 places, 1810/2133 transitions.
Support contains 29 out of 2020 places after structural reductions.
[2023-03-22 06:33:27] [INFO ] Flatten gal took : 170 ms
[2023-03-22 06:33:27] [INFO ] Flatten gal took : 78 ms
[2023-03-22 06:33:28] [INFO ] Input system was already deterministic with 1810 transitions.
Support contains 28 out of 2020 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 21) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 06:33:28] [INFO ] Invariant cache hit.
[2023-03-22 06:33:29] [INFO ] [Real]Absence check using 331 positive place invariants in 205 ms returned sat
[2023-03-22 06:33:31] [INFO ] After 2339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 06:33:32] [INFO ] [Nat]Absence check using 331 positive place invariants in 179 ms returned sat
[2023-03-22 06:33:35] [INFO ] After 2013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 06:33:35] [INFO ] Deduced a trap composed of 17 places in 642 ms of which 8 ms to minimize.
[2023-03-22 06:33:36] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 1 ms to minimize.
[2023-03-22 06:33:36] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 15 ms to minimize.
[2023-03-22 06:33:37] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2023-03-22 06:33:37] [INFO ] Deduced a trap composed of 18 places in 448 ms of which 12 ms to minimize.
[2023-03-22 06:33:38] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 1 ms to minimize.
[2023-03-22 06:33:38] [INFO ] Deduced a trap composed of 16 places in 378 ms of which 1 ms to minimize.
[2023-03-22 06:33:39] [INFO ] Deduced a trap composed of 16 places in 667 ms of which 2 ms to minimize.
[2023-03-22 06:33:39] [INFO ] Deduced a trap composed of 30 places in 400 ms of which 1 ms to minimize.
[2023-03-22 06:33:40] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 1 ms to minimize.
[2023-03-22 06:33:40] [INFO ] Deduced a trap composed of 30 places in 407 ms of which 1 ms to minimize.
[2023-03-22 06:33:41] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 1 ms to minimize.
[2023-03-22 06:33:41] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 1 ms to minimize.
[2023-03-22 06:33:42] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 2 ms to minimize.
[2023-03-22 06:33:42] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 1 ms to minimize.
[2023-03-22 06:33:42] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 1 ms to minimize.
[2023-03-22 06:33:43] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 13 ms to minimize.
[2023-03-22 06:33:43] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 0 ms to minimize.
[2023-03-22 06:33:43] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2023-03-22 06:33:44] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 1 ms to minimize.
[2023-03-22 06:33:44] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2023-03-22 06:33:45] [INFO ] Deduced a trap composed of 32 places in 343 ms of which 11 ms to minimize.
[2023-03-22 06:33:45] [INFO ] Deduced a trap composed of 44 places in 366 ms of which 1 ms to minimize.
[2023-03-22 06:33:45] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 2 ms to minimize.
[2023-03-22 06:33:46] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 1 ms to minimize.
[2023-03-22 06:33:46] [INFO ] Deduced a trap composed of 42 places in 500 ms of which 2 ms to minimize.
[2023-03-22 06:33:47] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 1 ms to minimize.
[2023-03-22 06:33:47] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2023-03-22 06:33:48] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 1 ms to minimize.
[2023-03-22 06:33:48] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 0 ms to minimize.
[2023-03-22 06:33:48] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 0 ms to minimize.
[2023-03-22 06:33:49] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 3 ms to minimize.
[2023-03-22 06:33:49] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 1 ms to minimize.
[2023-03-22 06:33:49] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
[2023-03-22 06:33:49] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 0 ms to minimize.
[2023-03-22 06:33:50] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 1 ms to minimize.
[2023-03-22 06:33:50] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 1 ms to minimize.
[2023-03-22 06:33:50] [INFO ] Deduced a trap composed of 32 places in 317 ms of which 1 ms to minimize.
[2023-03-22 06:33:51] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 1 ms to minimize.
[2023-03-22 06:33:51] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 17 ms to minimize.
[2023-03-22 06:33:51] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 0 ms to minimize.
[2023-03-22 06:33:52] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 0 ms to minimize.
[2023-03-22 06:33:52] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 1 ms to minimize.
[2023-03-22 06:33:52] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 0 ms to minimize.
[2023-03-22 06:33:52] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 12 ms to minimize.
[2023-03-22 06:33:53] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 0 ms to minimize.
[2023-03-22 06:33:53] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 1 ms to minimize.
[2023-03-22 06:33:53] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 0 ms to minimize.
[2023-03-22 06:33:53] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 1 ms to minimize.
[2023-03-22 06:33:54] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2023-03-22 06:33:54] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 19114 ms
[2023-03-22 06:33:54] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 0 ms to minimize.
[2023-03-22 06:33:55] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 0 ms to minimize.
[2023-03-22 06:33:55] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 1 ms to minimize.
[2023-03-22 06:33:55] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2023-03-22 06:33:56] [INFO ] Deduced a trap composed of 46 places in 377 ms of which 26 ms to minimize.
[2023-03-22 06:33:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1745 ms
[2023-03-22 06:33:56] [INFO ] After 23211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 06:33:56] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 854 ms.
Support contains 20 out of 2020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Drop transitions removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 413 rules applied. Total rules applied 413 place count 2020 transition count 1397
Reduce places removed 413 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 414 rules applied. Total rules applied 827 place count 1607 transition count 1396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 828 place count 1606 transition count 1396
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 828 place count 1606 transition count 1165
Deduced a syphon composed of 231 places in 2 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 462 rules applied. Total rules applied 1290 place count 1375 transition count 1165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1292 place count 1373 transition count 1163
Iterating global reduction 3 with 2 rules applied. Total rules applied 1294 place count 1373 transition count 1163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1294 place count 1373 transition count 1162
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1296 place count 1372 transition count 1162
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 2 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2318 place count 861 transition count 651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2319 place count 861 transition count 650
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2321 place count 860 transition count 649
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2495 place count 773 transition count 649
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2496 place count 773 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2497 place count 772 transition count 648
Partial Free-agglomeration rule applied 83 times.
Drop transitions removed 83 transitions
Iterating global reduction 5 with 83 rules applied. Total rules applied 2580 place count 772 transition count 648
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2581 place count 771 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2582 place count 770 transition count 647
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2582 place count 770 transition count 645
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2586 place count 768 transition count 645
Applied a total of 2586 rules in 553 ms. Remains 768 /2020 variables (removed 1252) and now considering 645/1810 (removed 1165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 768/2020 places, 645/1810 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 645 rows 768 cols
[2023-03-22 06:33:58] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-22 06:33:58] [INFO ] [Real]Absence check using 330 positive place invariants in 111 ms returned sat
[2023-03-22 06:33:59] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:33:59] [INFO ] [Nat]Absence check using 330 positive place invariants in 52 ms returned sat
[2023-03-22 06:34:00] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:34:01] [INFO ] After 390ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:01] [INFO ] After 1173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-22 06:34:02] [INFO ] After 2662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 16 out of 768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 645/645 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 768 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 767 transition count 644
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 767 transition count 642
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 765 transition count 642
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 764 transition count 641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 763 transition count 641
Applied a total of 10 rules in 55 ms. Remains 763 /768 variables (removed 5) and now considering 641/645 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 763/768 places, 641/645 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 87552 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87552 steps, saw 73132 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 641 rows 763 cols
[2023-03-22 06:34:06] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-22 06:34:06] [INFO ] [Real]Absence check using 330 positive place invariants in 67 ms returned sat
[2023-03-22 06:34:07] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:34:07] [INFO ] [Nat]Absence check using 330 positive place invariants in 111 ms returned sat
[2023-03-22 06:34:08] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:34:08] [INFO ] After 352ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:09] [INFO ] After 979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-22 06:34:09] [INFO ] After 2612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 16 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 641/641 transitions.
Applied a total of 0 rules in 60 ms. Remains 763 /763 variables (removed 0) and now considering 641/641 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 763/763 places, 641/641 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 641/641 transitions.
Applied a total of 0 rules in 32 ms. Remains 763 /763 variables (removed 0) and now considering 641/641 (removed 0) transitions.
[2023-03-22 06:34:09] [INFO ] Invariant cache hit.
[2023-03-22 06:34:10] [INFO ] Implicit Places using invariants in 412 ms returned [746, 750]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 418 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 761/763 places, 641/641 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 759 transition count 639
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 759 transition count 639
Applied a total of 4 rules in 44 ms. Remains 759 /761 variables (removed 2) and now considering 639/641 (removed 2) transitions.
// Phase 1: matrix 639 rows 759 cols
[2023-03-22 06:34:10] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:34:10] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-22 06:34:10] [INFO ] Invariant cache hit.
[2023-03-22 06:34:12] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/763 places, 639/641 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2502 ms. Remains : 759/763 places, 639/641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 80128 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80128 steps, saw 65691 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 06:34:16] [INFO ] Invariant cache hit.
[2023-03-22 06:34:17] [INFO ] [Real]Absence check using 328 positive place invariants in 1026 ms returned sat
[2023-03-22 06:34:18] [INFO ] After 2256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:34:18] [INFO ] [Nat]Absence check using 328 positive place invariants in 131 ms returned sat
[2023-03-22 06:34:20] [INFO ] After 1928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:21] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-22 06:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-22 06:34:21] [INFO ] After 2507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-22 06:34:21] [INFO ] After 3281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 16 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 639/639 transitions.
Applied a total of 0 rules in 20 ms. Remains 759 /759 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 759/759 places, 639/639 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 639/639 transitions.
Applied a total of 0 rules in 40 ms. Remains 759 /759 variables (removed 0) and now considering 639/639 (removed 0) transitions.
[2023-03-22 06:34:21] [INFO ] Invariant cache hit.
[2023-03-22 06:34:22] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-22 06:34:22] [INFO ] Invariant cache hit.
[2023-03-22 06:34:23] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2023-03-22 06:34:24] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 06:34:24] [INFO ] Invariant cache hit.
[2023-03-22 06:34:24] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2500 ms. Remains : 759/759 places, 639/639 transitions.
Partial Free-agglomeration rule applied 171 times.
Drop transitions removed 171 transitions
Iterating global reduction 0 with 171 rules applied. Total rules applied 171 place count 759 transition count 639
Applied a total of 171 rules in 33 ms. Remains 759 /759 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 639 rows 759 cols
[2023-03-22 06:34:24] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:34:24] [INFO ] [Real]Absence check using 328 positive place invariants in 82 ms returned sat
[2023-03-22 06:34:25] [INFO ] After 612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:34:25] [INFO ] [Nat]Absence check using 328 positive place invariants in 60 ms returned sat
[2023-03-22 06:34:25] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:25] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-03-22 06:34:26] [INFO ] After 408ms SMT Verify possible using 158 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:34:26] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 0 ms to minimize.
[2023-03-22 06:34:26] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-22 06:34:27] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-22 06:34:27] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-22 06:34:27] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2023-03-22 06:34:27] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-22 06:34:27] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-22 06:34:27] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-22 06:34:28] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-22 06:34:28] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-22 06:34:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1887 ms
[2023-03-22 06:34:28] [INFO ] After 2776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-22 06:34:29] [INFO ] After 4169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 479 stabilizing places and 479 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2011 transition count 1801
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2011 transition count 1801
Applied a total of 18 rules in 222 ms. Remains 2011 /2020 variables (removed 9) and now considering 1801/1810 (removed 9) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-22 06:34:29] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-22 06:34:30] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-22 06:34:30] [INFO ] Invariant cache hit.
[2023-03-22 06:34:32] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 2871 ms to find 0 implicit places.
[2023-03-22 06:34:32] [INFO ] Invariant cache hit.
[2023-03-22 06:34:33] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2020 places, 1801/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4100 ms. Remains : 2011/2020 places, 1801/1810 transitions.
Stuttering acceptance computed with spot in 491 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s1235 1) (EQ s1260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-00 finished in 4710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (G(p0)||X(F(p1))))))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 844 place count 1597 transition count 1154
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1315 place count 1359 transition count 1149
Iterating global reduction 2 with 5 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1320 place count 1359 transition count 1145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2348 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 751 transition count 629
Applied a total of 2534 rules in 363 ms. Remains 751 /2020 variables (removed 1269) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 751 cols
[2023-03-22 06:34:34] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-22 06:34:35] [INFO ] Implicit Places using invariants in 586 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 593 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 629/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 627
Applied a total of 4 rules in 26 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2023-03-22 06:34:35] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:34:35] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-22 06:34:35] [INFO ] Invariant cache hit.
[2023-03-22 06:34:36] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2027 ms. Remains : 747/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s68 1) (EQ s76 1)), p1:(EQ s697 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 392 reset in 673 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-01 finished in 2794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 213 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:34:37] [INFO ] Computed 331 place invariants in 8 ms
[2023-03-22 06:34:38] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-22 06:34:38] [INFO ] Invariant cache hit.
[2023-03-22 06:34:40] [INFO ] Implicit Places using invariants and state equation in 2618 ms returned []
Implicit Place search using SMT with State Equation took 3481 ms to find 0 implicit places.
[2023-03-22 06:34:40] [INFO ] Invariant cache hit.
[2023-03-22 06:34:41] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4831 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s573 1) (EQ s1625 1)) (AND (EQ s1102 1) (EQ s941 1))), p1:(EQ s1625 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 552 reset in 392 ms.
Product exploration explored 100000 steps with 573 reset in 387 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2012 stabilizing places and 478/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-22 06:34:43] [INFO ] Invariant cache hit.
[2023-03-22 06:34:44] [INFO ] [Real]Absence check using 331 positive place invariants in 427 ms returned sat
[2023-03-22 06:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:34:57] [INFO ] [Real]Absence check using state equation in 12508 ms returned sat
[2023-03-22 06:34:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 06:34:59] [INFO ] [Nat]Absence check using 331 positive place invariants in 442 ms returned sat
[2023-03-22 06:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 06:35:09] [INFO ] [Nat]Absence check using state equation in 10110 ms returned sat
[2023-03-22 06:35:09] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2023-03-22 06:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2023-03-22 06:35:09] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 187 ms.
[2023-03-22 06:35:12] [INFO ] Added : 85 causal constraints over 17 iterations in 2687 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2011 transition count 1384
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1594 transition count 1384
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 834 place count 1594 transition count 1144
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 1314 place count 1354 transition count 1144
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2328 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2329 place count 847 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2331 place count 846 transition count 635
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2509 place count 757 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2511 place count 755 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2512 place count 754 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2512 place count 754 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2516 place count 752 transition count 631
Applied a total of 2516 rules in 245 ms. Remains 752 /2012 variables (removed 1260) and now considering 631/1802 (removed 1171) transitions.
// Phase 1: matrix 631 rows 752 cols
[2023-03-22 06:35:12] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:35:13] [INFO ] Implicit Places using invariants in 521 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 522 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2012 places, 631/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 629
Applied a total of 4 rules in 22 ms. Remains 748 /750 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 748 cols
[2023-03-22 06:35:13] [INFO ] Computed 328 place invariants in 14 ms
[2023-03-22 06:35:13] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-22 06:35:13] [INFO ] Invariant cache hit.
[2023-03-22 06:35:14] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2012 places, 629/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2182 ms. Remains : 748/2012 places, 629/1802 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/748 stabilizing places and 2/629 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 308 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 367 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-22 06:35:15] [INFO ] Invariant cache hit.
[2023-03-22 06:35:16] [INFO ] [Real]Absence check using 328 positive place invariants in 153 ms returned sat
[2023-03-22 06:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:35:17] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2023-03-22 06:35:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 06:35:17] [INFO ] [Nat]Absence check using 328 positive place invariants in 147 ms returned sat
[2023-03-22 06:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 06:35:18] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2023-03-22 06:35:18] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2023-03-22 06:35:19] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-03-22 06:35:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-03-22 06:35:19] [INFO ] Computed and/alt/rep : 624/983/624 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-22 06:35:27] [INFO ] Added : 527 causal constraints over 106 iterations in 8690 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19286 reset in 763 ms.
Stack based approach found an accepted trace after 168 steps with 29 reset with depth 3 and stack size 3 in 3 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-02 finished in 51595 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 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 844 place count 1597 transition count 1153
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1312 place count 1363 transition count 1153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1317 place count 1358 transition count 1148
Iterating global reduction 2 with 5 rules applied. Total rules applied 1322 place count 1358 transition count 1148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1322 place count 1358 transition count 1144
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1330 place count 1354 transition count 1144
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2352 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2353 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2355 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2533 place count 753 transition count 631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2535 place count 751 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2536 place count 750 transition count 629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2536 place count 750 transition count 627
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2540 place count 748 transition count 627
Applied a total of 2540 rules in 320 ms. Remains 748 /2020 variables (removed 1272) and now considering 627/1810 (removed 1183) transitions.
// Phase 1: matrix 627 rows 748 cols
[2023-03-22 06:35:28] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-22 06:35:29] [INFO ] Implicit Places using invariants in 435 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 437 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 746/2020 places, 627/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 22 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2023-03-22 06:35:29] [INFO ] Computed 328 place invariants in 14 ms
[2023-03-22 06:35:29] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-22 06:35:29] [INFO ] Invariant cache hit.
[2023-03-22 06:35:30] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 744/2020 places, 625/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2194 ms. Remains : 744/2020 places, 625/1810 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s480 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 19 reset in 516 ms.
Stack based approach found an accepted trace after 283 steps with 0 reset with depth 284 and stack size 284 in 2 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-03 finished in 2766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p0&&X((!p0 U (p1||G(!p0))))) U (!p1||F(p2))))))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 215 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:35:31] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-22 06:35:32] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-22 06:35:32] [INFO ] Invariant cache hit.
[2023-03-22 06:35:34] [INFO ] Implicit Places using invariants and state equation in 2345 ms returned []
Implicit Place search using SMT with State Equation took 3019 ms to find 0 implicit places.
[2023-03-22 06:35:34] [INFO ] Invariant cache hit.
[2023-03-22 06:35:35] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4364 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1148 1), p2:(EQ s609 1), p0:(AND (EQ s775 1) (EQ s777 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22237 reset in 514 ms.
Product exploration explored 100000 steps with 22277 reset in 586 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 844 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:35:38] [INFO ] Invariant cache hit.
[2023-03-22 06:35:39] [INFO ] [Real]Absence check using 331 positive place invariants in 146 ms returned sat
[2023-03-22 06:35:40] [INFO ] After 1242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-22 06:35:41] [INFO ] Deduced a trap composed of 21 places in 498 ms of which 3 ms to minimize.
[2023-03-22 06:35:41] [INFO ] Deduced a trap composed of 19 places in 469 ms of which 2 ms to minimize.
[2023-03-22 06:35:42] [INFO ] Deduced a trap composed of 23 places in 634 ms of which 29 ms to minimize.
[2023-03-22 06:35:43] [INFO ] Deduced a trap composed of 25 places in 661 ms of which 1 ms to minimize.
[2023-03-22 06:35:44] [INFO ] Deduced a trap composed of 23 places in 890 ms of which 3 ms to minimize.
[2023-03-22 06:35:44] [INFO ] Deduced a trap composed of 25 places in 511 ms of which 3 ms to minimize.
[2023-03-22 06:35:45] [INFO ] Deduced a trap composed of 26 places in 463 ms of which 1 ms to minimize.
[2023-03-22 06:35:46] [INFO ] Deduced a trap composed of 24 places in 597 ms of which 2 ms to minimize.
[2023-03-22 06:35:46] [INFO ] Deduced a trap composed of 25 places in 465 ms of which 2 ms to minimize.
[2023-03-22 06:35:47] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 1 ms to minimize.
[2023-03-22 06:35:47] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 1 ms to minimize.
[2023-03-22 06:35:48] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 1 ms to minimize.
[2023-03-22 06:35:48] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 1 ms to minimize.
[2023-03-22 06:35:49] [INFO ] Deduced a trap composed of 26 places in 424 ms of which 1 ms to minimize.
[2023-03-22 06:35:49] [INFO ] Deduced a trap composed of 17 places in 410 ms of which 1 ms to minimize.
[2023-03-22 06:35:49] [INFO ] Deduced a trap composed of 45 places in 391 ms of which 1 ms to minimize.
[2023-03-22 06:35:50] [INFO ] Deduced a trap composed of 37 places in 419 ms of which 1 ms to minimize.
[2023-03-22 06:35:51] [INFO ] Deduced a trap composed of 44 places in 525 ms of which 5 ms to minimize.
[2023-03-22 06:35:51] [INFO ] Deduced a trap composed of 29 places in 451 ms of which 1 ms to minimize.
[2023-03-22 06:35:52] [INFO ] Deduced a trap composed of 34 places in 461 ms of which 0 ms to minimize.
[2023-03-22 06:35:52] [INFO ] Deduced a trap composed of 30 places in 549 ms of which 1 ms to minimize.
[2023-03-22 06:35:53] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 1 ms to minimize.
[2023-03-22 06:35:53] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 1 ms to minimize.
[2023-03-22 06:35:54] [INFO ] Deduced a trap composed of 34 places in 453 ms of which 1 ms to minimize.
[2023-03-22 06:35:54] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 0 ms to minimize.
[2023-03-22 06:35:54] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 1 ms to minimize.
[2023-03-22 06:35:55] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 1 ms to minimize.
[2023-03-22 06:35:55] [INFO ] Deduced a trap composed of 36 places in 408 ms of which 0 ms to minimize.
[2023-03-22 06:35:56] [INFO ] Deduced a trap composed of 46 places in 345 ms of which 1 ms to minimize.
[2023-03-22 06:35:56] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 1 ms to minimize.
[2023-03-22 06:35:56] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 1 ms to minimize.
[2023-03-22 06:35:57] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 1 ms to minimize.
[2023-03-22 06:35:57] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 1 ms to minimize.
[2023-03-22 06:35:58] [INFO ] Deduced a trap composed of 33 places in 315 ms of which 0 ms to minimize.
[2023-03-22 06:35:58] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 1 ms to minimize.
[2023-03-22 06:35:58] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 1 ms to minimize.
[2023-03-22 06:35:59] [INFO ] Deduced a trap composed of 33 places in 303 ms of which 1 ms to minimize.
[2023-03-22 06:35:59] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 0 ms to minimize.
[2023-03-22 06:36:00] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 1 ms to minimize.
[2023-03-22 06:36:00] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 1 ms to minimize.
[2023-03-22 06:36:00] [INFO ] Deduced a trap composed of 44 places in 360 ms of which 1 ms to minimize.
[2023-03-22 06:36:01] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 1 ms to minimize.
[2023-03-22 06:36:01] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 1 ms to minimize.
[2023-03-22 06:36:01] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 1 ms to minimize.
[2023-03-22 06:36:02] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 0 ms to minimize.
[2023-03-22 06:36:02] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 1 ms to minimize.
[2023-03-22 06:36:02] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 0 ms to minimize.
[2023-03-22 06:36:02] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 0 ms to minimize.
[2023-03-22 06:36:03] [INFO ] Deduced a trap composed of 42 places in 290 ms of which 1 ms to minimize.
[2023-03-22 06:36:03] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 1 ms to minimize.
[2023-03-22 06:36:03] [INFO ] Deduced a trap composed of 39 places in 228 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:339)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-22 06:36:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:36:03] [INFO ] After 25224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2012 transition count 1385
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 836 place count 1594 transition count 1143
Deduced a syphon composed of 241 places in 2 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1318 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2337 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2609 place count 751 transition count 630
Applied a total of 2609 rules in 268 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 201312 steps, run timeout after 3009 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 201312 steps, saw 166200 distinct states, run finished after 3009 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2023-03-22 06:36:07] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-22 06:36:07] [INFO ] [Real]Absence check using 330 positive place invariants in 48 ms returned sat
[2023-03-22 06:36:07] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:36:08] [INFO ] [Nat]Absence check using 330 positive place invariants in 212 ms returned sat
[2023-03-22 06:36:08] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:36:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 06:36:08] [INFO ] After 149ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:36:09] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 06:36:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-22 06:36:09] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-22 06:36:09] [INFO ] After 1484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 19 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-22 06:36:09] [INFO ] Invariant cache hit.
[2023-03-22 06:36:09] [INFO ] Implicit Places using invariants in 424 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 425 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 23 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-22 06:36:09] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:36:10] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-22 06:36:10] [INFO ] Invariant cache hit.
[2023-03-22 06:36:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:36:11] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1962 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 201973 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201973 steps, saw 168370 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:36:14] [INFO ] Invariant cache hit.
[2023-03-22 06:36:14] [INFO ] [Real]Absence check using 328 positive place invariants in 75 ms returned sat
[2023-03-22 06:36:14] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:36:14] [INFO ] [Nat]Absence check using 328 positive place invariants in 46 ms returned sat
[2023-03-22 06:36:15] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:36:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:36:15] [INFO ] After 86ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:36:15] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-22 06:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-22 06:36:15] [INFO ] After 405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-22 06:36:15] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 20 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 18 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2023-03-22 06:36:15] [INFO ] Invariant cache hit.
[2023-03-22 06:36:16] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-22 06:36:16] [INFO ] Invariant cache hit.
[2023-03-22 06:36:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:36:17] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
[2023-03-22 06:36:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 06:36:17] [INFO ] Invariant cache hit.
[2023-03-22 06:36:17] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2019 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 747 transition count 628
Applied a total of 175 rules in 27 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2023-03-22 06:36:17] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:36:18] [INFO ] [Real]Absence check using 328 positive place invariants in 40 ms returned sat
[2023-03-22 06:36:18] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:36:18] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2023-03-22 06:36:18] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:36:18] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-22 06:36:18] [INFO ] After 159ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:36:19] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-22 06:36:19] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-22 06:36:19] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-22 06:36:19] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
[2023-03-22 06:36:19] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-22 06:36:20] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-22 06:36:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1503 ms
[2023-03-22 06:36:20] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-22 06:36:20] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-22 06:36:21] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-22 06:36:21] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-22 06:36:21] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2023-03-22 06:36:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1266 ms
[2023-03-22 06:36:21] [INFO ] After 3033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-22 06:36:21] [INFO ] After 3699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 748 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 390 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:36:23] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-22 06:36:24] [INFO ] [Real]Absence check using 331 positive place invariants in 368 ms returned sat
[2023-03-22 06:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:36:35] [INFO ] [Real]Absence check using state equation in 11053 ms returned sat
[2023-03-22 06:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 06:36:37] [INFO ] [Nat]Absence check using 331 positive place invariants in 418 ms returned sat
[2023-03-22 06:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 06:36:48] [INFO ] [Nat]Absence check using state equation in 10902 ms returned sat
[2023-03-22 06:36:48] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2023-03-22 06:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-22 06:36:48] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 100 ms.
[2023-03-22 06:36:51] [INFO ] Deduced a trap composed of 14 places in 779 ms of which 2 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-22 06:36:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 92 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-22 06:36:51] [INFO ] Invariant cache hit.
[2023-03-22 06:36:52] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-22 06:36:52] [INFO ] Invariant cache hit.
[2023-03-22 06:36:54] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-22 06:36:54] [INFO ] Invariant cache hit.
[2023-03-22 06:36:55] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3506 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1155 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:36:57] [INFO ] Invariant cache hit.
[2023-03-22 06:36:57] [INFO ] [Real]Absence check using 331 positive place invariants in 95 ms returned sat
[2023-03-22 06:36:58] [INFO ] After 961ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-22 06:36:59] [INFO ] Deduced a trap composed of 21 places in 572 ms of which 1 ms to minimize.
[2023-03-22 06:36:59] [INFO ] Deduced a trap composed of 19 places in 544 ms of which 1 ms to minimize.
[2023-03-22 06:37:00] [INFO ] Deduced a trap composed of 23 places in 767 ms of which 2 ms to minimize.
[2023-03-22 06:37:01] [INFO ] Deduced a trap composed of 25 places in 501 ms of which 1 ms to minimize.
[2023-03-22 06:37:01] [INFO ] Deduced a trap composed of 23 places in 551 ms of which 1 ms to minimize.
[2023-03-22 06:37:02] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 1 ms to minimize.
[2023-03-22 06:37:03] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 1 ms to minimize.
[2023-03-22 06:37:04] [INFO ] Deduced a trap composed of 24 places in 1756 ms of which 1 ms to minimize.
[2023-03-22 06:37:05] [INFO ] Deduced a trap composed of 25 places in 528 ms of which 1 ms to minimize.
[2023-03-22 06:37:06] [INFO ] Deduced a trap composed of 17 places in 604 ms of which 1 ms to minimize.
[2023-03-22 06:37:06] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2023-03-22 06:37:07] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 1 ms to minimize.
[2023-03-22 06:37:07] [INFO ] Deduced a trap composed of 25 places in 377 ms of which 2 ms to minimize.
[2023-03-22 06:37:08] [INFO ] Deduced a trap composed of 26 places in 429 ms of which 1 ms to minimize.
[2023-03-22 06:37:08] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2023-03-22 06:37:09] [INFO ] Deduced a trap composed of 45 places in 460 ms of which 1 ms to minimize.
[2023-03-22 06:37:09] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 1 ms to minimize.
[2023-03-22 06:37:09] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 1 ms to minimize.
[2023-03-22 06:37:10] [INFO ] Deduced a trap composed of 29 places in 382 ms of which 1 ms to minimize.
[2023-03-22 06:37:10] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 0 ms to minimize.
[2023-03-22 06:37:11] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 1 ms to minimize.
[2023-03-22 06:37:11] [INFO ] Deduced a trap composed of 20 places in 364 ms of which 2 ms to minimize.
[2023-03-22 06:37:12] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2023-03-22 06:37:12] [INFO ] Deduced a trap composed of 34 places in 371 ms of which 1 ms to minimize.
[2023-03-22 06:37:12] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-22 06:37:13] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 0 ms to minimize.
[2023-03-22 06:37:13] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 1 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 1 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 0 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 0 ms to minimize.
[2023-03-22 06:37:15] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 0 ms to minimize.
[2023-03-22 06:37:15] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 1 ms to minimize.
[2023-03-22 06:37:16] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 1 ms to minimize.
[2023-03-22 06:37:16] [INFO ] Deduced a trap composed of 33 places in 528 ms of which 0 ms to minimize.
[2023-03-22 06:37:17] [INFO ] Deduced a trap composed of 29 places in 296 ms of which 1 ms to minimize.
[2023-03-22 06:37:17] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 1 ms to minimize.
[2023-03-22 06:37:17] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 1 ms to minimize.
[2023-03-22 06:37:18] [INFO ] Deduced a trap composed of 41 places in 445 ms of which 1 ms to minimize.
[2023-03-22 06:37:18] [INFO ] Deduced a trap composed of 32 places in 373 ms of which 1 ms to minimize.
[2023-03-22 06:37:19] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 0 ms to minimize.
[2023-03-22 06:37:19] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 1 ms to minimize.
[2023-03-22 06:37:19] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 1 ms to minimize.
[2023-03-22 06:37:20] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 1 ms to minimize.
[2023-03-22 06:37:20] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 1 ms to minimize.
[2023-03-22 06:37:20] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 1 ms to minimize.
[2023-03-22 06:37:21] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 0 ms to minimize.
[2023-03-22 06:37:21] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 1 ms to minimize.
[2023-03-22 06:37:21] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 1 ms to minimize.
[2023-03-22 06:37:22] [INFO ] Deduced a trap composed of 42 places in 305 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:339)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-22 06:37:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:37:22] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2012 transition count 1385
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 836 place count 1594 transition count 1143
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1318 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2337 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2609 place count 751 transition count 630
Applied a total of 2609 rules in 232 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 207486 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207486 steps, saw 171564 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2023-03-22 06:37:25] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-22 06:37:26] [INFO ] [Real]Absence check using 330 positive place invariants in 129 ms returned sat
[2023-03-22 06:37:26] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:37:26] [INFO ] [Nat]Absence check using 330 positive place invariants in 63 ms returned sat
[2023-03-22 06:37:26] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:37:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 06:37:26] [INFO ] After 81ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:37:26] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2023-03-22 06:37:27] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-22 06:37:27] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-22 06:37:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2023-03-22 06:37:27] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-22 06:37:27] [INFO ] After 1294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 71 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-22 06:37:27] [INFO ] Invariant cache hit.
[2023-03-22 06:37:27] [INFO ] Implicit Places using invariants in 389 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 390 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 22 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-22 06:37:27] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:37:28] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-22 06:37:28] [INFO ] Invariant cache hit.
[2023-03-22 06:37:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:37:29] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1791 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 216765 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216765 steps, saw 180832 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:37:32] [INFO ] Invariant cache hit.
[2023-03-22 06:37:32] [INFO ] [Real]Absence check using 328 positive place invariants in 62 ms returned sat
[2023-03-22 06:37:32] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:37:32] [INFO ] [Nat]Absence check using 328 positive place invariants in 83 ms returned sat
[2023-03-22 06:37:33] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:37:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:37:33] [INFO ] After 127ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:37:33] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2023-03-22 06:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-22 06:37:33] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-22 06:37:33] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 12 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 12 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2023-03-22 06:37:33] [INFO ] Invariant cache hit.
[2023-03-22 06:37:34] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-22 06:37:34] [INFO ] Invariant cache hit.
[2023-03-22 06:37:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:37:35] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2023-03-22 06:37:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 06:37:35] [INFO ] Invariant cache hit.
[2023-03-22 06:37:35] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1955 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 747 transition count 628
Applied a total of 175 rules in 39 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2023-03-22 06:37:35] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:37:35] [INFO ] [Real]Absence check using 328 positive place invariants in 71 ms returned sat
[2023-03-22 06:37:35] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:37:36] [INFO ] [Nat]Absence check using 328 positive place invariants in 54 ms returned sat
[2023-03-22 06:37:36] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:37:36] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-22 06:37:36] [INFO ] After 189ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:37:37] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 1 ms to minimize.
[2023-03-22 06:37:37] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-22 06:37:37] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-22 06:37:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 843 ms
[2023-03-22 06:37:37] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 1 ms to minimize.
[2023-03-22 06:37:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-22 06:37:37] [INFO ] After 1569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-22 06:37:38] [INFO ] After 2225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 935 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:37:39] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-22 06:37:41] [INFO ] [Real]Absence check using 331 positive place invariants in 405 ms returned sat
[2023-03-22 06:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:37:54] [INFO ] [Real]Absence check using state equation in 13381 ms returned unknown
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 464 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 28491 reset in 795 ms.
Product exploration explored 100000 steps with 28710 reset in 751 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 411 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2012 transition count 1802
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 151 Pre rules applied. Total rules applied 418 place count 2012 transition count 1922
Deduced a syphon composed of 569 places in 3 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 569 place count 2012 transition count 1922
Performed 569 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1138 places in 3 ms
Iterating global reduction 1 with 569 rules applied. Total rules applied 1138 place count 2012 transition count 1923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1139 place count 2012 transition count 1922
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 1350 place count 1801 transition count 1710
Deduced a syphon composed of 927 places in 3 ms
Iterating global reduction 2 with 211 rules applied. Total rules applied 1561 place count 1801 transition count 1710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 928 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1562 place count 1801 transition count 1710
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1564 place count 1799 transition count 1708
Deduced a syphon composed of 926 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1566 place count 1799 transition count 1708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1027 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1667 place count 1799 transition count 2138
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1768 place count 1698 transition count 1936
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1869 place count 1698 transition count 1936
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 943 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1886 place count 1698 transition count 2009
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1903 place count 1681 transition count 1975
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1920 place count 1681 transition count 1975
Deduced a syphon composed of 926 places in 2 ms
Applied a total of 1920 rules in 1471 ms. Remains 1681 /2012 variables (removed 331) and now considering 1975/1802 (removed -173) transitions.
[2023-03-22 06:37:59] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1975 rows 1681 cols
[2023-03-22 06:37:59] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-22 06:38:00] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1681/2012 places, 1975/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2811 ms. Remains : 1681/2012 places, 1975/1802 transitions.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 79 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:38:00] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 06:38:01] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-22 06:38:01] [INFO ] Invariant cache hit.
[2023-03-22 06:38:03] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2716 ms to find 0 implicit places.
[2023-03-22 06:38:03] [INFO ] Invariant cache hit.
[2023-03-22 06:38:04] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3989 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 153156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2019 transition count 1386
Reduce places removed 423 places and 0 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1596 transition count 1386
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 846 place count 1596 transition count 1152
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1319 place count 1357 transition count 1147
Iterating global reduction 2 with 5 rules applied. Total rules applied 1324 place count 1357 transition count 1147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1324 place count 1357 transition count 1143
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1353 transition count 1143
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2353 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2531 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2533 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 751 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2538 place count 749 transition count 628
Applied a total of 2538 rules in 234 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2023-03-22 06:38:04] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:38:05] [INFO ] Implicit Places using invariants in 687 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 705 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2020 places, 628/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 38 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2023-03-22 06:38:05] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:38:05] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-22 06:38:05] [INFO ] Invariant cache hit.
[2023-03-22 06:38:06] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2020 places, 626/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2410 ms. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s703 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 565 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-05 finished in 3062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2019 transition count 1386
Reduce places removed 423 places and 0 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1596 transition count 1386
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 846 place count 1596 transition count 1152
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1319 place count 1357 transition count 1147
Iterating global reduction 2 with 5 rules applied. Total rules applied 1324 place count 1357 transition count 1147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1324 place count 1357 transition count 1143
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1353 transition count 1143
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2353 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2531 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2533 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 751 transition count 628
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2538 place count 749 transition count 628
Applied a total of 2538 rules in 224 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2023-03-22 06:38:07] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:38:08] [INFO ] Implicit Places using invariants in 408 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 410 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2020 places, 628/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 33 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2023-03-22 06:38:08] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:38:08] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-03-22 06:38:08] [INFO ] Invariant cache hit.
[2023-03-22 06:38:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:38:09] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2020 places, 626/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2111 ms. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s528 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 540 ms.
Product exploration explored 100000 steps with 0 reset in 775 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/745 stabilizing places and 2/626 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 34 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2023-03-22 06:38:11] [INFO ] Invariant cache hit.
[2023-03-22 06:38:12] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-22 06:38:12] [INFO ] Invariant cache hit.
[2023-03-22 06:38:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:38:13] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2023-03-22 06:38:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 06:38:13] [INFO ] Invariant cache hit.
[2023-03-22 06:38:13] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1910 ms. Remains : 745/745 places, 626/626 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/745 stabilizing places and 2/626 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 502 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 9 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-09 finished in 7207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2019 transition count 1388
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1598 transition count 1388
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 842 place count 1598 transition count 1155
Deduced a syphon composed of 233 places in 3 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1308 place count 1365 transition count 1155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1312 place count 1361 transition count 1151
Iterating global reduction 2 with 4 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1316 place count 1361 transition count 1148
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1322 place count 1358 transition count 1148
Performed 513 Post agglomeration using F-continuation condition.Transition count delta: 513
Deduced a syphon composed of 513 places in 0 ms
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 2 with 1026 rules applied. Total rules applied 2348 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2525 place count 757 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2527 place count 755 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2528 place count 754 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2528 place count 754 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2532 place count 752 transition count 629
Applied a total of 2532 rules in 284 ms. Remains 752 /2020 variables (removed 1268) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 752 cols
[2023-03-22 06:38:15] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:38:15] [INFO ] Implicit Places using invariants in 475 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 476 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2020 places, 629/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 627
Applied a total of 4 rules in 21 ms. Remains 748 /750 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 748 cols
[2023-03-22 06:38:15] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:38:16] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-22 06:38:16] [INFO ] Invariant cache hit.
[2023-03-22 06:38:17] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2162 ms. Remains : 748/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-10 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s198 0), p1:(EQ s150 1), p2:(EQ s573 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 535 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-10 finished in 2966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 187 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-22 06:38:18] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-22 06:38:18] [INFO ] Implicit Places using invariants in 623 ms returned []
[2023-03-22 06:38:18] [INFO ] Invariant cache hit.
[2023-03-22 06:38:21] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
[2023-03-22 06:38:21] [INFO ] Invariant cache hit.
[2023-03-22 06:38:22] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4673 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s867 1), p1:(NEQ s1464 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 8630 steps with 0 reset in 48 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-12 finished in 4923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U p2)))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 844 place count 1597 transition count 1154
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1313 place count 1361 transition count 1151
Iterating global reduction 2 with 3 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1316 place count 1361 transition count 1149
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 514 Post agglomeration using F-continuation condition.Transition count delta: 514
Deduced a syphon composed of 514 places in 1 ms
Reduce places removed 514 places and 0 transitions.
Iterating global reduction 2 with 1028 rules applied. Total rules applied 2348 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 751 transition count 629
Applied a total of 2534 rules in 260 ms. Remains 751 /2020 variables (removed 1269) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 751 cols
[2023-03-22 06:38:22] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:38:23] [INFO ] Implicit Places using invariants in 384 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 629/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 627
Applied a total of 4 rules in 26 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2023-03-22 06:38:23] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:38:23] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-22 06:38:23] [INFO ] Invariant cache hit.
[2023-03-22 06:38:24] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1962 ms. Remains : 747/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s373 1), p1:(EQ s402 1), p0:(EQ s705 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-14 finished in 2197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2019 transition count 1389
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 840 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1315 place count 1359 transition count 1149
Iterating global reduction 2 with 5 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1320 place count 1359 transition count 1145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2346 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2347 place count 846 transition count 635
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2349 place count 845 transition count 634
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2527 place count 756 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 751 transition count 630
Applied a total of 2534 rules in 253 ms. Remains 751 /2020 variables (removed 1269) and now considering 630/1810 (removed 1180) transitions.
// Phase 1: matrix 630 rows 751 cols
[2023-03-22 06:38:25] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:38:25] [INFO ] Implicit Places using invariants in 343 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 358 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 630/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 20 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-22 06:38:25] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:38:25] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-22 06:38:25] [INFO ] Invariant cache hit.
[2023-03-22 06:38:26] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 628/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1693 ms. Remains : 747/2020 places, 628/1810 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s508 1) (EQ s207 1)), p1:(AND (EQ s105 1) (EQ s123 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 529 ms.
Stack based approach found an accepted trace after 251 steps with 0 reset with depth 252 and stack size 252 in 2 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-15 finished in 2310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p0&&X((!p0 U (p1||G(!p0))))) U (!p1||F(p2))))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 370 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p1 (NOT p2))]
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2019 transition count 1390
Reduce places removed 419 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 839 place count 1600 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 840 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 840 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1314 place count 1360 transition count 1150
Iterating global reduction 3 with 4 rules applied. Total rules applied 1318 place count 1360 transition count 1150
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1318 place count 1360 transition count 1146
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1326 place count 1356 transition count 1146
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 2346 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2347 place count 846 transition count 635
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2349 place count 845 transition count 634
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2527 place count 756 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2530 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2534 place count 751 transition count 630
Applied a total of 2534 rules in 302 ms. Remains 751 /2020 variables (removed 1269) and now considering 630/1810 (removed 1180) transitions.
// Phase 1: matrix 630 rows 751 cols
[2023-03-22 06:38:28] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:38:28] [INFO ] Implicit Places using invariants in 600 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 749/2020 places, 630/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 22 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-22 06:38:28] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:38:29] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-22 06:38:29] [INFO ] Invariant cache hit.
[2023-03-22 06:38:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 06:38:30] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 747/2020 places, 628/1810 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2380 ms. Remains : 747/2020 places, 628/1810 transitions.
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s428 1), p2:(EQ s224 1), p0:(AND (EQ s283 1) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13828 reset in 610 ms.
Stack based approach found an accepted trace after 1423 steps with 197 reset with depth 12 and stack size 12 in 10 ms.
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 3527 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-22 06:38:30] [INFO ] Flatten gal took : 51 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 309947 ms.
ITS solved all properties within timeout

BK_STOP 1679467111012

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;