Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800156.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679302526795

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=ShieldRVs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:55:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:55:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:55:28] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-20 08:55:28] [INFO ] Transformed 2003 places.
[2023-03-20 08:55:28] [INFO ] Transformed 2253 transitions.
[2023-03-20 08:55:28] [INFO ] Found NUPN structural information;
[2023-03-20 08:55:28] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 240 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 4 formulas.
FORMULA ShieldRVs-PT-050B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 339 places :
Symmetric choice reduction at 0 with 339 rule applications. Total rules 339 place count 1664 transition count 1914
Iterating global reduction 0 with 339 rules applied. Total rules applied 678 place count 1664 transition count 1914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 679 place count 1663 transition count 1913
Iterating global reduction 0 with 1 rules applied. Total rules applied 680 place count 1663 transition count 1913
Applied a total of 680 rules in 376 ms. Remains 1663 /2003 variables (removed 340) and now considering 1913/2253 (removed 340) transitions.
// Phase 1: matrix 1913 rows 1663 cols
[2023-03-20 08:55:29] [INFO ] Computed 201 place invariants in 30 ms
[2023-03-20 08:55:29] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-20 08:55:29] [INFO ] Invariant cache hit.
[2023-03-20 08:55:31] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
[2023-03-20 08:55:31] [INFO ] Invariant cache hit.
[2023-03-20 08:55:32] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1663/2003 places, 1913/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3573 ms. Remains : 1663/2003 places, 1913/2253 transitions.
Support contains 46 out of 1663 places after structural reductions.
[2023-03-20 08:55:32] [INFO ] Flatten gal took : 171 ms
[2023-03-20 08:55:32] [INFO ] Flatten gal took : 104 ms
[2023-03-20 08:55:33] [INFO ] Input system was already deterministic with 1913 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 08:55:33] [INFO ] Invariant cache hit.
[2023-03-20 08:55:34] [INFO ] [Real]Absence check using 201 positive place invariants in 72 ms returned sat
[2023-03-20 08:55:34] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 08:55:34] [INFO ] [Nat]Absence check using 201 positive place invariants in 64 ms returned sat
[2023-03-20 08:55:36] [INFO ] After 1450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 6 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 28 places in 425 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 14 places in 397 ms of which 2 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 28 places in 373 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 34 places in 392 ms of which 1 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 43 places in 351 ms of which 1 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 1 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 0 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 2 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 61 places in 267 ms of which 2 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 1 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 1 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 0 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 71 places in 241 ms of which 1 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 1 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 0 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 0 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 1 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 1 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 61 places in 208 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 0 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 0 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 4 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 0 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 0 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 0 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 61 places in 208 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 0 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 0 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 0 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 0 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 2 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 0 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 15963 ms
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 49 places in 292 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 0 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 1 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 84 places in 191 ms of which 4 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 83 places in 215 ms of which 1 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 1 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 83 places in 189 ms of which 0 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 1 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 0 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 0 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 13 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 1 ms to minimize.
[2023-03-20 08:55:56] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 13 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 1 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 1 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 0 ms to minimize.
[2023-03-20 08:55:58] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 0 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 0 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 0 ms to minimize.
[2023-03-20 08:55:59] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 0 ms to minimize.
[2023-03-20 08:56:00] [INFO ] Deduced a trap composed of 13 places in 693 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-20 08:56:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:56:00] [INFO ] After 25707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 826 ms.
Support contains 22 out of 1663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1663 transition count 1714
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1464 transition count 1714
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 398 place count 1464 transition count 1465
Deduced a syphon composed of 249 places in 3 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 896 place count 1215 transition count 1465
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 901 place count 1210 transition count 1460
Iterating global reduction 2 with 5 rules applied. Total rules applied 906 place count 1210 transition count 1460
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 906 place count 1210 transition count 1459
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 908 place count 1209 transition count 1459
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 2 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1894 place count 716 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 1993 place count 716 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1994 place count 715 transition count 965
Applied a total of 1994 rules in 391 ms. Remains 715 /1663 variables (removed 948) and now considering 965/1913 (removed 948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 715/1663 places, 965/1913 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 965 rows 715 cols
[2023-03-20 08:56:01] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:56:01] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-20 08:56:02] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
[2023-03-20 08:56:02] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-20 08:56:02] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 7 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 965/965 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 707 transition count 957
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 706 transition count 956
Applied a total of 19 rules in 241 ms. Remains 706 /715 variables (removed 9) and now considering 956/965 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 706/715 places, 956/965 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 225898 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{0=1}
Probabilistic random walk after 225898 steps, saw 61977 distinct states, run finished after 3006 ms. (steps per millisecond=75 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-20 08:56:06] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-20 08:56:06] [INFO ] [Real]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-20 08:56:06] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:56:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-20 08:56:07] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:56:07] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-20 08:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-20 08:56:07] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-20 08:56:07] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 705 transition count 955
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 705 transition count 955
Applied a total of 3 rules in 73 ms. Remains 705 /706 variables (removed 1) and now considering 955/956 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 705/706 places, 955/956 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3039 steps, run visited all 1 properties in 40 ms. (steps per millisecond=75 )
Probabilistic random walk after 3039 steps, saw 2914 distinct states, run finished after 41 ms. (steps per millisecond=74 ) properties seen :1
FORMULA ShieldRVs-PT-050B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 404 stabilizing places and 404 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((G(((X(p0) U p1)&&X(p0)))&&X(p2))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1654 transition count 1904
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1654 transition count 1904
Applied a total of 18 rules in 107 ms. Remains 1654 /1663 variables (removed 9) and now considering 1904/1913 (removed 9) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2023-03-20 08:56:07] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 08:56:08] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-20 08:56:08] [INFO ] Invariant cache hit.
[2023-03-20 08:56:10] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2023-03-20 08:56:10] [INFO ] Invariant cache hit.
[2023-03-20 08:56:11] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1663 places, 1904/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3206 ms. Remains : 1654/1663 places, 1904/1913 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s1602 1), p2:(AND (EQ s840 1) (EQ s849 1) (EQ s870 1) (EQ s1602 0)), p0:(EQ s903 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2135 steps with 0 reset in 30 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-00 finished in 3746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1461 transition count 1461
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1211 transition count 1461
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 913 place count 1200 transition count 1450
Iterating global reduction 2 with 11 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 924 place count 1200 transition count 1448
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 928 place count 1198 transition count 1448
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 2 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1916 place count 704 transition count 954
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1918 place count 702 transition count 952
Applied a total of 1918 rules in 291 ms. Remains 702 /1663 variables (removed 961) and now considering 952/1913 (removed 961) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 08:56:11] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:56:12] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-20 08:56:12] [INFO ] Invariant cache hit.
[2023-03-20 08:56:12] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2023-03-20 08:56:13] [INFO ] Redundant transitions in 336 ms returned [951]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-20 08:56:13] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-20 08:56:13] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/1663 places, 951/1913 transitions.
Applied a total of 0 rules in 30 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2035 ms. Remains : 702/1663 places, 951/1913 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s370 1), p1:(OR (EQ s325 0) (EQ s341 0) (EQ s352 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 150 reset in 570 ms.
Product exploration explored 100000 steps with 150 reset in 724 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 360 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:56:15] [INFO ] Invariant cache hit.
[2023-03-20 08:56:15] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:56:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-20 08:56:16] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:56:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-20 08:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-20 08:56:16] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 08:56:16] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 65 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224548 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224548 steps, saw 96584 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 951 rows 702 cols
[2023-03-20 08:56:19] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 08:56:19] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:56:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:56:19] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2023-03-20 08:56:20] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 08:56:20] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 38 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 34 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-20 08:56:20] [INFO ] Invariant cache hit.
[2023-03-20 08:56:20] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-20 08:56:20] [INFO ] Invariant cache hit.
[2023-03-20 08:56:21] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-20 08:56:21] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-20 08:56:21] [INFO ] Invariant cache hit.
[2023-03-20 08:56:22] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1691 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 08:56:22] [INFO ] Invariant cache hit.
[2023-03-20 08:56:22] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:56:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 08:56:22] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-20 08:56:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2023-03-20 08:56:22] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 08:56:22] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 29 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-20 08:56:23] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:56:23] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-20 08:56:23] [INFO ] Invariant cache hit.
[2023-03-20 08:56:24] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2023-03-20 08:56:24] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-20 08:56:24] [INFO ] Invariant cache hit.
[2023-03-20 08:56:24] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1664 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 266 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:56:25] [INFO ] Invariant cache hit.
[2023-03-20 08:56:25] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 08:56:26] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-20 08:56:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-20 08:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-20 08:56:26] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 08:56:26] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 55 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 702/702 places, 951/951 transitions.
Finished random walk after 2662 steps, including 4 resets, run visited all 2 properties in 24 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 472 ms.
Product exploration explored 100000 steps with 150 reset in 598 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-20 08:56:28] [INFO ] Invariant cache hit.
[2023-03-20 08:56:28] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-20 08:56:28] [INFO ] Invariant cache hit.
[2023-03-20 08:56:29] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-03-20 08:56:29] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-20 08:56:29] [INFO ] Invariant cache hit.
[2023-03-20 08:56:29] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1750 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-01 finished in 18611 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((G(p0)||X((p1||X(p2))))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 139 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:56:30] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-20 08:56:30] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-20 08:56:30] [INFO ] Invariant cache hit.
[2023-03-20 08:56:32] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
[2023-03-20 08:56:32] [INFO ] Invariant cache hit.
[2023-03-20 08:56:33] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3221 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1005 0), p1:(EQ s199 0), p2:(OR (EQ s1152 0) (EQ s1155 0) (EQ s1163 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33172 reset in 958 ms.
Product exploration explored 100000 steps with 33389 reset in 775 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 366 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:56:36] [INFO ] Invariant cache hit.
[2023-03-20 08:56:36] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:36] [INFO ] [Nat]Absence check using 201 positive place invariants in 73 ms returned sat
[2023-03-20 08:56:37] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 1 ms to minimize.
[2023-03-20 08:56:38] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 2 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 25 places in 474 ms of which 2 ms to minimize.
[2023-03-20 08:56:39] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 1 ms to minimize.
[2023-03-20 08:56:40] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 1 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 27 places in 496 ms of which 1 ms to minimize.
[2023-03-20 08:56:41] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 2 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 54 places in 427 ms of which 1 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 39 places in 367 ms of which 1 ms to minimize.
[2023-03-20 08:56:42] [INFO ] Deduced a trap composed of 30 places in 346 ms of which 0 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 1 ms to minimize.
[2023-03-20 08:56:43] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 1 ms to minimize.
[2023-03-20 08:56:44] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 0 ms to minimize.
[2023-03-20 08:56:44] [INFO ] Deduced a trap composed of 32 places in 360 ms of which 1 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 29 places in 406 ms of which 1 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 1 ms to minimize.
[2023-03-20 08:56:45] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 1 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 26 places in 403 ms of which 1 ms to minimize.
[2023-03-20 08:56:46] [INFO ] Deduced a trap composed of 24 places in 438 ms of which 1 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 1 ms to minimize.
[2023-03-20 08:56:47] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 1 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 0 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 1 ms to minimize.
[2023-03-20 08:56:48] [INFO ] Deduced a trap composed of 55 places in 309 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 1 ms to minimize.
[2023-03-20 08:56:49] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 42 places in 355 ms of which 1 ms to minimize.
[2023-03-20 08:56:50] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 56 places in 346 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 50 places in 335 ms of which 1 ms to minimize.
[2023-03-20 08:56:51] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 1 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 1 ms to minimize.
[2023-03-20 08:56:52] [INFO ] Deduced a trap composed of 53 places in 276 ms of which 0 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 1 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 49 places in 301 ms of which 1 ms to minimize.
[2023-03-20 08:56:53] [INFO ] Deduced a trap composed of 42 places in 310 ms of which 1 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 63 places in 303 ms of which 0 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 1 ms to minimize.
[2023-03-20 08:56:54] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 1 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 54 places in 312 ms of which 0 ms to minimize.
[2023-03-20 08:56:55] [INFO ] Deduced a trap composed of 43 places in 319 ms of which 1 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 63 places in 346 ms of which 2 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2023-03-20 08:56:56] [INFO ] Deduced a trap composed of 45 places in 339 ms of which 1 ms to minimize.
[2023-03-20 08:56:57] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 0 ms to minimize.
[2023-03-20 08:56:57] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 47 places in 344 ms of which 1 ms to minimize.
[2023-03-20 08:56:58] [INFO ] Deduced a trap composed of 49 places in 370 ms of which 1 ms to minimize.
[2023-03-20 08:56:59] [INFO ] Deduced a trap composed of 46 places in 313 ms of which 1 ms to minimize.
[2023-03-20 08:56:59] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 1 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 1 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 1 ms to minimize.
[2023-03-20 08:57:00] [INFO ] Deduced a trap composed of 56 places in 417 ms of which 1 ms to minimize.
[2023-03-20 08:57:01] [INFO ] Deduced a trap composed of 46 places in 430 ms of which 1 ms to minimize.
[2023-03-20 08:57:01] [INFO ] Deduced a trap composed of 61 places in 333 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.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-20 08:57:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:57:01] [INFO ] After 25243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 131 ms.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 232 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 706/1653 places, 956/1903 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-20 08:57:02] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:57:02] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:57:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:57:02] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:57:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 733 ms
[2023-03-20 08:57:03] [INFO ] After 1092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 08:57:03] [INFO ] After 1260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 29 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 704/706 places, 954/956 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 399901 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399901 steps, saw 392591 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-20 08:57:06] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-20 08:57:07] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:57:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-20 08:57:07] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-20 08:57:07] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-20 08:57:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 546 ms
[2023-03-20 08:57:08] [INFO ] After 895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-20 08:57:08] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 28 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 41 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-20 08:57:08] [INFO ] Invariant cache hit.
[2023-03-20 08:57:08] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-20 08:57:08] [INFO ] Invariant cache hit.
[2023-03-20 08:57:09] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2023-03-20 08:57:09] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-20 08:57:09] [INFO ] Invariant cache hit.
[2023-03-20 08:57:09] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1726 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 23 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 08:57:09] [INFO ] Invariant cache hit.
[2023-03-20 08:57:10] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:57:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-20 08:57:10] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-20 08:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-03-20 08:57:10] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 08:57:10] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 648 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 86 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:57:12] [INFO ] Computed 201 place invariants in 14 ms
[2023-03-20 08:57:12] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-20 08:57:12] [INFO ] Invariant cache hit.
[2023-03-20 08:57:14] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2401 ms to find 0 implicit places.
[2023-03-20 08:57:14] [INFO ] Invariant cache hit.
[2023-03-20 08:57:15] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3364 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 08:57:16] [INFO ] Invariant cache hit.
[2023-03-20 08:57:16] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 08:57:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 60 ms returned sat
[2023-03-20 08:57:17] [INFO ] After 1126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 1 ms to minimize.
[2023-03-20 08:57:18] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 1 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 1 ms to minimize.
[2023-03-20 08:57:19] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 1 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 38 places in 418 ms of which 1 ms to minimize.
[2023-03-20 08:57:20] [INFO ] Deduced a trap composed of 40 places in 429 ms of which 1 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 1 ms to minimize.
[2023-03-20 08:57:21] [INFO ] Deduced a trap composed of 19 places in 396 ms of which 0 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 48 places in 332 ms of which 1 ms to minimize.
[2023-03-20 08:57:22] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 19 places in 424 ms of which 1 ms to minimize.
[2023-03-20 08:57:23] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 1 ms to minimize.
[2023-03-20 08:57:24] [INFO ] Deduced a trap composed of 27 places in 435 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 40 places in 480 ms of which 1 ms to minimize.
[2023-03-20 08:57:25] [INFO ] Deduced a trap composed of 18 places in 473 ms of which 1 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 48 places in 468 ms of which 1 ms to minimize.
[2023-03-20 08:57:26] [INFO ] Deduced a trap composed of 22 places in 460 ms of which 1 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 30 places in 468 ms of which 1 ms to minimize.
[2023-03-20 08:57:27] [INFO ] Deduced a trap composed of 57 places in 426 ms of which 1 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 1 ms to minimize.
[2023-03-20 08:57:28] [INFO ] Deduced a trap composed of 50 places in 414 ms of which 1 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 67 places in 366 ms of which 1 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 49 places in 306 ms of which 1 ms to minimize.
[2023-03-20 08:57:29] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 1 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 1 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 1 ms to minimize.
[2023-03-20 08:57:30] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 1 ms to minimize.
[2023-03-20 08:57:31] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 1 ms to minimize.
[2023-03-20 08:57:31] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 1 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 51 places in 324 ms of which 1 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 41 places in 310 ms of which 1 ms to minimize.
[2023-03-20 08:57:32] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 1 ms to minimize.
[2023-03-20 08:57:33] [INFO ] Deduced a trap composed of 68 places in 392 ms of which 1 ms to minimize.
[2023-03-20 08:57:33] [INFO ] Deduced a trap composed of 57 places in 385 ms of which 1 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 56 places in 386 ms of which 1 ms to minimize.
[2023-03-20 08:57:34] [INFO ] Deduced a trap composed of 60 places in 421 ms of which 1 ms to minimize.
[2023-03-20 08:57:35] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 1 ms to minimize.
[2023-03-20 08:57:35] [INFO ] Deduced a trap composed of 59 places in 398 ms of which 1 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 81 places in 360 ms of which 1 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 42 places in 359 ms of which 1 ms to minimize.
[2023-03-20 08:57:36] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 1 ms to minimize.
[2023-03-20 08:57:37] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 1 ms to minimize.
[2023-03-20 08:57:37] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 1 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 1 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 57 places in 382 ms of which 1 ms to minimize.
[2023-03-20 08:57:38] [INFO ] Deduced a trap composed of 49 places in 337 ms of which 1 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 60 places in 303 ms of which 0 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 52 places in 304 ms of which 1 ms to minimize.
[2023-03-20 08:57:39] [INFO ] Deduced a trap composed of 59 places in 233 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 1 ms to minimize.
[2023-03-20 08:57:40] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 1 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 58 places in 313 ms of which 1 ms to minimize.
[2023-03-20 08:57:41] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 08:57:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:57:41] [INFO ] After 25242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 476 ms.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 290 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 706/1653 places, 956/1903 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-20 08:57:42] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-20 08:57:42] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:57:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:57:43] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:57:43] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-20 08:57:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 927 ms
[2023-03-20 08:57:44] [INFO ] After 1282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-20 08:57:44] [INFO ] After 1453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 38 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 704/706 places, 954/956 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 360846 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 360846 steps, saw 354259 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-20 08:57:47] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-20 08:57:47] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:57:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-20 08:57:47] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2023-03-20 08:57:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 590 ms
[2023-03-20 08:57:48] [INFO ] After 938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-20 08:57:48] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 30 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 43 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-20 08:57:48] [INFO ] Invariant cache hit.
[2023-03-20 08:57:49] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-20 08:57:49] [INFO ] Invariant cache hit.
[2023-03-20 08:57:49] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2023-03-20 08:57:50] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-20 08:57:50] [INFO ] Invariant cache hit.
[2023-03-20 08:57:50] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1757 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 23 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 08:57:50] [INFO ] Invariant cache hit.
[2023-03-20 08:57:50] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:57:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:57:50] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-20 08:57:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-20 08:57:51] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 08:57:51] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 631 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 33374 reset in 938 ms.
Product exploration explored 100000 steps with 33244 reset in 736 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1653 transition count 1903
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 104 Pre rules applied. Total rules applied 197 place count 1653 transition count 1953
Deduced a syphon composed of 301 places in 4 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 301 place count 1653 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 302 place count 1652 transition count 1952
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 1652 transition count 1952
Performed 645 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 945 places in 3 ms
Iterating global reduction 1 with 645 rules applied. Total rules applied 948 place count 1652 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Discarding 344 places :
Symmetric choice reduction at 1 with 344 rule applications. Total rules 1292 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 3 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 1636 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 3 ms
Applied a total of 1636 rules in 747 ms. Remains 1308 /1653 variables (removed 345) and now considering 1608/1903 (removed 295) transitions.
[2023-03-20 08:57:55] [INFO ] Redundant transitions in 195 ms returned [1607]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1607 rows 1308 cols
[2023-03-20 08:57:55] [INFO ] Computed 201 place invariants in 19 ms
[2023-03-20 08:57:56] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1308/1653 places, 1607/1903 transitions.
Deduced a syphon composed of 601 places in 2 ms
Applied a total of 0 rules in 43 ms. Remains 1308 /1308 variables (removed 0) and now considering 1607/1607 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1850 ms. Remains : 1308/1653 places, 1607/1903 transitions.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 51 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:57:56] [INFO ] Computed 201 place invariants in 14 ms
[2023-03-20 08:57:57] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-20 08:57:57] [INFO ] Invariant cache hit.
[2023-03-20 08:57:58] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2023-03-20 08:57:58] [INFO ] Invariant cache hit.
[2023-03-20 08:57:59] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3237 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-02 finished in 89949 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((X(p1)||p0)))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 105 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:58:00] [INFO ] Computed 201 place invariants in 14 ms
[2023-03-20 08:58:00] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-20 08:58:00] [INFO ] Invariant cache hit.
[2023-03-20 08:58:02] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2023-03-20 08:58:02] [INFO ] Invariant cache hit.
[2023-03-20 08:58:03] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3095 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s479 0) (EQ s482 0) (EQ s489 0)), p1:(EQ s1317 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10172 steps with 4 reset in 59 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-04 finished in 3278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 92 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:58:03] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 08:58:03] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-20 08:58:03] [INFO ] Invariant cache hit.
[2023-03-20 08:58:05] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2023-03-20 08:58:05] [INFO ] Invariant cache hit.
[2023-03-20 08:58:06] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3072 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 48875 steps with 23 reset in 274 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-05 finished in 3459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 402 place count 1461 transition count 1463
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 898 place count 1213 transition count 1463
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 909 place count 1202 transition count 1452
Iterating global reduction 2 with 11 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 920 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 2 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1914 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 703 transition count 953
Applied a total of 1916 rules in 265 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:58:07] [INFO ] Computed 201 place invariants in 16 ms
[2023-03-20 08:58:07] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-20 08:58:07] [INFO ] Invariant cache hit.
[2023-03-20 08:58:08] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
[2023-03-20 08:58:08] [INFO ] Redundant transitions in 151 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-20 08:58:08] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:58:08] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1832 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 164 reset in 467 ms.
Product exploration explored 100000 steps with 164 reset in 543 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 647 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=161 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-20 08:58:10] [INFO ] Invariant cache hit.
[2023-03-20 08:58:10] [INFO ] [Real]Absence check using 201 positive place invariants in 70 ms returned sat
[2023-03-20 08:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:58:11] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2023-03-20 08:58:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:58:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-20 08:58:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:58:12] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2023-03-20 08:58:13] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 98 ms.
[2023-03-20 08:58:26] [INFO ] Added : 625 causal constraints over 125 iterations in 13550 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 21 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:58:26] [INFO ] Invariant cache hit.
[2023-03-20 08:58:26] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-20 08:58:26] [INFO ] Invariant cache hit.
[2023-03-20 08:58:27] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-20 08:58:27] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-20 08:58:27] [INFO ] Invariant cache hit.
[2023-03-20 08:58:28] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1700 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 605 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=121 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2023-03-20 08:58:28] [INFO ] Invariant cache hit.
[2023-03-20 08:58:29] [INFO ] [Real]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-20 08:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 08:58:30] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2023-03-20 08:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 08:58:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 67 ms returned sat
[2023-03-20 08:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 08:58:31] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2023-03-20 08:58:31] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 80 ms.
[2023-03-20 08:58:45] [INFO ] Added : 565 causal constraints over 113 iterations in 13509 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 163 reset in 637 ms.
Product exploration explored 100000 steps with 163 reset in 629 ms.
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 25 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:58:46] [INFO ] Invariant cache hit.
[2023-03-20 08:58:46] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-20 08:58:46] [INFO ] Invariant cache hit.
[2023-03-20 08:58:47] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-20 08:58:47] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-20 08:58:47] [INFO ] Invariant cache hit.
[2023-03-20 08:58:48] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1655 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-07 finished in 41379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))||G(p2)))))'
Support contains 3 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1461 transition count 1461
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1211 transition count 1461
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 911 place count 1202 transition count 1452
Iterating global reduction 2 with 9 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 920 place count 1202 transition count 1451
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 1 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 1914 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 703 transition count 953
Applied a total of 1916 rules in 221 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:58:48] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:58:48] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-20 08:58:48] [INFO ] Invariant cache hit.
[2023-03-20 08:58:49] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-20 08:58:49] [INFO ] Redundant transitions in 188 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-20 08:58:49] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:58:50] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 22 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1882 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s71 1), p2:(EQ s5 0), p0:(EQ s205 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 149 reset in 606 ms.
Product exploration explored 100000 steps with 149 reset in 592 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:58:51] [INFO ] Invariant cache hit.
[2023-03-20 08:58:51] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:58:52] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-20 08:58:52] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2023-03-20 08:58:52] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-20 08:58:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 955 ms
[2023-03-20 08:58:53] [INFO ] After 1292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 08:58:53] [INFO ] After 1486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 703 transition count 952
Applied a total of 101 rules in 42 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 703/703 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4379 steps, run visited all 1 properties in 41 ms. (steps per millisecond=106 )
Probabilistic random walk after 4379 steps, saw 4228 distinct states, run finished after 42 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 28 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:58:54] [INFO ] Invariant cache hit.
[2023-03-20 08:58:54] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-20 08:58:54] [INFO ] Invariant cache hit.
[2023-03-20 08:58:55] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2023-03-20 08:58:55] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-20 08:58:55] [INFO ] Invariant cache hit.
[2023-03-20 08:58:55] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1638 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 08:58:56] [INFO ] Invariant cache hit.
[2023-03-20 08:58:56] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:58:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:58:56] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:58:56] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-20 08:58:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 833 ms
[2023-03-20 08:58:57] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-20 08:58:57] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 703 transition count 952
Applied a total of 101 rules in 62 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 703/703 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4379 steps, run visited all 1 properties in 41 ms. (steps per millisecond=106 )
Probabilistic random walk after 4379 steps, saw 4228 distinct states, run finished after 41 ms. (steps per millisecond=106 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 149 reset in 602 ms.
Product exploration explored 100000 steps with 150 reset in 622 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 39 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:58:59] [INFO ] Invariant cache hit.
[2023-03-20 08:59:00] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-20 08:59:00] [INFO ] Invariant cache hit.
[2023-03-20 08:59:00] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-20 08:59:01] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-20 08:59:01] [INFO ] Invariant cache hit.
[2023-03-20 08:59:01] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1803 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-10 finished in 13327 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((X(p0)&&(p1 U G(p2)))))'
Support contains 6 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 106 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:59:01] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 08:59:02] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-20 08:59:02] [INFO ] Invariant cache hit.
[2023-03-20 08:59:03] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
[2023-03-20 08:59:03] [INFO ] Invariant cache hit.
[2023-03-20 08:59:04] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3252 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s1311 1) (EQ s1315 1) (EQ s1322 1))) (EQ s423 1)), p1:(AND (EQ s1311 1) (EQ s1315 1) (EQ s1322 1)), p0:(OR (EQ s1336 1) (EQ s1048 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-11 finished in 3465 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((G(p2)&&p1))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1662 transition count 1712
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1462 transition count 1712
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1462 transition count 1463
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1213 transition count 1463
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 908 place count 1203 transition count 1453
Iterating global reduction 2 with 10 rules applied. Total rules applied 918 place count 1203 transition count 1453
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 918 place count 1203 transition count 1451
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1910 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1912 place count 705 transition count 955
Applied a total of 1912 rules in 190 ms. Remains 705 /1663 variables (removed 958) and now considering 955/1913 (removed 958) transitions.
// Phase 1: matrix 955 rows 705 cols
[2023-03-20 08:59:05] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:59:05] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-20 08:59:05] [INFO ] Invariant cache hit.
[2023-03-20 08:59:06] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-20 08:59:06] [INFO ] Redundant transitions in 183 ms returned [954]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 954 rows 705 cols
[2023-03-20 08:59:06] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:59:06] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1663 places, 954/1913 transitions.
Applied a total of 0 rules in 16 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1733 ms. Remains : 705/1663 places, 954/1913 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s671 1) (EQ s675 1) (EQ s684 1) (NEQ s403 1)), p2:(EQ s606 1), p0:(EQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 650 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-12 finished in 1905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))||G((p1 U p2))||X(X(p3))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 103 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-20 08:59:07] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-20 08:59:07] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-20 08:59:07] [INFO ] Invariant cache hit.
[2023-03-20 08:59:09] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2023-03-20 08:59:09] [INFO ] Invariant cache hit.
[2023-03-20 08:59:09] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3024 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p3), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 10}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(OR p2 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(EQ s1323 1), p2:(AND (EQ s379 1) (EQ s413 1) (EQ s435 1)), p1:(EQ s1360 1), p3:(AND (EQ s1323 1) (EQ s379 1) (EQ s413 1) (EQ s435 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-13 finished in 3422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 402 place count 1461 transition count 1462
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 900 place count 1212 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 910 place count 1202 transition count 1452
Iterating global reduction 2 with 10 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 920 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 3 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1914 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 703 transition count 953
Applied a total of 1916 rules in 227 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:59:10] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:59:10] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-20 08:59:10] [INFO ] Invariant cache hit.
[2023-03-20 08:59:11] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-20 08:59:11] [INFO ] Redundant transitions in 184 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-20 08:59:11] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:59:12] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 22 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1986 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 150 reset in 561 ms.
Product exploration explored 100000 steps with 149 reset in 675 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 29 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:59:14] [INFO ] Invariant cache hit.
[2023-03-20 08:59:14] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-20 08:59:14] [INFO ] Invariant cache hit.
[2023-03-20 08:59:15] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-20 08:59:15] [INFO ] Redundant transitions in 185 ms returned []
[2023-03-20 08:59:15] [INFO ] Invariant cache hit.
[2023-03-20 08:59:15] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1743 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 150 reset in 483 ms.
Product exploration explored 100000 steps with 150 reset in 529 ms.
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 08:59:17] [INFO ] Invariant cache hit.
[2023-03-20 08:59:17] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-20 08:59:17] [INFO ] Invariant cache hit.
[2023-03-20 08:59:18] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-20 08:59:18] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-20 08:59:18] [INFO ] Invariant cache hit.
[2023-03-20 08:59:18] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1596 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-14 finished in 8690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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((G(p0)||X((p1||X(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(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(F((p0||G(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' '!(F(G(p0)))'
[2023-03-20 08:59:19] [INFO ] Flatten gal took : 107 ms
[2023-03-20 08:59:19] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 08:59:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1663 places, 1913 transitions and 6520 arcs took 15 ms.
Total runtime 231426 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2713/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2713/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2713/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2713/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2713/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-050B-LTLFireability-01
Could not compute solution for formula : ShieldRVs-PT-050B-LTLFireability-02
Could not compute solution for formula : ShieldRVs-PT-050B-LTLFireability-07
Could not compute solution for formula : ShieldRVs-PT-050B-LTLFireability-10
Could not compute solution for formula : ShieldRVs-PT-050B-LTLFireability-14

BK_STOP 1679302763693

--------------------
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 ShieldRVs-PT-050B-LTLFireability-01
ltl formula formula --ltl=/tmp/2713/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 1663 places, 1913 transitions and 6520 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.290 real 0.080 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2713/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2713/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2713/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2713/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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 ShieldRVs-PT-050B-LTLFireability-02
ltl formula formula --ltl=/tmp/2713/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 1663 places, 1913 transitions and 6520 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.080 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2713/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2713/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2713/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2713/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVs-PT-050B-LTLFireability-07
ltl formula formula --ltl=/tmp/2713/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: =============================================================================
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 1663 places, 1913 transitions and 6520 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.260 real 0.120 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2713/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2713/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2713/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2713/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVs-PT-050B-LTLFireability-10
ltl formula formula --ltl=/tmp/2713/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: =============================================================================
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 1663 places, 1913 transitions and 6520 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.260 real 0.050 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2713/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2713/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2713/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2713/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 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:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldRVs-PT-050B-LTLFireability-14
ltl formula formula --ltl=/tmp/2713/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 1663 places, 1913 transitions and 6520 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.080 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2713/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2713/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2713/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2713/ltl_4_
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:
0: pnml2lts-mc(+0xa23f4) [0x5558a44a53f4]
1: pnml2lts-mc(+0xa2496) [0x5558a44a5496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f45639c1140]
3: pnml2lts-mc(+0x405be5) [0x5558a4808be5]
4: pnml2lts-mc(+0x16b3f9) [0x5558a456e3f9]
5: pnml2lts-mc(+0x164ac4) [0x5558a4567ac4]
6: pnml2lts-mc(+0x272e0a) [0x5558a4675e0a]
7: pnml2lts-mc(+0xb61f0) [0x5558a44b91f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f45638144d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f456381467a]
10: pnml2lts-mc(+0xa1581) [0x5558a44a4581]
11: pnml2lts-mc(+0xa1910) [0x5558a44a4910]
12: pnml2lts-mc(+0xa32a2) [0x5558a44a62a2]
13: pnml2lts-mc(+0xa50f4) [0x5558a44a80f4]
14: pnml2lts-mc(+0xa516b) [0x5558a44a816b]
15: pnml2lts-mc(+0x3f34b3) [0x5558a47f64b3]
16: pnml2lts-mc(+0x7c63d) [0x5558a447f63d]
17: pnml2lts-mc(+0x67d86) [0x5558a446ad86]
18: pnml2lts-mc(+0x60a8a) [0x5558a4463a8a]
19: pnml2lts-mc(+0x5eb15) [0x5558a4461b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f45637fcd0a]
21: pnml2lts-mc(+0x6075e) [0x5558a446375e]

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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r425-tajo-167905977800156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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