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-167903717100500.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 ShieldPPPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.2K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 02:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 02:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 02:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 447K 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 ShieldPPPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679455631082

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=ShieldPPPs-PT-050A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:27:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:27:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:27:14] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-22 03:27:14] [INFO ] Transformed 1553 places.
[2023-03-22 03:27:14] [INFO ] Transformed 1303 transitions.
[2023-03-22 03:27:14] [INFO ] Found NUPN structural information;
[2023-03-22 03:27:14] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 336 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:27:16] [INFO ] Computed 551 place invariants in 53 ms
[2023-03-22 03:27:21] [INFO ] Implicit Places using invariants in 5442 ms returned []
[2023-03-22 03:27:21] [INFO ] Invariant cache hit.
[2023-03-22 03:27:22] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 6798 ms to find 0 implicit places.
[2023-03-22 03:27:22] [INFO ] Invariant cache hit.
[2023-03-22 03:27:24] [INFO ] Dead Transitions using invariants and state equation in 2292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9458 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 58 out of 1553 places after structural reductions.
[2023-03-22 03:27:25] [INFO ] Flatten gal took : 291 ms
[2023-03-22 03:27:25] [INFO ] Flatten gal took : 180 ms
[2023-03-22 03:27:26] [INFO ] Input system was already deterministic with 1303 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 31) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 03:27:27] [INFO ] Invariant cache hit.
[2023-03-22 03:27:28] [INFO ] [Real]Absence check using 551 positive place invariants in 167 ms returned sat
[2023-03-22 03:27:29] [INFO ] After 2000ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 03:27:30] [INFO ] [Nat]Absence check using 551 positive place invariants in 195 ms returned sat
[2023-03-22 03:27:32] [INFO ] After 1974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 03:27:33] [INFO ] After 3653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1466 ms.
[2023-03-22 03:27:35] [INFO ] After 5936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 830 ms.
Support contains 11 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 443 times.
Drop transitions removed 443 transitions
Iterating global reduction 0 with 443 rules applied. Total rules applied 447 place count 1551 transition count 1301
Applied a total of 447 rules in 220 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:27:37] [INFO ] Computed 551 place invariants in 104 ms
[2023-03-22 03:27:38] [INFO ] [Real]Absence check using 519 positive place invariants in 270 ms returned sat
[2023-03-22 03:27:38] [INFO ] [Real]Absence check using 519 positive and 32 generalized place invariants in 33 ms returned sat
[2023-03-22 03:27:40] [INFO ] After 3136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:27:40] [INFO ] [Nat]Absence check using 519 positive place invariants in 162 ms returned sat
[2023-03-22 03:27:40] [INFO ] [Nat]Absence check using 519 positive and 32 generalized place invariants in 8 ms returned sat
[2023-03-22 03:27:42] [INFO ] After 1173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:27:42] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 1 ms to minimize.
[2023-03-22 03:27:43] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 2 ms to minimize.
[2023-03-22 03:27:43] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 2 ms to minimize.
[2023-03-22 03:27:44] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 2 ms to minimize.
[2023-03-22 03:27:44] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2023-03-22 03:27:45] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:27:45] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-22 03:27:45] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:27:45] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-22 03:27:45] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-22 03:27:46] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-22 03:27:46] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-22 03:27:46] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-22 03:27:46] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:27:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4727 ms
[2023-03-22 03:27:47] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2023-03-22 03:27:47] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2023-03-22 03:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2023-03-22 03:27:47] [INFO ] After 6916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-22 03:27:48] [INFO ] After 7896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 498 ms.
Support contains 5 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1550 transition count 1300
Applied a total of 1 rules in 146 ms. Remains 1550 /1551 variables (removed 1) and now considering 1300/1301 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1550/1551 places, 1300/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 173789 steps, run timeout after 3032 ms. (steps per millisecond=57 ) properties seen :{0=1}
Probabilistic random walk after 173789 steps, saw 172106 distinct states, run finished after 3033 ms. (steps per millisecond=57 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1300 rows 1550 cols
[2023-03-22 03:27:52] [INFO ] Computed 551 place invariants in 33 ms
[2023-03-22 03:27:52] [INFO ] [Real]Absence check using 529 positive place invariants in 132 ms returned sat
[2023-03-22 03:27:52] [INFO ] [Real]Absence check using 529 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-22 03:27:54] [INFO ] After 2750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:27:55] [INFO ] [Nat]Absence check using 529 positive place invariants in 290 ms returned sat
[2023-03-22 03:27:55] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-22 03:27:56] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:27:57] [INFO ] Deduced a trap composed of 5 places in 481 ms of which 1 ms to minimize.
[2023-03-22 03:27:57] [INFO ] Deduced a trap composed of 6 places in 385 ms of which 0 ms to minimize.
[2023-03-22 03:27:57] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-22 03:27:58] [INFO ] Deduced a trap composed of 9 places in 486 ms of which 1 ms to minimize.
[2023-03-22 03:27:58] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2023-03-22 03:27:59] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 1 ms to minimize.
[2023-03-22 03:27:59] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2023-03-22 03:28:00] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-22 03:28:00] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 2 ms to minimize.
[2023-03-22 03:28:00] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2023-03-22 03:28:01] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2023-03-22 03:28:01] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 1 ms to minimize.
[2023-03-22 03:28:01] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-22 03:28:02] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2023-03-22 03:28:02] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-22 03:28:03] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 22 ms to minimize.
[2023-03-22 03:28:03] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2023-03-22 03:28:03] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 6 ms to minimize.
[2023-03-22 03:28:04] [INFO ] Deduced a trap composed of 5 places in 402 ms of which 0 ms to minimize.
[2023-03-22 03:28:04] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-22 03:28:04] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 4 ms to minimize.
[2023-03-22 03:28:05] [INFO ] Deduced a trap composed of 33 places in 543 ms of which 14 ms to minimize.
[2023-03-22 03:28:05] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-22 03:28:06] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 2 ms to minimize.
[2023-03-22 03:28:06] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 14 ms to minimize.
[2023-03-22 03:28:07] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2023-03-22 03:28:07] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-22 03:28:07] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:28:08] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2023-03-22 03:28:08] [INFO ] Deduced a trap composed of 8 places in 694 ms of which 0 ms to minimize.
[2023-03-22 03:28:09] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2023-03-22 03:28:09] [INFO ] Deduced a trap composed of 6 places in 437 ms of which 1 ms to minimize.
[2023-03-22 03:28:09] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-22 03:28:10] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 26 ms to minimize.
[2023-03-22 03:28:10] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-22 03:28:10] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-22 03:28:11] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-22 03:28:13] [INFO ] Deduced a trap composed of 6 places in 1995 ms of which 27 ms to minimize.
[2023-03-22 03:28:13] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-22 03:28:13] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2023-03-22 03:28:14] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-22 03:28:14] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-22 03:28:14] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-22 03:28:14] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-22 03:28:14] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-22 03:28:15] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-22 03:28:15] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-22 03:28:16] [INFO ] Deduced a trap composed of 6 places in 539 ms of which 4 ms to minimize.
[2023-03-22 03:28:16] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2023-03-22 03:28:17] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 14 ms to minimize.
[2023-03-22 03:28:17] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 15 ms to minimize.
[2023-03-22 03:28:18] [INFO ] Deduced a trap composed of 6 places in 488 ms of which 22 ms to minimize.
[2023-03-22 03:28:18] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-03-22 03:28:18] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 2 ms to minimize.
[2023-03-22 03:28:21] [INFO ] Deduced a trap composed of 4 places in 1425 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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 03:28:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:28:21] [INFO ] After 26153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 98 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219594 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219594 steps, saw 217507 distinct states, run finished after 3003 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:28:24] [INFO ] Invariant cache hit.
[2023-03-22 03:28:25] [INFO ] [Real]Absence check using 529 positive place invariants in 101 ms returned sat
[2023-03-22 03:28:25] [INFO ] [Real]Absence check using 529 positive and 22 generalized place invariants in 104 ms returned sat
[2023-03-22 03:28:26] [INFO ] After 2173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:28:27] [INFO ] [Nat]Absence check using 529 positive place invariants in 147 ms returned sat
[2023-03-22 03:28:27] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 8 ms returned sat
[2023-03-22 03:28:28] [INFO ] After 1455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:28:29] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 2 ms to minimize.
[2023-03-22 03:28:29] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-22 03:28:30] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 1 ms to minimize.
[2023-03-22 03:28:30] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 0 ms to minimize.
[2023-03-22 03:28:30] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 1 ms to minimize.
[2023-03-22 03:28:31] [INFO ] Deduced a trap composed of 5 places in 530 ms of which 0 ms to minimize.
[2023-03-22 03:28:31] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2023-03-22 03:28:32] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-22 03:28:32] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2023-03-22 03:28:33] [INFO ] Deduced a trap composed of 6 places in 443 ms of which 1 ms to minimize.
[2023-03-22 03:28:33] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 1 ms to minimize.
[2023-03-22 03:28:34] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 1 ms to minimize.
[2023-03-22 03:28:34] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 0 ms to minimize.
[2023-03-22 03:28:34] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-22 03:28:35] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-22 03:28:35] [INFO ] Deduced a trap composed of 6 places in 529 ms of which 1 ms to minimize.
[2023-03-22 03:28:36] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 2 ms to minimize.
[2023-03-22 03:28:36] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-22 03:28:36] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 0 ms to minimize.
[2023-03-22 03:28:38] [INFO ] Deduced a trap composed of 6 places in 1470 ms of which 1 ms to minimize.
[2023-03-22 03:28:38] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-22 03:28:45] [INFO ] Deduced a trap composed of 6 places in 6774 ms of which 1 ms to minimize.
[2023-03-22 03:28:45] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 1 ms to minimize.
[2023-03-22 03:28:46] [INFO ] Deduced a trap composed of 6 places in 762 ms of which 0 ms to minimize.
[2023-03-22 03:28:47] [INFO ] Deduced a trap composed of 6 places in 996 ms of which 0 ms to minimize.
[2023-03-22 03:28:48] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-22 03:28:48] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-22 03:28:48] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-22 03:28:48] [INFO ] Deduced a trap composed of 11 places in 414 ms of which 0 ms to minimize.
[2023-03-22 03:28:49] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2023-03-22 03:28:49] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2023-03-22 03:28:49] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 0 ms to minimize.
[2023-03-22 03:28:49] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-22 03:28:50] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-22 03:28:50] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2023-03-22 03:28:50] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 21785 ms
[2023-03-22 03:28:50] [INFO ] After 23309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-22 03:28:50] [INFO ] After 23971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 69 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 101 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-22 03:28:50] [INFO ] Invariant cache hit.
[2023-03-22 03:28:53] [INFO ] Implicit Places using invariants in 2240 ms returned []
[2023-03-22 03:28:53] [INFO ] Invariant cache hit.
[2023-03-22 03:29:03] [INFO ] Implicit Places using invariants and state equation in 10266 ms returned []
Implicit Place search using SMT with State Equation took 12540 ms to find 0 implicit places.
[2023-03-22 03:29:03] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-22 03:29:03] [INFO ] Invariant cache hit.
[2023-03-22 03:29:04] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14248 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 46 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 03:29:05] [INFO ] Invariant cache hit.
[2023-03-22 03:29:05] [INFO ] [Real]Absence check using 529 positive place invariants in 523 ms returned sat
[2023-03-22 03:29:05] [INFO ] [Real]Absence check using 529 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-22 03:29:06] [INFO ] After 1909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:29:07] [INFO ] [Nat]Absence check using 529 positive place invariants in 148 ms returned sat
[2023-03-22 03:29:07] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 47 ms returned sat
[2023-03-22 03:29:08] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:29:08] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2023-03-22 03:29:09] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-22 03:29:09] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 1 ms to minimize.
[2023-03-22 03:29:10] [INFO ] Deduced a trap composed of 6 places in 421 ms of which 1 ms to minimize.
[2023-03-22 03:29:10] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 1 ms to minimize.
[2023-03-22 03:29:11] [INFO ] Deduced a trap composed of 5 places in 480 ms of which 0 ms to minimize.
[2023-03-22 03:29:11] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2023-03-22 03:29:11] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 1 ms to minimize.
[2023-03-22 03:29:12] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-22 03:29:12] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 1 ms to minimize.
[2023-03-22 03:29:13] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2023-03-22 03:29:13] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 0 ms to minimize.
[2023-03-22 03:29:13] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2023-03-22 03:29:14] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 34 ms to minimize.
[2023-03-22 03:29:14] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 1 ms to minimize.
[2023-03-22 03:29:15] [INFO ] Deduced a trap composed of 6 places in 515 ms of which 0 ms to minimize.
[2023-03-22 03:29:15] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 0 ms to minimize.
[2023-03-22 03:29:16] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 0 ms to minimize.
[2023-03-22 03:29:16] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-22 03:29:16] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 14 ms to minimize.
[2023-03-22 03:29:17] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 1 ms to minimize.
[2023-03-22 03:29:17] [INFO ] Deduced a trap composed of 6 places in 640 ms of which 1 ms to minimize.
[2023-03-22 03:29:18] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 3 ms to minimize.
[2023-03-22 03:29:18] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-22 03:29:18] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-22 03:29:19] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 1 ms to minimize.
[2023-03-22 03:29:19] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 1 ms to minimize.
[2023-03-22 03:29:19] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 0 ms to minimize.
[2023-03-22 03:29:20] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-22 03:29:20] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 03:29:20] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 1 ms to minimize.
[2023-03-22 03:29:20] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:29:21] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 14 ms to minimize.
[2023-03-22 03:29:21] [INFO ] Deduced a trap composed of 6 places in 456 ms of which 0 ms to minimize.
[2023-03-22 03:29:22] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-22 03:29:22] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 13514 ms
[2023-03-22 03:29:22] [INFO ] After 14583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-22 03:29:22] [INFO ] After 15356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&G(F(!p1)))) U (p2&&X(F(p3)))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 39 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:29:23] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-22 03:29:25] [INFO ] Implicit Places using invariants in 1953 ms returned []
[2023-03-22 03:29:25] [INFO ] Invariant cache hit.
[2023-03-22 03:29:28] [INFO ] Implicit Places using invariants and state equation in 3386 ms returned []
Implicit Place search using SMT with State Equation took 5362 ms to find 0 implicit places.
[2023-03-22 03:29:28] [INFO ] Invariant cache hit.
[2023-03-22 03:29:29] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6672 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 658 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}, { cond=p2, acceptance={0} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s921 1), p1:(AND (EQ s1213 1) (EQ s1234 1)), p0:(AND (EQ s917 1) (EQ s928 1)), p3:(AND (EQ s1213 1) (EQ s1234 1) (EQ s562 1) (EQ s583 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 204 reset in 1063 ms.
Product exploration explored 100000 steps with 206 reset in 1166 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1566 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:29:35] [INFO ] Invariant cache hit.
[2023-03-22 03:29:35] [INFO ] [Real]Absence check using 551 positive place invariants in 228 ms returned sat
[2023-03-22 03:29:36] [INFO ] After 1783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:29:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 154 ms returned sat
[2023-03-22 03:29:39] [INFO ] After 2533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:29:40] [INFO ] After 2904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-22 03:29:40] [INFO ] After 3668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 0 with 447 rules applied. Total rules applied 451 place count 1551 transition count 1301
Applied a total of 451 rules in 259 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212801 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212801 steps, saw 210821 distinct states, run finished after 3005 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:29:44] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-22 03:29:44] [INFO ] [Real]Absence check using 519 positive place invariants in 141 ms returned sat
[2023-03-22 03:29:44] [INFO ] [Real]Absence check using 519 positive and 32 generalized place invariants in 122 ms returned sat
[2023-03-22 03:29:46] [INFO ] After 2015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:29:46] [INFO ] [Nat]Absence check using 519 positive place invariants in 204 ms returned sat
[2023-03-22 03:29:46] [INFO ] [Nat]Absence check using 519 positive and 32 generalized place invariants in 65 ms returned sat
[2023-03-22 03:29:56] [INFO ] After 10577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 57 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 46 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:29:56] [INFO ] Invariant cache hit.
[2023-03-22 03:29:58] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2023-03-22 03:29:58] [INFO ] Invariant cache hit.
[2023-03-22 03:30:02] [INFO ] Implicit Places using invariants and state equation in 4003 ms returned []
Implicit Place search using SMT with State Equation took 5429 ms to find 0 implicit places.
[2023-03-22 03:30:02] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-22 03:30:02] [INFO ] Invariant cache hit.
[2023-03-22 03:30:03] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7103 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 84 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 03:30:03] [INFO ] Invariant cache hit.
[2023-03-22 03:30:04] [INFO ] [Real]Absence check using 519 positive place invariants in 429 ms returned sat
[2023-03-22 03:30:04] [INFO ] [Real]Absence check using 519 positive and 32 generalized place invariants in 10 ms returned sat
[2023-03-22 03:30:06] [INFO ] After 2212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:30:06] [INFO ] [Nat]Absence check using 519 positive place invariants in 158 ms returned sat
[2023-03-22 03:30:06] [INFO ] [Nat]Absence check using 519 positive and 32 generalized place invariants in 38 ms returned sat
[2023-03-22 03:30:16] [INFO ] After 10803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 14 factoid took 1368 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:30:19] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 03:30:23] [INFO ] [Real]Absence check using 551 positive place invariants in 1941 ms returned sat
[2023-03-22 03:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:30:33] [INFO ] [Real]Absence check using state equation in 9816 ms returned sat
[2023-03-22 03:30:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:30:35] [INFO ] [Nat]Absence check using 551 positive place invariants in 338 ms returned sat
[2023-03-22 03:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:30:42] [INFO ] [Nat]Absence check using state equation in 6979 ms returned sat
[2023-03-22 03:30:42] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 165 ms.
[2023-03-22 03:30:48] [INFO ] Added : 170 causal constraints over 34 iterations in 5784 ms. Result :unknown
Could not prove EG (NOT p2)
[2023-03-22 03:30:48] [INFO ] Invariant cache hit.
[2023-03-22 03:30:50] [INFO ] [Real]Absence check using 551 positive place invariants in 262 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 14 factoid took 771 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050A-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-01 finished in 88843 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) U G((!p1&&X(!p2)))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:30:51] [INFO ] Invariant cache hit.
[2023-03-22 03:30:54] [INFO ] Implicit Places using invariants in 2609 ms returned []
[2023-03-22 03:30:54] [INFO ] Invariant cache hit.
[2023-03-22 03:30:57] [INFO ] Implicit Places using invariants and state equation in 2923 ms returned []
Implicit Place search using SMT with State Equation took 5547 ms to find 0 implicit places.
[2023-03-22 03:30:57] [INFO ] Invariant cache hit.
[2023-03-22 03:30:59] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7281 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s191 1) (EQ s210 1)), p0:(AND (EQ s297 1) (EQ s306 1)), p2:(AND (EQ s790 1) (EQ s832 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40021 reset in 3484 ms.
Product exploration explored 100000 steps with 39918 reset in 3384 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1573 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:31:08] [INFO ] Invariant cache hit.
[2023-03-22 03:31:09] [INFO ] [Real]Absence check using 551 positive place invariants in 164 ms returned sat
[2023-03-22 03:31:09] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:31:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 305 ms returned sat
[2023-03-22 03:31:10] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:31:11] [INFO ] After 1623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-22 03:31:11] [INFO ] After 2745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 283 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 446 place count 1551 transition count 1301
Applied a total of 446 rules in 217 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 2868 steps, including 0 resets, run visited all 2 properties in 54 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 1713 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 260 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 52 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:31:14] [INFO ] Invariant cache hit.
[2023-03-22 03:31:16] [INFO ] Implicit Places using invariants in 1718 ms returned []
[2023-03-22 03:31:16] [INFO ] Invariant cache hit.
[2023-03-22 03:31:20] [INFO ] Implicit Places using invariants and state equation in 4034 ms returned []
Implicit Place search using SMT with State Equation took 5761 ms to find 0 implicit places.
[2023-03-22 03:31:20] [INFO ] Invariant cache hit.
[2023-03-22 03:31:21] [INFO ] Dead Transitions using invariants and state equation in 1273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7086 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1612 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:31:24] [INFO ] Invariant cache hit.
[2023-03-22 03:31:26] [INFO ] [Real]Absence check using 551 positive place invariants in 663 ms returned sat
[2023-03-22 03:31:26] [INFO ] After 1308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:31:27] [INFO ] [Nat]Absence check using 551 positive place invariants in 425 ms returned sat
[2023-03-22 03:31:29] [INFO ] After 2132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:31:30] [INFO ] After 2833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-22 03:31:30] [INFO ] After 4252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 383 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 446 place count 1551 transition count 1301
Applied a total of 446 rules in 141 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 102961 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102961 steps, saw 98735 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:31:34] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-22 03:31:35] [INFO ] [Real]Absence check using 518 positive place invariants in 373 ms returned sat
[2023-03-22 03:31:35] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 56 ms returned sat
[2023-03-22 03:31:35] [INFO ] After 894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:31:35] [INFO ] [Nat]Absence check using 518 positive place invariants in 187 ms returned sat
[2023-03-22 03:31:35] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 32 ms returned sat
[2023-03-22 03:31:50] [INFO ] After 14506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:31:56] [INFO ] Deduced a trap composed of 11 places in 1750 ms of which 0 ms to minimize.
[2023-03-22 03:31:56] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2023-03-22 03:31:56] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 0 ms to minimize.
[2023-03-22 03:31:57] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 1 ms to minimize.
[2023-03-22 03:31:57] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-22 03:31:58] [INFO ] Deduced a trap composed of 11 places in 476 ms of which 39 ms to minimize.
[2023-03-22 03:31:58] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2023-03-22 03:31:58] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 8 ms to minimize.
[2023-03-22 03:31:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4526 ms
[2023-03-22 03:31:58] [INFO ] After 22797ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1494 ms.
[2023-03-22 03:32:00] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 334 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 45 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 100 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:32:00] [INFO ] Invariant cache hit.
[2023-03-22 03:32:04] [INFO ] Implicit Places using invariants in 3995 ms returned []
[2023-03-22 03:32:04] [INFO ] Invariant cache hit.
[2023-03-22 03:32:09] [INFO ] Implicit Places using invariants and state equation in 4901 ms returned []
Implicit Place search using SMT with State Equation took 8902 ms to find 0 implicit places.
[2023-03-22 03:32:09] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-22 03:32:09] [INFO ] Invariant cache hit.
[2023-03-22 03:32:11] [INFO ] Dead Transitions using invariants and state equation in 1676 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10760 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 59 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 03:32:11] [INFO ] Invariant cache hit.
[2023-03-22 03:32:12] [INFO ] [Real]Absence check using 518 positive place invariants in 119 ms returned sat
[2023-03-22 03:32:12] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 134 ms returned sat
[2023-03-22 03:32:12] [INFO ] After 833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:32:14] [INFO ] [Nat]Absence check using 518 positive place invariants in 1569 ms returned sat
[2023-03-22 03:32:14] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 94 ms returned sat
[2023-03-22 03:32:24] [INFO ] After 9663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:32:28] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-22 03:32:28] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-22 03:32:28] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:32:33] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 17 ms to minimize.
[2023-03-22 03:32:34] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 0 ms to minimize.
[2023-03-22 03:32:34] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-22 03:32:34] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-22 03:32:34] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-22 03:32:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7449 ms
[2023-03-22 03:32:36] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 0 ms to minimize.
[2023-03-22 03:32:36] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 0 ms to minimize.
[2023-03-22 03:32:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 841 ms
[2023-03-22 03:32:36] [INFO ] After 22115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10359 ms.
[2023-03-22 03:32:47] [INFO ] After 34657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 17 factoid took 1300 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 365 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 329 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Product exploration explored 100000 steps with 40098 reset in 3288 ms.
Product exploration explored 100000 steps with 39999 reset in 3478 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 304 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 292 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:32:57] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:32:57] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 03:32:58] [INFO ] Dead Transitions using invariants and state equation in 1189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 52 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:32:58] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 03:33:01] [INFO ] Implicit Places using invariants in 3002 ms returned []
[2023-03-22 03:33:01] [INFO ] Invariant cache hit.
[2023-03-22 03:33:07] [INFO ] Implicit Places using invariants and state equation in 5409 ms returned []
Implicit Place search using SMT with State Equation took 8442 ms to find 0 implicit places.
[2023-03-22 03:33:07] [INFO ] Invariant cache hit.
[2023-03-22 03:33:08] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9817 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 136879 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 X(p0))&&F(p2))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 51 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:33:08] [INFO ] Invariant cache hit.
[2023-03-22 03:33:10] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2023-03-22 03:33:10] [INFO ] Invariant cache hit.
[2023-03-22 03:33:12] [INFO ] Implicit Places using invariants and state equation in 2606 ms returned []
Implicit Place search using SMT with State Equation took 3938 ms to find 0 implicit places.
[2023-03-22 03:33:12] [INFO ] Invariant cache hit.
[2023-03-22 03:33:14] [INFO ] Dead Transitions using invariants and state equation in 1403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5404 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1065 1) (EQ s1077 1)), p0:(AND (EQ s411 1) (EQ s431 1)), p2:(AND (EQ s977 1) (EQ s992 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-04 finished in 5768 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(p1)||p0)))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 111 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:33:14] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-22 03:33:16] [INFO ] Implicit Places using invariants in 1583 ms returned []
[2023-03-22 03:33:16] [INFO ] Invariant cache hit.
[2023-03-22 03:33:19] [INFO ] Implicit Places using invariants and state equation in 3170 ms returned []
Implicit Place search using SMT with State Equation took 4818 ms to find 0 implicit places.
[2023-03-22 03:33:19] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 03:33:19] [INFO ] Invariant cache hit.
[2023-03-22 03:33:20] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6267 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (EQ s818 0) (EQ s820 0)) (OR (EQ s253 0) (EQ s272 0))), p0:(OR (AND (EQ s1492 1) (EQ s1513 1)) (AND (EQ s818 1) (EQ s820 1) (EQ s611 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4035 reset in 1085 ms.
Product exploration explored 100000 steps with 3991 reset in 1393 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2363 steps, including 0 resets, run visited all 2 properties in 31 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 474 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1))]
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 94 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:33:24] [INFO ] Invariant cache hit.
[2023-03-22 03:33:26] [INFO ] Implicit Places using invariants in 1698 ms returned []
[2023-03-22 03:33:26] [INFO ] Invariant cache hit.
[2023-03-22 03:33:29] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 4685 ms to find 0 implicit places.
[2023-03-22 03:33:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 03:33:29] [INFO ] Invariant cache hit.
[2023-03-22 03:33:30] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6272 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2514 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4041 reset in 1246 ms.
Product exploration explored 100000 steps with 4002 reset in 1274 ms.
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 51 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:33:34] [INFO ] Invariant cache hit.
[2023-03-22 03:33:36] [INFO ] Implicit Places using invariants in 2422 ms returned []
[2023-03-22 03:33:36] [INFO ] Invariant cache hit.
[2023-03-22 03:33:40] [INFO ] Implicit Places using invariants and state equation in 3572 ms returned []
Implicit Place search using SMT with State Equation took 6040 ms to find 0 implicit places.
[2023-03-22 03:33:40] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 03:33:40] [INFO ] Invariant cache hit.
[2023-03-22 03:33:41] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7232 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-05 finished in 26894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1)&&F(p2))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 45 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:33:41] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 03:33:43] [INFO ] Implicit Places using invariants in 1709 ms returned []
[2023-03-22 03:33:43] [INFO ] Invariant cache hit.
[2023-03-22 03:33:45] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 4327 ms to find 0 implicit places.
[2023-03-22 03:33:45] [INFO ] Invariant cache hit.
[2023-03-22 03:33:47] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5891 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1375 0) (EQ s1385 0) (EQ s12 0) (EQ s14 0)), p2:(AND (EQ s879 1) (EQ s889 1)), p1:(AND (EQ s1375 1) (EQ s1385 1) (EQ s424 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3365 steps with 0 reset in 44 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-07 finished in 6219 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)||G((F(p1)&&F(p2)))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 113 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:33:47] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 03:33:49] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2023-03-22 03:33:49] [INFO ] Invariant cache hit.
[2023-03-22 03:33:54] [INFO ] Implicit Places using invariants and state equation in 4431 ms returned []
Implicit Place search using SMT with State Equation took 6549 ms to find 0 implicit places.
[2023-03-22 03:33:54] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-22 03:33:54] [INFO ] Invariant cache hit.
[2023-03-22 03:33:55] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8011 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1039 1) (EQ s1054 1)), p1:(EQ s1147 0), p2:(OR (EQ s538 0) (EQ s550 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 101 reset in 1081 ms.
Product exploration explored 100000 steps with 99 reset in 1252 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 935 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 2212 steps, including 0 resets, run visited all 2 properties in 56 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 769 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 51 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:34:00] [INFO ] Invariant cache hit.
[2023-03-22 03:34:02] [INFO ] Implicit Places using invariants in 1631 ms returned []
[2023-03-22 03:34:02] [INFO ] Invariant cache hit.
[2023-03-22 03:34:05] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
[2023-03-22 03:34:05] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-22 03:34:05] [INFO ] Invariant cache hit.
[2023-03-22 03:34:06] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5699 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 2250 steps, including 0 resets, run visited all 2 properties in 53 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 493 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 99 reset in 1052 ms.
Product exploration explored 100000 steps with 95 reset in 1192 ms.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 41 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:34:10] [INFO ] Invariant cache hit.
[2023-03-22 03:34:11] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2023-03-22 03:34:11] [INFO ] Invariant cache hit.
[2023-03-22 03:34:14] [INFO ] Implicit Places using invariants and state equation in 3020 ms returned []
Implicit Place search using SMT with State Equation took 4481 ms to find 0 implicit places.
[2023-03-22 03:34:14] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 03:34:14] [INFO ] Invariant cache hit.
[2023-03-22 03:34:16] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5987 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 28929 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 U p1))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 130 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
[2023-03-22 03:34:16] [INFO ] Invariant cache hit.
[2023-03-22 03:34:17] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2023-03-22 03:34:17] [INFO ] Invariant cache hit.
[2023-03-22 03:34:20] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned []
Implicit Place search using SMT with State Equation took 3586 ms to find 0 implicit places.
[2023-03-22 03:34:20] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 03:34:20] [INFO ] Invariant cache hit.
[2023-03-22 03:34:21] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4931 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s337 1), p0:(AND (EQ s1307 1) (EQ s1326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3185 steps with 0 reset in 32 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-09 finished in 5093 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(p1)&&p0) U X(G(p2))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 43 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:34:21] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-22 03:34:23] [INFO ] Implicit Places using invariants in 1829 ms returned []
[2023-03-22 03:34:23] [INFO ] Invariant cache hit.
[2023-03-22 03:34:26] [INFO ] Implicit Places using invariants and state equation in 2907 ms returned []
Implicit Place search using SMT with State Equation took 4740 ms to find 0 implicit places.
[2023-03-22 03:34:26] [INFO ] Invariant cache hit.
[2023-03-22 03:34:27] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5890 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s229 1) (EQ s231 1)), p0:(AND (EQ s229 1) (EQ s231 1)), p1:(AND (EQ s1069 1) (EQ s1111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-10 finished in 6108 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||F(p1))))||G(p2)))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 135 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:34:27] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-22 03:34:29] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2023-03-22 03:34:29] [INFO ] Invariant cache hit.
[2023-03-22 03:34:32] [INFO ] Implicit Places using invariants and state equation in 3069 ms returned []
Implicit Place search using SMT with State Equation took 4982 ms to find 0 implicit places.
[2023-03-22 03:34:32] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 03:34:32] [INFO ] Invariant cache hit.
[2023-03-22 03:34:34] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6399 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1245 1) (EQ s1264 1)), p0:(EQ s1386 1), p1:(AND (EQ s128 1) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 36 reset in 1127 ms.
Product exploration explored 100000 steps with 36 reset in 1339 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 675 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 287 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 529 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:34:38] [INFO ] Invariant cache hit.
[2023-03-22 03:34:40] [INFO ] [Real]Absence check using 551 positive place invariants in 488 ms returned sat
[2023-03-22 03:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:34:48] [INFO ] [Real]Absence check using state equation in 7696 ms returned sat
[2023-03-22 03:34:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:34:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 420 ms returned sat
[2023-03-22 03:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:34:55] [INFO ] [Nat]Absence check using state equation in 5206 ms returned sat
[2023-03-22 03:34:55] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 110 ms.
[2023-03-22 03:35:04] [INFO ] Deduced a trap composed of 3 places in 1163 ms of which 6 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:614)
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 03:35:04] [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 (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 106 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:35:04] [INFO ] Invariant cache hit.
[2023-03-22 03:35:05] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2023-03-22 03:35:05] [INFO ] Invariant cache hit.
[2023-03-22 03:35:09] [INFO ] Implicit Places using invariants and state equation in 3353 ms returned []
Implicit Place search using SMT with State Equation took 4545 ms to find 0 implicit places.
[2023-03-22 03:35:09] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-22 03:35:09] [INFO ] Invariant cache hit.
[2023-03-22 03:35:10] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6068 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 446 steps, including 0 resets, run visited all 2 properties in 48 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 462 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:35:12] [INFO ] Invariant cache hit.
[2023-03-22 03:35:14] [INFO ] [Real]Absence check using 551 positive place invariants in 518 ms returned sat
[2023-03-22 03:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:35:22] [INFO ] [Real]Absence check using state equation in 7557 ms returned sat
[2023-03-22 03:35:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:35:25] [INFO ] [Nat]Absence check using 551 positive place invariants in 775 ms returned sat
[2023-03-22 03:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:35:31] [INFO ] [Nat]Absence check using state equation in 6023 ms returned sat
[2023-03-22 03:35:31] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 136 ms.
[2023-03-22 03:35:37] [INFO ] Added : 185 causal constraints over 37 iterations in 6289 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 35 reset in 1150 ms.
Product exploration explored 100000 steps with 35 reset in 1320 ms.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 58 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:35:40] [INFO ] Invariant cache hit.
[2023-03-22 03:35:41] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2023-03-22 03:35:41] [INFO ] Invariant cache hit.
[2023-03-22 03:35:44] [INFO ] Implicit Places using invariants and state equation in 3199 ms returned []
Implicit Place search using SMT with State Equation took 4341 ms to find 0 implicit places.
[2023-03-22 03:35:44] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-22 03:35:44] [INFO ] Invariant cache hit.
[2023-03-22 03:35:45] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5559 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-11 finished in 78209 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) U X(X((p1||F(G(!p2)))))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:35:45] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-22 03:35:47] [INFO ] Implicit Places using invariants in 1442 ms returned []
[2023-03-22 03:35:47] [INFO ] Invariant cache hit.
[2023-03-22 03:35:50] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 4299 ms to find 0 implicit places.
[2023-03-22 03:35:50] [INFO ] Invariant cache hit.
[2023-03-22 03:35:51] [INFO ] Dead Transitions using invariants and state equation in 1194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5541 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s1302 1), p1:(AND (EQ s1339 1) (EQ s1355 1)), p2:(AND (EQ s454 1) (EQ s475 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 1123 ms.
Product exploration explored 100000 steps with 29 reset in 1345 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 459 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Finished random walk after 2056 steps, including 0 resets, run visited all 6 properties in 124 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 788 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 86 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:35:56] [INFO ] Invariant cache hit.
[2023-03-22 03:35:58] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2023-03-22 03:35:58] [INFO ] Invariant cache hit.
[2023-03-22 03:36:01] [INFO ] Implicit Places using invariants and state equation in 2925 ms returned []
Implicit Place search using SMT with State Equation took 4736 ms to find 0 implicit places.
[2023-03-22 03:36:01] [INFO ] Invariant cache hit.
[2023-03-22 03:36:02] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5852 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Finished random walk after 2242 steps, including 0 resets, run visited all 6 properties in 110 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 650 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 388 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 29 reset in 1153 ms.
Product exploration explored 100000 steps with 29 reset in 1394 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 177 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:36:08] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:36:08] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 03:36:10] [INFO ] Dead Transitions using invariants and state equation in 1949 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2176 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 50 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:36:10] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-22 03:36:11] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2023-03-22 03:36:11] [INFO ] Invariant cache hit.
[2023-03-22 03:36:15] [INFO ] Implicit Places using invariants and state equation in 3408 ms returned []
Implicit Place search using SMT with State Equation took 4765 ms to find 0 implicit places.
[2023-03-22 03:36:15] [INFO ] Invariant cache hit.
[2023-03-22 03:36:16] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5822 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-12 finished in 30587 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(X(p1))))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 47 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:36:16] [INFO ] Invariant cache hit.
[2023-03-22 03:36:17] [INFO ] Implicit Places using invariants in 1356 ms returned []
[2023-03-22 03:36:17] [INFO ] Invariant cache hit.
[2023-03-22 03:36:22] [INFO ] Implicit Places using invariants and state equation in 5050 ms returned []
Implicit Place search using SMT with State Equation took 6429 ms to find 0 implicit places.
[2023-03-22 03:36:22] [INFO ] Invariant cache hit.
[2023-03-22 03:36:24] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8206 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s465 1), p1:(OR (EQ s449 0) (EQ s491 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20030 reset in 2110 ms.
Product exploration explored 100000 steps with 20103 reset in 2214 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2388 steps, including 0 resets, run visited all 2 properties in 125 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 381 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 41 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:36:31] [INFO ] Invariant cache hit.
[2023-03-22 03:36:32] [INFO ] Implicit Places using invariants in 1780 ms returned []
[2023-03-22 03:36:32] [INFO ] Invariant cache hit.
[2023-03-22 03:36:35] [INFO ] Implicit Places using invariants and state equation in 2509 ms returned []
Implicit Place search using SMT with State Equation took 4319 ms to find 0 implicit places.
[2023-03-22 03:36:35] [INFO ] Invariant cache hit.
[2023-03-22 03:36:36] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5948 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2503 steps, including 0 resets, run visited all 2 properties in 82 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 451 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 19959 reset in 2092 ms.
Product exploration explored 100000 steps with 19975 reset in 2289 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 5 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 156 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-22 03:36:43] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:36:43] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 03:36:45] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1645 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 41 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:36:45] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 03:36:46] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2023-03-22 03:36:46] [INFO ] Invariant cache hit.
[2023-03-22 03:36:49] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 4593 ms to find 0 implicit places.
[2023-03-22 03:36:49] [INFO ] Invariant cache hit.
[2023-03-22 03:36:51] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5801 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-15 finished in 34799 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) U G((!p1&&X(!p2)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-050A-LTLFireability-02
Stuttering acceptance computed with spot in 328 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 128 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:36:51] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-22 03:36:54] [INFO ] Implicit Places using invariants in 2327 ms returned []
[2023-03-22 03:36:54] [INFO ] Invariant cache hit.
[2023-03-22 03:36:57] [INFO ] Implicit Places using invariants and state equation in 3534 ms returned []
Implicit Place search using SMT with State Equation took 5872 ms to find 0 implicit places.
[2023-03-22 03:36:57] [INFO ] Invariant cache hit.
[2023-03-22 03:36:58] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7147 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s191 1) (EQ s210 1)), p0:(AND (EQ s297 1) (EQ s306 1)), p2:(AND (EQ s790 1) (EQ s832 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40059 reset in 3208 ms.
Product exploration explored 100000 steps with 40087 reset in 3334 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1135 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:37:07] [INFO ] Invariant cache hit.
[2023-03-22 03:37:07] [INFO ] [Real]Absence check using 551 positive place invariants in 119 ms returned sat
[2023-03-22 03:37:07] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:37:08] [INFO ] [Nat]Absence check using 551 positive place invariants in 117 ms returned sat
[2023-03-22 03:37:11] [INFO ] After 2471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:37:11] [INFO ] After 3410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-22 03:37:12] [INFO ] After 4347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 211 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 442 place count 1551 transition count 1301
Applied a total of 442 rules in 98 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 119642 steps, run timeout after 3039 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119642 steps, saw 114993 distinct states, run finished after 3039 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:37:16] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 03:37:16] [INFO ] [Real]Absence check using 518 positive place invariants in 99 ms returned sat
[2023-03-22 03:37:16] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 133 ms returned sat
[2023-03-22 03:37:16] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:37:17] [INFO ] [Nat]Absence check using 518 positive place invariants in 244 ms returned sat
[2023-03-22 03:37:17] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 14 ms returned sat
[2023-03-22 03:37:30] [INFO ] After 13418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:37:33] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2023-03-22 03:37:34] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-22 03:37:34] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-22 03:37:34] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-22 03:37:34] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2023-03-22 03:37:35] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-22 03:37:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1886 ms
[2023-03-22 03:37:35] [INFO ] After 18068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 352 ms.
[2023-03-22 03:37:35] [INFO ] After 19125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 372 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 47 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 50 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:37:36] [INFO ] Invariant cache hit.
[2023-03-22 03:37:39] [INFO ] Implicit Places using invariants in 3315 ms returned []
[2023-03-22 03:37:39] [INFO ] Invariant cache hit.
[2023-03-22 03:37:44] [INFO ] Implicit Places using invariants and state equation in 4888 ms returned []
Implicit Place search using SMT with State Equation took 8208 ms to find 0 implicit places.
[2023-03-22 03:37:44] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 03:37:44] [INFO ] Invariant cache hit.
[2023-03-22 03:37:47] [INFO ] Dead Transitions using invariants and state equation in 2760 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11078 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 128 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 03:37:47] [INFO ] Invariant cache hit.
[2023-03-22 03:37:47] [INFO ] [Real]Absence check using 518 positive place invariants in 129 ms returned sat
[2023-03-22 03:37:47] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 14 ms returned sat
[2023-03-22 03:37:47] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:37:48] [INFO ] [Nat]Absence check using 518 positive place invariants in 202 ms returned sat
[2023-03-22 03:37:48] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 7 ms returned sat
[2023-03-22 03:37:58] [INFO ] After 9537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:38:01] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-22 03:38:02] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2023-03-22 03:38:02] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-22 03:38:07] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2023-03-22 03:38:08] [INFO ] Deduced a trap composed of 11 places in 704 ms of which 1 ms to minimize.
[2023-03-22 03:38:08] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-22 03:38:08] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-22 03:38:09] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-22 03:38:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7823 ms
[2023-03-22 03:38:10] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-22 03:38:10] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-22 03:38:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-22 03:38:10] [INFO ] After 22026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10197 ms.
[2023-03-22 03:38:20] [INFO ] After 32928ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 17 factoid took 1289 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 217 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 47 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:38:22] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 03:38:24] [INFO ] Implicit Places using invariants in 1607 ms returned []
[2023-03-22 03:38:24] [INFO ] Invariant cache hit.
[2023-03-22 03:38:26] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
[2023-03-22 03:38:26] [INFO ] Invariant cache hit.
[2023-03-22 03:38:27] [INFO ] Dead Transitions using invariants and state equation in 1138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5071 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1283 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:38:29] [INFO ] Invariant cache hit.
[2023-03-22 03:38:30] [INFO ] [Real]Absence check using 551 positive place invariants in 194 ms returned sat
[2023-03-22 03:38:30] [INFO ] After 775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:38:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 168 ms returned sat
[2023-03-22 03:38:35] [INFO ] After 4064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:38:36] [INFO ] After 4937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-22 03:38:36] [INFO ] After 5872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 299 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 442 place count 1551 transition count 1301
Applied a total of 442 rules in 118 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Finished random walk after 6360 steps, including 1 resets, run visited all 2 properties in 217 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 1780 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 376 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 221 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Product exploration explored 100000 steps with 40026 reset in 3646 ms.
Product exploration explored 100000 steps with 39988 reset in 3685 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 297 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 124 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:38:47] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 03:38:47] [INFO ] Invariant cache hit.
[2023-03-22 03:38:50] [INFO ] Dead Transitions using invariants and state equation in 2623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2786 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 85 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:38:50] [INFO ] Invariant cache hit.
[2023-03-22 03:38:51] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2023-03-22 03:38:51] [INFO ] Invariant cache hit.
[2023-03-22 03:38:58] [INFO ] Implicit Places using invariants and state equation in 6462 ms returned []
Implicit Place search using SMT with State Equation took 7658 ms to find 0 implicit places.
[2023-03-22 03:38:58] [INFO ] Invariant cache hit.
[2023-03-22 03:38:59] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9614 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 128857 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(p1)||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
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||F(p1))))||G(p2)))'
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) U X(X((p1||F(G(!p2)))))))'
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(X(p1))))))'
[2023-03-22 03:39:00] [INFO ] Flatten gal took : 107 ms
[2023-03-22 03:39:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 03:39:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1553 places, 1303 transitions and 5006 arcs took 24 ms.
Total runtime 706288 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3770/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3770/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3770/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3770/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3770/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3770/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLFireability-02
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLFireability-05
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLFireability-08
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLFireability-11
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLFireability-12
Could not compute solution for formula : ShieldPPPs-PT-050A-LTLFireability-15

BK_STOP 1679456345516

--------------------
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
mcc2023
ltl formula name ShieldPPPs-PT-050A-LTLFireability-02
ltl formula formula --ltl=/tmp/3770/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.100 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3770/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3770/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3770/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3770/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldPPPs-PT-050A-LTLFireability-05
ltl formula formula --ltl=/tmp/3770/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.080 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3770/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3770/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3770/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3770/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPs-PT-050A-LTLFireability-08
ltl formula formula --ltl=/tmp/3770/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.090 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3770/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3770/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3770/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3770/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name ShieldPPPs-PT-050A-LTLFireability-11
ltl formula formula --ltl=/tmp/3770/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.060 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3770/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3770/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3770/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3770/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-050A-LTLFireability-12
ltl formula formula --ltl=/tmp/3770/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.060 user 0.130 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3770/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3770/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3770/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3770/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-050A-LTLFireability-15
ltl formula formula --ltl=/tmp/3770/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1553 places, 1303 transitions and 5006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.060 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3770/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3770/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3770/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3770/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="ShieldPPPs-PT-050A"
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 ShieldPPPs-PT-050A, 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-167903717100500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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