Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 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 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 868K 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 ShieldIIPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679269019075

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:37:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:37:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:37:02] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-19 23:37:02] [INFO ] Transformed 2503 places.
[2023-03-19 23:37:02] [INFO ] Transformed 2403 transitions.
[2023-03-19 23:37:02] [INFO ] Found NUPN structural information;
[2023-03-19 23:37:02] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-100A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 235 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:37:02] [INFO ] Computed 901 place invariants in 36 ms
[2023-03-19 23:37:04] [INFO ] Implicit Places using invariants in 1875 ms returned []
[2023-03-19 23:37:04] [INFO ] Invariant cache hit.
[2023-03-19 23:37:09] [INFO ] Implicit Places using invariants and state equation in 5441 ms returned []
Implicit Place search using SMT with State Equation took 7374 ms to find 0 implicit places.
[2023-03-19 23:37:09] [INFO ] Invariant cache hit.
[2023-03-19 23:37:12] [INFO ] Dead Transitions using invariants and state equation in 2609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10231 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 58 out of 2503 places after structural reductions.
[2023-03-19 23:37:13] [INFO ] Flatten gal took : 306 ms
[2023-03-19 23:37:13] [INFO ] Flatten gal took : 176 ms
[2023-03-19 23:37:13] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-19 23:37:16] [INFO ] Invariant cache hit.
[2023-03-19 23:37:18] [INFO ] [Real]Absence check using 901 positive place invariants in 434 ms returned sat
[2023-03-19 23:37:22] [INFO ] After 6263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 23:37:24] [INFO ] [Nat]Absence check using 901 positive place invariants in 369 ms returned sat
[2023-03-19 23:37:47] [INFO ] After 22953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 23:37:47] [INFO ] After 22975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-19 23:37:47] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 5251 ms.
Support contains 31 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 36 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 682 times.
Drop transitions removed 682 transitions
Iterating global reduction 0 with 682 rules applied. Total rules applied 686 place count 2501 transition count 2401
Applied a total of 686 rules in 404 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 46310 steps, run timeout after 3002 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46310 steps, saw 44127 distinct states, run finished after 3004 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:37:58] [INFO ] Computed 901 place invariants in 64 ms
[2023-03-19 23:37:59] [INFO ] [Real]Absence check using 893 positive place invariants in 217 ms returned sat
[2023-03-19 23:37:59] [INFO ] [Real]Absence check using 893 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-19 23:38:03] [INFO ] After 5036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 23:38:04] [INFO ] [Nat]Absence check using 893 positive place invariants in 254 ms returned sat
[2023-03-19 23:38:04] [INFO ] [Nat]Absence check using 893 positive and 8 generalized place invariants in 24 ms returned sat
[2023-03-19 23:38:28] [INFO ] After 23095ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 23:38:28] [INFO ] State equation strengthened by 4 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-19 23:38:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:38:28] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 31 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 143 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 93 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:38:28] [INFO ] Invariant cache hit.
[2023-03-19 23:38:32] [INFO ] Implicit Places using invariants in 3222 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3249 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 153 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3496 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 114168 steps, run timeout after 6029 ms. (steps per millisecond=18 ) properties seen :{0=1, 1=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 114168 steps, saw 109655 distinct states, run finished after 6029 ms. (steps per millisecond=18 ) properties seen :8
Running SMT prover for 3 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:38:40] [INFO ] Computed 900 place invariants in 60 ms
[2023-03-19 23:38:41] [INFO ] [Real]Absence check using 892 positive place invariants in 316 ms returned sat
[2023-03-19 23:38:41] [INFO ] [Real]Absence check using 892 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-19 23:38:43] [INFO ] After 3249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:38:44] [INFO ] [Nat]Absence check using 892 positive place invariants in 326 ms returned sat
[2023-03-19 23:38:44] [INFO ] [Nat]Absence check using 892 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-19 23:39:05] [INFO ] After 20554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:39:05] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 7 ms to minimize.
[2023-03-19 23:39:06] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
[2023-03-19 23:39:06] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-19 23:39:07] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 2 ms to minimize.
[2023-03-19 23:39:07] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2023-03-19 23:39:08] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 0 ms to minimize.
[2023-03-19 23:39:08] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:39:08] [INFO ] Deduced a trap composed of 5 places in 352 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-19 23:39:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:39:08] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 232 ms.
Support contains 10 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 2500 transition count 2401
Applied a total of 11 rules in 193 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 84 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:39:10] [INFO ] Computed 901 place invariants in 22 ms
[2023-03-19 23:39:12] [INFO ] Implicit Places using invariants in 2261 ms returned []
[2023-03-19 23:39:12] [INFO ] Invariant cache hit.
[2023-03-19 23:39:13] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 3112 ms to find 0 implicit places.
[2023-03-19 23:39:13] [INFO ] Invariant cache hit.
[2023-03-19 23:39:15] [INFO ] Dead Transitions using invariants and state equation in 2684 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5881 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 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 p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2150 0), p1:(OR (EQ s936 0) (EQ s940 0) (EQ s951 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33378 reset in 6077 ms.
Product exploration explored 100000 steps with 33300 reset in 6102 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 624 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:39:29] [INFO ] Invariant cache hit.
[2023-03-19 23:39:30] [INFO ] [Real]Absence check using 901 positive place invariants in 232 ms returned sat
[2023-03-19 23:39:32] [INFO ] After 2699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:39:33] [INFO ] [Nat]Absence check using 901 positive place invariants in 242 ms returned sat
[2023-03-19 23:39:34] [INFO ] After 1572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:39:35] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-19 23:39:35] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-19 23:39:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2023-03-19 23:39:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-19 23:39:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-19 23:39:36] [INFO ] After 2750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-19 23:39:36] [INFO ] After 4098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 332 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 411 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97467 steps, run timeout after 3003 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97467 steps, saw 95938 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:39:40] [INFO ] Computed 900 place invariants in 40 ms
[2023-03-19 23:39:41] [INFO ] [Real]Absence check using 897 positive place invariants in 193 ms returned sat
[2023-03-19 23:39:41] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 23:39:43] [INFO ] After 2378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:39:44] [INFO ] [Nat]Absence check using 897 positive place invariants in 218 ms returned sat
[2023-03-19 23:39:44] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:39:45] [INFO ] After 1394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:39:46] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2023-03-19 23:39:46] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 0 ms to minimize.
[2023-03-19 23:39:46] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-19 23:39:47] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2023-03-19 23:39:47] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:39:47] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2023-03-19 23:39:48] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 1 ms to minimize.
[2023-03-19 23:39:48] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-19 23:39:48] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-19 23:39:49] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2023-03-19 23:39:49] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2023-03-19 23:39:49] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 1 ms to minimize.
[2023-03-19 23:39:50] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 1 ms to minimize.
[2023-03-19 23:39:50] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 13 ms to minimize.
[2023-03-19 23:39:50] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:39:51] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 0 ms to minimize.
[2023-03-19 23:39:51] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2023-03-19 23:39:51] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 0 ms to minimize.
[2023-03-19 23:39:52] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 0 ms to minimize.
[2023-03-19 23:39:52] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 0 ms to minimize.
[2023-03-19 23:39:52] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 18 ms to minimize.
[2023-03-19 23:39:53] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 1 ms to minimize.
[2023-03-19 23:39:53] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-19 23:39:53] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:39:54] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 1 ms to minimize.
[2023-03-19 23:39:54] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:39:54] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 34 ms to minimize.
[2023-03-19 23:39:55] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:39:55] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2023-03-19 23:39:55] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9971 ms
[2023-03-19 23:39:55] [INFO ] After 11717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-19 23:39:56] [INFO ] After 12821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 112 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 86 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:39:56] [INFO ] Invariant cache hit.
[2023-03-19 23:39:59] [INFO ] Implicit Places using invariants in 2980 ms returned []
[2023-03-19 23:39:59] [INFO ] Invariant cache hit.
[2023-03-19 23:40:04] [INFO ] Implicit Places using invariants and state equation in 4858 ms returned []
Implicit Place search using SMT with State Equation took 7855 ms to find 0 implicit places.
[2023-03-19 23:40:04] [INFO ] Redundant transitions in 227 ms returned []
[2023-03-19 23:40:04] [INFO ] Invariant cache hit.
[2023-03-19 23:40:06] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9782 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 130 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 23:40:06] [INFO ] Invariant cache hit.
[2023-03-19 23:40:06] [INFO ] [Real]Absence check using 897 positive place invariants in 184 ms returned sat
[2023-03-19 23:40:06] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:40:09] [INFO ] After 2860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:40:09] [INFO ] [Nat]Absence check using 897 positive place invariants in 206 ms returned sat
[2023-03-19 23:40:09] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 23:40:12] [INFO ] After 2206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:40:12] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 0 ms to minimize.
[2023-03-19 23:40:12] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 ms to minimize.
[2023-03-19 23:40:13] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2023-03-19 23:40:13] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-19 23:40:14] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 0 ms to minimize.
[2023-03-19 23:40:14] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:40:14] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 1 ms to minimize.
[2023-03-19 23:40:15] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 11 ms to minimize.
[2023-03-19 23:40:15] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:40:15] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:40:16] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2023-03-19 23:40:16] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2023-03-19 23:40:16] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-19 23:40:16] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2023-03-19 23:40:17] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-19 23:40:17] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-19 23:40:17] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:40:18] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-19 23:40:18] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-19 23:40:18] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-19 23:40:18] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 40 ms to minimize.
[2023-03-19 23:40:19] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-19 23:40:19] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 0 ms to minimize.
[2023-03-19 23:40:19] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-19 23:40:19] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:40:19] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7537 ms
[2023-03-19 23:40:19] [INFO ] After 9989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3338 ms.
[2023-03-19 23:40:23] [INFO ] After 14158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 516 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 108 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:40:24] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-19 23:40:26] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2023-03-19 23:40:26] [INFO ] Invariant cache hit.
[2023-03-19 23:40:30] [INFO ] Implicit Places using invariants and state equation in 4560 ms returned []
Implicit Place search using SMT with State Equation took 6426 ms to find 0 implicit places.
[2023-03-19 23:40:30] [INFO ] Invariant cache hit.
[2023-03-19 23:40:32] [INFO ] Dead Transitions using invariants and state equation in 1535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8072 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 427 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:40:33] [INFO ] Invariant cache hit.
[2023-03-19 23:40:34] [INFO ] [Real]Absence check using 901 positive place invariants in 200 ms returned sat
[2023-03-19 23:40:36] [INFO ] After 2504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:40:37] [INFO ] [Nat]Absence check using 901 positive place invariants in 255 ms returned sat
[2023-03-19 23:40:38] [INFO ] After 1582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:40:39] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-19 23:40:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-19 23:40:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 592 ms
[2023-03-19 23:40:39] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-19 23:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-19 23:40:40] [INFO ] After 2818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 422 ms.
[2023-03-19 23:40:40] [INFO ] After 4230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 390 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 514 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 104471 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104471 steps, saw 102859 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:40:45] [INFO ] Computed 900 place invariants in 52 ms
[2023-03-19 23:40:45] [INFO ] [Real]Absence check using 897 positive place invariants in 304 ms returned sat
[2023-03-19 23:40:45] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:40:47] [INFO ] After 2501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:40:48] [INFO ] [Nat]Absence check using 897 positive place invariants in 205 ms returned sat
[2023-03-19 23:40:48] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 23:40:50] [INFO ] After 1622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:40:50] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:40:50] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
[2023-03-19 23:40:51] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2023-03-19 23:40:51] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:40:51] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2023-03-19 23:40:52] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2023-03-19 23:40:52] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 5 places in 475 ms of which 1 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 0 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 1 ms to minimize.
[2023-03-19 23:40:53] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:40:54] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 1 ms to minimize.
[2023-03-19 23:40:54] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:40:54] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2023-03-19 23:40:55] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-19 23:40:55] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-19 23:40:55] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-19 23:40:56] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-19 23:40:56] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2023-03-19 23:40:56] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 0 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 0 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2023-03-19 23:40:57] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-19 23:40:58] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-19 23:40:59] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2023-03-19 23:40:59] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9223 ms
[2023-03-19 23:40:59] [INFO ] After 11152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-19 23:40:59] [INFO ] After 12288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 163 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 95 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 125 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:41:00] [INFO ] Invariant cache hit.
[2023-03-19 23:41:02] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2023-03-19 23:41:02] [INFO ] Invariant cache hit.
[2023-03-19 23:41:07] [INFO ] Implicit Places using invariants and state equation in 5029 ms returned []
Implicit Place search using SMT with State Equation took 6871 ms to find 0 implicit places.
[2023-03-19 23:41:07] [INFO ] Redundant transitions in 266 ms returned []
[2023-03-19 23:41:07] [INFO ] Invariant cache hit.
[2023-03-19 23:41:09] [INFO ] Dead Transitions using invariants and state equation in 2458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9737 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 156 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 23:41:10] [INFO ] Invariant cache hit.
[2023-03-19 23:41:10] [INFO ] [Real]Absence check using 897 positive place invariants in 194 ms returned sat
[2023-03-19 23:41:10] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 23:41:12] [INFO ] After 2291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:41:12] [INFO ] [Nat]Absence check using 897 positive place invariants in 168 ms returned sat
[2023-03-19 23:41:12] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:41:15] [INFO ] After 2267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:41:15] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 0 ms to minimize.
[2023-03-19 23:41:16] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:41:16] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:41:16] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-19 23:41:16] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:41:17] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:41:17] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-19 23:41:17] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-19 23:41:17] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-19 23:41:17] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-19 23:41:18] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2023-03-19 23:41:18] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-19 23:41:18] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2023-03-19 23:41:19] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2023-03-19 23:41:19] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-19 23:41:19] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2023-03-19 23:41:20] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 0 ms to minimize.
[2023-03-19 23:41:20] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:41:20] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:41:20] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:41:21] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-19 23:41:21] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:41:21] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:41:21] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:41:22] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:41:22] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6993 ms
[2023-03-19 23:41:22] [INFO ] After 9585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3272 ms.
[2023-03-19 23:41:25] [INFO ] After 13568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 514 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33276 reset in 6270 ms.
Product exploration explored 100000 steps with 33468 reset in 6740 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 154 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:41:40] [INFO ] Computed 901 place invariants in 24 ms
[2023-03-19 23:41:42] [INFO ] Implicit Places using invariants in 2361 ms returned []
[2023-03-19 23:41:42] [INFO ] Invariant cache hit.
[2023-03-19 23:41:47] [INFO ] Implicit Places using invariants and state equation in 4532 ms returned []
Implicit Place search using SMT with State Equation took 6896 ms to find 0 implicit places.
[2023-03-19 23:41:47] [INFO ] Invariant cache hit.
[2023-03-19 23:41:50] [INFO ] Dead Transitions using invariants and state equation in 2765 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9817 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-01 finished in 160685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 232 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:41:50] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-19 23:41:52] [INFO ] Implicit Places using invariants in 2189 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2192 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 97 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2521 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2154 1) (EQ s2169 1)), p1:(NEQ s2315 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 188 reset in 1748 ms.
Product exploration explored 100000 steps with 189 reset in 2294 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 523 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:41:58] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-19 23:42:02] [INFO ] [Real]Absence check using 900 positive place invariants in 1174 ms returned sat
[2023-03-19 23:42:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:42:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 96 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:42:13] [INFO ] Invariant cache hit.
[2023-03-19 23:42:16] [INFO ] Implicit Places using invariants in 2235 ms returned []
[2023-03-19 23:42:16] [INFO ] Invariant cache hit.
[2023-03-19 23:42:20] [INFO ] Implicit Places using invariants and state equation in 4315 ms returned []
Implicit Place search using SMT with State Equation took 6553 ms to find 0 implicit places.
[2023-03-19 23:42:20] [INFO ] Redundant transitions in 405 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-19 23:42:20] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-19 23:42:23] [INFO ] Dead Transitions using invariants and state equation in 2491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9670 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 533 steps, including 0 resets, run visited all 2 properties in 25 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 23:42:24] [INFO ] Invariant cache hit.
[2023-03-19 23:42:29] [INFO ] [Real]Absence check using 900 positive place invariants in 1369 ms returned sat
[2023-03-19 23:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:42:39] [INFO ] [Real]Absence check using state equation in 10480 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 186 reset in 1738 ms.
Product exploration explored 100000 steps with 188 reset in 1925 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:42:43] [INFO ] Invariant cache hit.
[2023-03-19 23:42:44] [INFO ] Implicit Places using invariants in 1344 ms returned []
[2023-03-19 23:42:44] [INFO ] Invariant cache hit.
[2023-03-19 23:42:49] [INFO ] Implicit Places using invariants and state equation in 4678 ms returned []
Implicit Place search using SMT with State Equation took 6063 ms to find 0 implicit places.
[2023-03-19 23:42:49] [INFO ] Redundant transitions in 307 ms returned []
[2023-03-19 23:42:50] [INFO ] Invariant cache hit.
[2023-03-19 23:42:52] [INFO ] Dead Transitions using invariants and state equation in 2486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8971 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-02 finished in 62182 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(G(!p0)) U (!p1&&F(!p2)))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:42:52] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-19 23:42:54] [INFO ] Implicit Places using invariants in 2174 ms returned []
[2023-03-19 23:42:54] [INFO ] Invariant cache hit.
[2023-03-19 23:42:59] [INFO ] Implicit Places using invariants and state equation in 4415 ms returned []
Implicit Place search using SMT with State Equation took 6606 ms to find 0 implicit places.
[2023-03-19 23:42:59] [INFO ] Invariant cache hit.
[2023-03-19 23:43:02] [INFO ] Dead Transitions using invariants and state equation in 2906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9593 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR p2 p1), (OR p1 p2), p0, p2]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1113 1) (EQ s1123 1) (EQ s1125 1)), p2:(AND (EQ s938 1) (EQ s946 1) (EQ s952 1)), p0:(OR (AND (EQ s1113 1) (EQ s1123 1) (EQ s1125 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8176 ms.
Product exploration explored 100000 steps with 50000 reset in 8392 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-03 finished in 26629 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)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&G(!p0))))))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 231 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:43:19] [INFO ] Computed 901 place invariants in 11 ms
[2023-03-19 23:43:25] [INFO ] Implicit Places using invariants in 5492 ms returned []
[2023-03-19 23:43:25] [INFO ] Invariant cache hit.
[2023-03-19 23:43:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:43:31] [INFO ] Implicit Places using invariants and state equation in 6339 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11836 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 127 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12195 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 268 ms :[p0, (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1462 1) (EQ s1495 1)), p1:(AND (EQ s6 1) (EQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 19 reset in 1719 ms.
Product exploration explored 100000 steps with 19 reset in 2009 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 767 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:43:37] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-19 23:43:37] [INFO ] [Real]Absence check using 900 positive place invariants in 296 ms returned sat
[2023-03-19 23:43:39] [INFO ] After 2577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:43:40] [INFO ] [Nat]Absence check using 900 positive place invariants in 189 ms returned sat
[2023-03-19 23:43:46] [INFO ] After 6403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:43:47] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2023-03-19 23:43:47] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2023-03-19 23:43:48] [INFO ] Deduced a trap composed of 11 places in 455 ms of which 0 ms to minimize.
[2023-03-19 23:43:48] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-19 23:43:48] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:43:49] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2023-03-19 23:43:49] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 0 ms to minimize.
[2023-03-19 23:43:50] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:43:50] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-19 23:43:50] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2023-03-19 23:43:51] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:43:51] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:43:51] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:43:52] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:43:52] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2023-03-19 23:43:52] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 1 ms to minimize.
[2023-03-19 23:43:53] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2023-03-19 23:43:53] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-19 23:43:53] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-19 23:43:53] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2023-03-19 23:43:54] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2023-03-19 23:43:54] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2023-03-19 23:43:54] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:43:55] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2023-03-19 23:43:55] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2023-03-19 23:43:55] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-19 23:43:56] [INFO ] Deduced a trap composed of 49 places in 385 ms of which 1 ms to minimize.
[2023-03-19 23:43:56] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 17726 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:44:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:44:04] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 629 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 151 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 114252 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{0=1}
Probabilistic random walk after 114252 steps, saw 111528 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:44:09] [INFO ] Computed 900 place invariants in 112 ms
[2023-03-19 23:44:09] [INFO ] [Real]Absence check using 898 positive place invariants in 315 ms returned sat
[2023-03-19 23:44:09] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 23:44:11] [INFO ] After 2562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:44:12] [INFO ] [Nat]Absence check using 898 positive place invariants in 195 ms returned sat
[2023-03-19 23:44:12] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-19 23:44:22] [INFO ] After 10894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 186 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 129833 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129833 steps, saw 126137 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:44:26] [INFO ] Invariant cache hit.
[2023-03-19 23:44:26] [INFO ] [Real]Absence check using 898 positive place invariants in 242 ms returned sat
[2023-03-19 23:44:26] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-19 23:44:28] [INFO ] After 2662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:44:29] [INFO ] [Nat]Absence check using 898 positive place invariants in 217 ms returned sat
[2023-03-19 23:44:29] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:44:39] [INFO ] After 11051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 136 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 148 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:44:40] [INFO ] Invariant cache hit.
[2023-03-19 23:44:43] [INFO ] Implicit Places using invariants in 2978 ms returned []
[2023-03-19 23:44:43] [INFO ] Invariant cache hit.
[2023-03-19 23:44:48] [INFO ] Implicit Places using invariants and state equation in 5547 ms returned []
Implicit Place search using SMT with State Equation took 8542 ms to find 0 implicit places.
[2023-03-19 23:44:48] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-19 23:44:48] [INFO ] Invariant cache hit.
[2023-03-19 23:44:51] [INFO ] Dead Transitions using invariants and state equation in 2634 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11437 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:44:51] [INFO ] Invariant cache hit.
[2023-03-19 23:44:53] [INFO ] [Real]Absence check using 898 positive place invariants in 1207 ms returned sat
[2023-03-19 23:44:53] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:44:54] [INFO ] After 3195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:44:55] [INFO ] [Nat]Absence check using 898 positive place invariants in 187 ms returned sat
[2023-03-19 23:44:55] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-19 23:45:05] [INFO ] After 10968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (OR p1 p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 13 factoid took 798 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 172 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:45:06] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-19 23:45:09] [INFO ] Implicit Places using invariants in 2119 ms returned []
[2023-03-19 23:45:09] [INFO ] Invariant cache hit.
[2023-03-19 23:45:14] [INFO ] Implicit Places using invariants and state equation in 5013 ms returned []
Implicit Place search using SMT with State Equation took 7138 ms to find 0 implicit places.
[2023-03-19 23:45:14] [INFO ] Redundant transitions in 252 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-19 23:45:14] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-19 23:45:15] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9031 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 459 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:45:17] [INFO ] Invariant cache hit.
[2023-03-19 23:45:18] [INFO ] [Real]Absence check using 900 positive place invariants in 266 ms returned sat
[2023-03-19 23:45:20] [INFO ] After 2633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:45:20] [INFO ] [Nat]Absence check using 900 positive place invariants in 345 ms returned sat
[2023-03-19 23:45:38] [INFO ] After 17892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:45:42] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2023-03-19 23:45:45] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2519 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:45:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:45:45] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 340 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2400
Applied a total of 696 rules in 191 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 124453 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{0=1}
Probabilistic random walk after 124453 steps, saw 121141 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-19 23:45:49] [INFO ] Computed 900 place invariants in 38 ms
[2023-03-19 23:45:50] [INFO ] [Real]Absence check using 898 positive place invariants in 207 ms returned sat
[2023-03-19 23:45:50] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:45:51] [INFO ] After 2348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:45:52] [INFO ] [Nat]Absence check using 898 positive place invariants in 200 ms returned sat
[2023-03-19 23:45:52] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:46:02] [INFO ] After 11428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 247 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 123355 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123355 steps, saw 120113 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:46:06] [INFO ] Invariant cache hit.
[2023-03-19 23:46:07] [INFO ] [Real]Absence check using 898 positive place invariants in 186 ms returned sat
[2023-03-19 23:46:07] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 23:46:09] [INFO ] After 3007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:46:10] [INFO ] [Nat]Absence check using 898 positive place invariants in 302 ms returned sat
[2023-03-19 23:46:10] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-19 23:46:20] [INFO ] After 11036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 100 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 252 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:46:21] [INFO ] Invariant cache hit.
[2023-03-19 23:46:22] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2023-03-19 23:46:22] [INFO ] Invariant cache hit.
[2023-03-19 23:46:28] [INFO ] Implicit Places using invariants and state equation in 5392 ms returned []
Implicit Place search using SMT with State Equation took 7292 ms to find 0 implicit places.
[2023-03-19 23:46:28] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-19 23:46:28] [INFO ] Invariant cache hit.
[2023-03-19 23:46:29] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9044 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 102 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:46:29] [INFO ] Invariant cache hit.
[2023-03-19 23:46:30] [INFO ] [Real]Absence check using 898 positive place invariants in 216 ms returned sat
[2023-03-19 23:46:30] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:46:32] [INFO ] After 2352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:46:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 183 ms returned sat
[2023-03-19 23:46:32] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:46:43] [INFO ] After 10915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 512 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 194 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 19 reset in 1893 ms.
Product exploration explored 100000 steps with 19 reset in 2294 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 94 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-19 23:46:48] [INFO ] Computed 900 place invariants in 11 ms
[2023-03-19 23:46:50] [INFO ] Implicit Places using invariants in 1613 ms returned []
[2023-03-19 23:46:50] [INFO ] Invariant cache hit.
[2023-03-19 23:46:55] [INFO ] Implicit Places using invariants and state equation in 5104 ms returned []
Implicit Place search using SMT with State Equation took 6739 ms to find 0 implicit places.
[2023-03-19 23:46:55] [INFO ] Redundant transitions in 317 ms returned []
[2023-03-19 23:46:55] [INFO ] Invariant cache hit.
[2023-03-19 23:47:00] [INFO ] Dead Transitions using invariants and state equation in 5047 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12206 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-06 finished in 221577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G((p1||F(p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 114 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:47:01] [INFO ] Computed 901 place invariants in 27 ms
[2023-03-19 23:47:03] [INFO ] Implicit Places using invariants in 2884 ms returned []
[2023-03-19 23:47:03] [INFO ] Invariant cache hit.
[2023-03-19 23:47:09] [INFO ] Implicit Places using invariants and state equation in 5862 ms returned []
Implicit Place search using SMT with State Equation took 8750 ms to find 0 implicit places.
[2023-03-19 23:47:09] [INFO ] Invariant cache hit.
[2023-03-19 23:47:12] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11143 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1927 ms.
Product exploration explored 100000 steps with 29 reset in 2275 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 584 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1935 steps, including 0 resets, run visited all 2 properties in 119 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-19 23:47:18] [INFO ] Invariant cache hit.
[2023-03-19 23:47:22] [INFO ] [Real]Absence check using 901 positive place invariants in 1032 ms returned sat
[2023-03-19 23:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:47:33] [INFO ] [Real]Absence check using state equation in 11132 ms returned sat
[2023-03-19 23:47:35] [INFO ] Deduced a trap composed of 3 places in 2448 ms of which 3 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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:47:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 34 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 213 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:47:36] [INFO ] Computed 901 place invariants in 11 ms
[2023-03-19 23:47:38] [INFO ] Implicit Places using invariants in 2215 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2220 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 143 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2576 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1908 steps, including 0 resets, run visited all 2 properties in 94 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:47:39] [INFO ] Computed 900 place invariants in 12 ms
[2023-03-19 23:47:43] [INFO ] [Real]Absence check using 900 positive place invariants in 1085 ms returned sat
[2023-03-19 23:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:47:54] [INFO ] [Real]Absence check using state equation in 10924 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 29 reset in 2107 ms.
Product exploration explored 100000 steps with 30 reset in 2286 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 131 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:47:59] [INFO ] Computed 900 place invariants in 8 ms
[2023-03-19 23:48:01] [INFO ] Implicit Places using invariants in 1651 ms returned []
[2023-03-19 23:48:01] [INFO ] Invariant cache hit.
[2023-03-19 23:48:05] [INFO ] Implicit Places using invariants and state equation in 3973 ms returned []
Implicit Place search using SMT with State Equation took 5626 ms to find 0 implicit places.
[2023-03-19 23:48:05] [INFO ] Redundant transitions in 627 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-19 23:48:05] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-19 23:48:07] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2500 places, 2399/2401 transitions.
Applied a total of 0 rules in 104 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8006 ms. Remains : 2499/2500 places, 2399/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-07 finished in 66733 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(!F(p0)) U p1)))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 120 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:48:07] [INFO ] Computed 901 place invariants in 11 ms
[2023-03-19 23:48:10] [INFO ] Implicit Places using invariants in 2463 ms returned []
[2023-03-19 23:48:10] [INFO ] Invariant cache hit.
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants and state equation in 5647 ms returned []
Implicit Place search using SMT with State Equation took 8123 ms to find 0 implicit places.
[2023-03-19 23:48:15] [INFO ] Invariant cache hit.
[2023-03-19 23:48:18] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10531 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 202 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s486 1) (EQ s490 1) (EQ s502 1)), p1:(AND (EQ s786 1) (EQ s790 1) (EQ s802 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3990 steps with 0 reset in 64 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-08 finished in 10845 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(X(G(p0)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 100 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:48:18] [INFO ] Invariant cache hit.
[2023-03-19 23:48:20] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2023-03-19 23:48:20] [INFO ] Invariant cache hit.
[2023-03-19 23:48:26] [INFO ] Implicit Places using invariants and state equation in 5772 ms returned []
Implicit Place search using SMT with State Equation took 7483 ms to find 0 implicit places.
[2023-03-19 23:48:26] [INFO ] Invariant cache hit.
[2023-03-19 23:48:28] [INFO ] Dead Transitions using invariants and state equation in 2270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9868 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s738 0) (EQ s746 0) (EQ s750 0) (EQ s2408 0) (EQ s2423 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 2051 ms.
Product exploration explored 100000 steps with 19 reset in 1979 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104899 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104899 steps, saw 98298 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:48:36] [INFO ] Invariant cache hit.
[2023-03-19 23:48:37] [INFO ] [Real]Absence check using 901 positive place invariants in 204 ms returned sat
[2023-03-19 23:48:38] [INFO ] After 2336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:48:39] [INFO ] [Nat]Absence check using 901 positive place invariants in 274 ms returned sat
[2023-03-19 23:48:44] [INFO ] After 4796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:48:48] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2023-03-19 23:48:48] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-19 23:48:49] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 1 ms to minimize.
[2023-03-19 23:48:49] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2023-03-19 23:48:49] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:48:50] [INFO ] Deduced a trap composed of 11 places in 443 ms of which 1 ms to minimize.
[2023-03-19 23:48:51] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 1 ms to minimize.
[2023-03-19 23:48:51] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 1 ms to minimize.
[2023-03-19 23:48:51] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 14 ms to minimize.
[2023-03-19 23:48:52] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 1 ms to minimize.
[2023-03-19 23:48:52] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2023-03-19 23:48:52] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-19 23:48:53] [INFO ] Deduced a trap composed of 19 places in 436 ms of which 1 ms to minimize.
[2023-03-19 23:48:53] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 0 ms to minimize.
[2023-03-19 23:48:54] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2023-03-19 23:48:54] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2023-03-19 23:48:54] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 0 ms to minimize.
[2023-03-19 23:48:55] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 2 ms to minimize.
[2023-03-19 23:48:55] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2023-03-19 23:48:56] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:48:56] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-19 23:48:56] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2023-03-19 23:48:57] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2023-03-19 23:48:57] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-19 23:48:57] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:48:57] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 1 ms to minimize.
[2023-03-19 23:48:58] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2023-03-19 23:48:58] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:48:58] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2023-03-19 23:48:59] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:48:59] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2023-03-19 23:48:59] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-19 23:49:00] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:49:00] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:49:00] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 12902 ms
[2023-03-19 23:49:00] [INFO ] After 21222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2181 ms.
[2023-03-19 23:49:02] [INFO ] After 24224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 290 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 280 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 137373 steps, run timeout after 3002 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137373 steps, saw 135423 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:49:06] [INFO ] Computed 901 place invariants in 46 ms
[2023-03-19 23:49:07] [INFO ] [Real]Absence check using 898 positive place invariants in 203 ms returned sat
[2023-03-19 23:49:07] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:49:09] [INFO ] After 2368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:49:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 224 ms returned sat
[2023-03-19 23:49:09] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 23:49:20] [INFO ] After 11076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 153 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 111 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:49:20] [INFO ] Invariant cache hit.
[2023-03-19 23:49:22] [INFO ] Implicit Places using invariants in 1869 ms returned []
[2023-03-19 23:49:22] [INFO ] Invariant cache hit.
[2023-03-19 23:49:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:49:29] [INFO ] Implicit Places using invariants and state equation in 7510 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9418 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 110 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9640 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 157617 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157617 steps, saw 155431 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:49:33] [INFO ] Computed 900 place invariants in 38 ms
[2023-03-19 23:49:34] [INFO ] [Real]Absence check using 897 positive place invariants in 199 ms returned sat
[2023-03-19 23:49:34] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:49:35] [INFO ] After 2339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:49:36] [INFO ] [Nat]Absence check using 897 positive place invariants in 319 ms returned sat
[2023-03-19 23:49:36] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:49:45] [INFO ] After 9148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:49:54] [INFO ] After 18167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 23:49:54] [INFO ] After 19040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 155 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 157 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:49:55] [INFO ] Invariant cache hit.
[2023-03-19 23:49:57] [INFO ] Implicit Places using invariants in 2679 ms returned []
[2023-03-19 23:49:57] [INFO ] Invariant cache hit.
[2023-03-19 23:50:03] [INFO ] Implicit Places using invariants and state equation in 5577 ms returned []
Implicit Place search using SMT with State Equation took 8284 ms to find 0 implicit places.
[2023-03-19 23:50:03] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-19 23:50:03] [INFO ] Invariant cache hit.
[2023-03-19 23:50:05] [INFO ] Dead Transitions using invariants and state equation in 2141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10649 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 108 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:50:05] [INFO ] Invariant cache hit.
[2023-03-19 23:50:06] [INFO ] [Real]Absence check using 897 positive place invariants in 173 ms returned sat
[2023-03-19 23:50:06] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 23:50:07] [INFO ] After 1991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:50:08] [INFO ] [Nat]Absence check using 897 positive place invariants in 243 ms returned sat
[2023-03-19 23:50:08] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:50:13] [INFO ] After 4495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:50:22] [INFO ] After 13537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 23:50:22] [INFO ] After 14243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 89 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:50:22] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-19 23:50:24] [INFO ] Implicit Places using invariants in 1725 ms returned []
[2023-03-19 23:50:24] [INFO ] Invariant cache hit.
[2023-03-19 23:50:29] [INFO ] Implicit Places using invariants and state equation in 4464 ms returned []
Implicit Place search using SMT with State Equation took 6232 ms to find 0 implicit places.
[2023-03-19 23:50:29] [INFO ] Invariant cache hit.
[2023-03-19 23:50:30] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7803 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 114743 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114743 steps, saw 107289 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:50:34] [INFO ] Invariant cache hit.
[2023-03-19 23:50:34] [INFO ] [Real]Absence check using 901 positive place invariants in 182 ms returned sat
[2023-03-19 23:50:36] [INFO ] After 2147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:50:36] [INFO ] [Nat]Absence check using 901 positive place invariants in 182 ms returned sat
[2023-03-19 23:50:42] [INFO ] After 5374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:50:45] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2023-03-19 23:50:46] [INFO ] Deduced a trap composed of 9 places in 472 ms of which 1 ms to minimize.
[2023-03-19 23:50:46] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2023-03-19 23:50:47] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 1 ms to minimize.
[2023-03-19 23:50:47] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2023-03-19 23:50:47] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 0 ms to minimize.
[2023-03-19 23:50:48] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 12 ms to minimize.
[2023-03-19 23:50:48] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-19 23:50:49] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2023-03-19 23:50:49] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 0 ms to minimize.
[2023-03-19 23:50:49] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-19 23:50:50] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-19 23:50:50] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 0 ms to minimize.
[2023-03-19 23:50:50] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:50:51] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 1 ms to minimize.
[2023-03-19 23:50:51] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 0 ms to minimize.
[2023-03-19 23:50:52] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 0 ms to minimize.
[2023-03-19 23:50:52] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:50:52] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 0 ms to minimize.
[2023-03-19 23:50:53] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 0 ms to minimize.
[2023-03-19 23:50:53] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-19 23:50:53] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:50:53] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2023-03-19 23:50:54] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:50:54] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-19 23:50:54] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:50:56] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 0 ms to minimize.
[2023-03-19 23:50:56] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-19 23:50:56] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-19 23:50:56] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:50:57] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-19 23:50:57] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 11898 ms
[2023-03-19 23:50:57] [INFO ] After 20355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2155 ms.
[2023-03-19 23:50:59] [INFO ] After 23119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 289 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 320 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154001 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154001 steps, saw 151881 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:51:03] [INFO ] Computed 901 place invariants in 38 ms
[2023-03-19 23:51:04] [INFO ] [Real]Absence check using 898 positive place invariants in 341 ms returned sat
[2023-03-19 23:51:04] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:51:05] [INFO ] After 2197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:51:06] [INFO ] [Nat]Absence check using 898 positive place invariants in 235 ms returned sat
[2023-03-19 23:51:06] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:51:16] [INFO ] After 10998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 164 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 71 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:51:16] [INFO ] Invariant cache hit.
[2023-03-19 23:51:19] [INFO ] Implicit Places using invariants in 3057 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3061 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 125 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3257 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 141056 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141056 steps, saw 139066 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:51:23] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-19 23:51:24] [INFO ] [Real]Absence check using 897 positive place invariants in 254 ms returned sat
[2023-03-19 23:51:24] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:51:25] [INFO ] After 2527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:51:26] [INFO ] [Nat]Absence check using 897 positive place invariants in 279 ms returned sat
[2023-03-19 23:51:26] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 14 ms returned sat
[2023-03-19 23:51:36] [INFO ] After 9330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:51:45] [INFO ] After 18354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 23:51:45] [INFO ] After 19154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 280 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 141 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:51:45] [INFO ] Invariant cache hit.
[2023-03-19 23:51:49] [INFO ] Implicit Places using invariants in 3558 ms returned []
[2023-03-19 23:51:49] [INFO ] Invariant cache hit.
[2023-03-19 23:51:56] [INFO ] Implicit Places using invariants and state equation in 7163 ms returned []
Implicit Place search using SMT with State Equation took 10759 ms to find 0 implicit places.
[2023-03-19 23:51:56] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-19 23:51:56] [INFO ] Invariant cache hit.
[2023-03-19 23:51:58] [INFO ] Dead Transitions using invariants and state equation in 2438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13491 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 133 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:51:59] [INFO ] Invariant cache hit.
[2023-03-19 23:51:59] [INFO ] [Real]Absence check using 897 positive place invariants in 183 ms returned sat
[2023-03-19 23:51:59] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 43 ms returned sat
[2023-03-19 23:52:01] [INFO ] After 2403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:52:02] [INFO ] [Nat]Absence check using 897 positive place invariants in 196 ms returned sat
[2023-03-19 23:52:02] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-19 23:52:06] [INFO ] After 4392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:52:15] [INFO ] After 13416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 23:52:15] [INFO ] After 14052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1880 ms.
Product exploration explored 100000 steps with 19 reset in 2244 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 19 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 12 ms
Applied a total of 2 rules in 524 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:52:21] [INFO ] Redundant transitions in 425 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-19 23:52:21] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-19 23:52:25] [INFO ] Dead Transitions using invariants and state equation in 3158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 12 ms
Applied a total of 0 rules in 118 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4260 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 71 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:52:25] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-19 23:52:29] [INFO ] Implicit Places using invariants in 3950 ms returned []
[2023-03-19 23:52:29] [INFO ] Invariant cache hit.
[2023-03-19 23:52:33] [INFO ] Implicit Places using invariants and state equation in 4712 ms returned []
Implicit Place search using SMT with State Equation took 8694 ms to find 0 implicit places.
[2023-03-19 23:52:33] [INFO ] Invariant cache hit.
[2023-03-19 23:52:36] [INFO ] Dead Transitions using invariants and state equation in 2118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10885 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-09 finished in 257800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X(X(G(p1))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:52:36] [INFO ] Invariant cache hit.
[2023-03-19 23:52:38] [INFO ] Implicit Places using invariants in 2460 ms returned []
[2023-03-19 23:52:38] [INFO ] Invariant cache hit.
[2023-03-19 23:52:44] [INFO ] Implicit Places using invariants and state equation in 5544 ms returned []
Implicit Place search using SMT with State Equation took 8033 ms to find 0 implicit places.
[2023-03-19 23:52:44] [INFO ] Invariant cache hit.
[2023-03-19 23:52:46] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9964 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1164 1) (EQ s1185 1) (EQ s608 1) (EQ s622 1) (EQ s2287 1) (EQ s2320 1)), p0:(AND (EQ s608 1) (EQ s622 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3822 steps with 0 reset in 110 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-10 finished in 10315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||F(p1)) U p2)||G(F(p3)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 98 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:52:46] [INFO ] Invariant cache hit.
[2023-03-19 23:52:48] [INFO ] Implicit Places using invariants in 2035 ms returned []
[2023-03-19 23:52:48] [INFO ] Invariant cache hit.
[2023-03-19 23:52:53] [INFO ] Implicit Places using invariants and state equation in 4638 ms returned []
Implicit Place search using SMT with State Equation took 6705 ms to find 0 implicit places.
[2023-03-19 23:52:53] [INFO ] Invariant cache hit.
[2023-03-19 23:52:55] [INFO ] Dead Transitions using invariants and state equation in 2479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9300 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s16 1)), p3:(OR (EQ s6 0) (EQ s16 0) (EQ s1358 0) (EQ s1373 0)), p0:(AND (EQ s1358 1) (EQ s1373 1)), p1:(EQ s1325 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 1763 ms.
Product exploration explored 100000 steps with 33 reset in 2106 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 430 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:53:01] [INFO ] Invariant cache hit.
[2023-03-19 23:53:02] [INFO ] [Real]Absence check using 901 positive place invariants in 223 ms returned sat
[2023-03-19 23:53:04] [INFO ] After 2450ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-19 23:53:04] [INFO ] [Nat]Absence check using 901 positive place invariants in 229 ms returned sat
[2023-03-19 23:53:11] [INFO ] After 6969ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-19 23:53:12] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2023-03-19 23:53:12] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 2 ms to minimize.
[2023-03-19 23:53:13] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-19 23:53:13] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:53:13] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:53:14] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 0 ms to minimize.
[2023-03-19 23:53:14] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2023-03-19 23:53:14] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 11 ms to minimize.
[2023-03-19 23:53:15] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:53:16] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-19 23:53:17] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-19 23:53:17] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2023-03-19 23:53:17] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 10 ms to minimize.
[2023-03-19 23:53:17] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-19 23:53:18] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-19 23:53:18] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-19 23:53:18] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2023-03-19 23:53:18] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6330 ms
[2023-03-19 23:53:27] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 0 ms to minimize.
[2023-03-19 23:53:29] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2543 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:53:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:53:29] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 936 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 424 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 97237 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97237 steps, saw 95711 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:53:34] [INFO ] Computed 901 place invariants in 39 ms
[2023-03-19 23:53:34] [INFO ] [Real]Absence check using 899 positive place invariants in 238 ms returned sat
[2023-03-19 23:53:34] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:53:36] [INFO ] After 2392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:53:37] [INFO ] [Nat]Absence check using 899 positive place invariants in 292 ms returned sat
[2023-03-19 23:53:37] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-19 23:53:47] [INFO ] After 10419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:53:54] [INFO ] After 6269ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:54] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 13 ms to minimize.
[2023-03-19 23:53:55] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 17 ms to minimize.
[2023-03-19 23:53:59] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 0 ms to minimize.
[2023-03-19 23:53:59] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-19 23:54:00] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2023-03-19 23:54:00] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-19 23:54:01] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 7368 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:54:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:54:01] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 181 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 105 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:54:01] [INFO ] Invariant cache hit.
[2023-03-19 23:54:04] [INFO ] Implicit Places using invariants in 2476 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2500 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 103 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2700 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 111396 steps, run timeout after 3004 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111396 steps, saw 109696 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:54:08] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-19 23:54:08] [INFO ] [Real]Absence check using 898 positive place invariants in 272 ms returned sat
[2023-03-19 23:54:08] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 23:54:10] [INFO ] After 2431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:54:11] [INFO ] [Nat]Absence check using 898 positive place invariants in 197 ms returned sat
[2023-03-19 23:54:11] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:54:21] [INFO ] After 10425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:54:23] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 0 ms to minimize.
[2023-03-19 23:54:23] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-19 23:54:23] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2023-03-19 23:54:24] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 0 ms to minimize.
[2023-03-19 23:54:24] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 0 ms to minimize.
[2023-03-19 23:54:24] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 0 ms to minimize.
[2023-03-19 23:54:25] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:54:25] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-19 23:54:25] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2023-03-19 23:54:26] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 0 ms to minimize.
[2023-03-19 23:54:26] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2023-03-19 23:54:27] [INFO ] Deduced a trap composed of 8 places in 480 ms of which 0 ms to minimize.
[2023-03-19 23:54:27] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2023-03-19 23:54:27] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-19 23:54:28] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:54:28] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-19 23:54:28] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 0 ms to minimize.
[2023-03-19 23:54:28] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2023-03-19 23:54:31] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 13 ms to minimize.
[2023-03-19 23:54:31] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-19 23:54:35] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 12771 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:54:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:54:35] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 278 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 215 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:54:36] [INFO ] Invariant cache hit.
[2023-03-19 23:54:37] [INFO ] Implicit Places using invariants in 1615 ms returned []
[2023-03-19 23:54:37] [INFO ] Invariant cache hit.
[2023-03-19 23:54:44] [INFO ] Implicit Places using invariants and state equation in 6750 ms returned []
Implicit Place search using SMT with State Equation took 8368 ms to find 0 implicit places.
[2023-03-19 23:54:44] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-19 23:54:44] [INFO ] Invariant cache hit.
[2023-03-19 23:54:47] [INFO ] Dead Transitions using invariants and state equation in 2523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11211 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 736 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 91 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:54:48] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-19 23:54:50] [INFO ] Implicit Places using invariants in 2057 ms returned []
[2023-03-19 23:54:50] [INFO ] Invariant cache hit.
[2023-03-19 23:54:55] [INFO ] Implicit Places using invariants and state equation in 4830 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
[2023-03-19 23:54:55] [INFO ] Invariant cache hit.
[2023-03-19 23:54:57] [INFO ] Dead Transitions using invariants and state equation in 2206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9188 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:54:58] [INFO ] Invariant cache hit.
[2023-03-19 23:54:59] [INFO ] [Real]Absence check using 901 positive place invariants in 286 ms returned sat
[2023-03-19 23:55:01] [INFO ] After 2307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:55:02] [INFO ] [Nat]Absence check using 901 positive place invariants in 267 ms returned sat
[2023-03-19 23:55:12] [INFO ] After 10109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:55:12] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 0 ms to minimize.
[2023-03-19 23:55:13] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2023-03-19 23:55:13] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 0 ms to minimize.
[2023-03-19 23:55:13] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2023-03-19 23:55:14] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 0 ms to minimize.
[2023-03-19 23:55:14] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-19 23:55:14] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 0 ms to minimize.
[2023-03-19 23:55:15] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:55:15] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-19 23:55:15] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2023-03-19 23:55:16] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 0 ms to minimize.
[2023-03-19 23:55:16] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 0 ms to minimize.
[2023-03-19 23:55:16] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2023-03-19 23:55:17] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-19 23:55:17] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-19 23:55:17] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 7 ms to minimize.
[2023-03-19 23:55:18] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2023-03-19 23:55:18] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:55:18] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-19 23:55:18] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 0 ms to minimize.
[2023-03-19 23:55:19] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:55:19] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-19 23:55:19] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2023-03-19 23:55:20] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:55:20] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2023-03-19 23:55:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-19 23:55:20] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2023-03-19 23:55:20] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-19 23:55:21] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2023-03-19 23:55:21] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2023-03-19 23:55:21] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2023-03-19 23:55:21] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2023-03-19 23:55:22] [INFO ] Deduced a trap composed of 9 places in 389 ms of which 0 ms to minimize.
[2023-03-19 23:55:22] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-19 23:55:23] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-19 23:55:23] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-19 23:55:23] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-19 23:55:23] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-19 23:55:24] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2023-03-19 23:55:24] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-19 23:55:24] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-19 23:55:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-19 23:55:24] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 12570 ms
[2023-03-19 23:55:26] [INFO ] After 24060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 23:55:26] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 668 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 337 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 85923 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85923 steps, saw 84528 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-19 23:55:30] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-19 23:55:31] [INFO ] [Real]Absence check using 899 positive place invariants in 386 ms returned sat
[2023-03-19 23:55:31] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:55:33] [INFO ] After 2888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:55:34] [INFO ] [Nat]Absence check using 899 positive place invariants in 329 ms returned sat
[2023-03-19 23:55:34] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:55:45] [INFO ] After 10500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:55:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:55:45] [INFO ] After 665ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:55:46] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 0 ms to minimize.
[2023-03-19 23:55:46] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:55:46] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2023-03-19 23:55:47] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-19 23:55:47] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2023-03-19 23:55:47] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 1 ms to minimize.
[2023-03-19 23:55:48] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2023-03-19 23:55:49] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:55:50] [INFO ] Deduced a trap composed of 5 places in 387 ms of which 1 ms to minimize.
[2023-03-19 23:55:51] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:55:51] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-19 23:55:51] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-19 23:55:51] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-19 23:55:52] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:55:52] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-19 23:55:52] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-19 23:55:55] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 1 ms to minimize.
[2023-03-19 23:55:55] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-19 23:55:55] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2023-03-19 23:55:56] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2023-03-19 23:55:56] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 0 ms to minimize.
[2023-03-19 23:55:56] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2023-03-19 23:55:57] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:55:57] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-19 23:55:57] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2023-03-19 23:55:58] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 12885 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:55:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:55:58] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 338 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:55:59] [INFO ] Invariant cache hit.
[2023-03-19 23:56:01] [INFO ] Implicit Places using invariants in 2545 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2556 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 132 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2758 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 90127 steps, run timeout after 3003 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90127 steps, saw 88683 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:56:05] [INFO ] Computed 900 place invariants in 23 ms
[2023-03-19 23:56:06] [INFO ] [Real]Absence check using 898 positive place invariants in 295 ms returned sat
[2023-03-19 23:56:06] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:56:08] [INFO ] After 2821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:56:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 328 ms returned sat
[2023-03-19 23:56:09] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:56:20] [INFO ] After 10795ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:56:29] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 1 ms to minimize.
[2023-03-19 23:56:29] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:56:30] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-19 23:56:30] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-19 23:56:33] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 4360 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-19 23:56:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:56:33] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 204 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-19 23:56:33] [INFO ] Invariant cache hit.
[2023-03-19 23:56:35] [INFO ] Implicit Places using invariants in 1784 ms returned []
[2023-03-19 23:56:35] [INFO ] Invariant cache hit.
[2023-03-19 23:56:42] [INFO ] Implicit Places using invariants and state equation in 6487 ms returned []
Implicit Place search using SMT with State Equation took 8285 ms to find 0 implicit places.
[2023-03-19 23:56:42] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-19 23:56:42] [INFO ] Invariant cache hit.
[2023-03-19 23:56:44] [INFO ] Dead Transitions using invariants and state equation in 2413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10880 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 461 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 32 reset in 1723 ms.
Product exploration explored 100000 steps with 33 reset in 2329 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 13 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 13 ms
Applied a total of 2 rules in 212 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:56:51] [INFO ] Redundant transitions in 613 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-19 23:56:51] [INFO ] Computed 901 place invariants in 11 ms
[2023-03-19 23:56:52] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 13 ms
Applied a total of 0 rules in 107 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2220 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 66 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:56:52] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-19 23:56:54] [INFO ] Implicit Places using invariants in 1751 ms returned []
[2023-03-19 23:56:54] [INFO ] Invariant cache hit.
[2023-03-19 23:56:59] [INFO ] Implicit Places using invariants and state equation in 5363 ms returned []
Implicit Place search using SMT with State Equation took 7116 ms to find 0 implicit places.
[2023-03-19 23:56:59] [INFO ] Invariant cache hit.
[2023-03-19 23:57:01] [INFO ] Dead Transitions using invariants and state equation in 2016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9208 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-11 finished in 255282 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(F(p0))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 69 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:57:01] [INFO ] Invariant cache hit.
[2023-03-19 23:57:03] [INFO ] Implicit Places using invariants in 1991 ms returned []
[2023-03-19 23:57:03] [INFO ] Invariant cache hit.
[2023-03-19 23:57:09] [INFO ] Implicit Places using invariants and state equation in 5563 ms returned []
Implicit Place search using SMT with State Equation took 7567 ms to find 0 implicit places.
[2023-03-19 23:57:09] [INFO ] Invariant cache hit.
[2023-03-19 23:57:10] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9135 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s513 1) (EQ s523 1) (EQ s525 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13167 steps with 2 reset in 252 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-12 finished in 9552 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 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 197 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:57:11] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-19 23:57:13] [INFO ] Implicit Places using invariants in 2124 ms returned []
[2023-03-19 23:57:13] [INFO ] Invariant cache hit.
[2023-03-19 23:57:16] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 4749 ms to find 0 implicit places.
[2023-03-19 23:57:16] [INFO ] Redundant transitions in 338 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-19 23:57:16] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-19 23:57:18] [INFO ] Dead Transitions using invariants and state equation in 1944 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7332 ms. Remains : 2499/2503 places, 2399/2403 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-13 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 s2115 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 19 reset in 1783 ms.
Product exploration explored 100000 steps with 19 reset in 1981 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 917 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=65 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 197 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 154 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-19 23:57:23] [INFO ] Invariant cache hit.
[2023-03-19 23:57:25] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2023-03-19 23:57:25] [INFO ] Invariant cache hit.
[2023-03-19 23:57:30] [INFO ] Implicit Places using invariants and state equation in 4877 ms returned []
Implicit Place search using SMT with State Equation took 6707 ms to find 0 implicit places.
[2023-03-19 23:57:30] [INFO ] Redundant transitions in 342 ms returned []
[2023-03-19 23:57:30] [INFO ] Invariant cache hit.
[2023-03-19 23:57:32] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8930 ms. Remains : 2499/2499 places, 2399/2399 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 58 ms :[(NOT p0)]
Finished random walk after 4181 steps, including 1 resets, run visited all 1 properties in 66 ms. (steps per millisecond=63 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 259 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1857 ms.
Product exploration explored 100000 steps with 19 reset in 2309 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-19 23:57:37] [INFO ] Invariant cache hit.
[2023-03-19 23:57:38] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2023-03-19 23:57:38] [INFO ] Invariant cache hit.
[2023-03-19 23:57:42] [INFO ] Implicit Places using invariants and state equation in 4111 ms returned []
Implicit Place search using SMT with State Equation took 5529 ms to find 0 implicit places.
[2023-03-19 23:57:42] [INFO ] Redundant transitions in 333 ms returned []
[2023-03-19 23:57:42] [INFO ] Invariant cache hit.
[2023-03-19 23:57:44] [INFO ] Dead Transitions using invariants and state equation in 1748 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7720 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-13 finished in 33468 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 (G(!p0)||(!p0&&(p1||X(!p2))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:57:44] [INFO ] Computed 901 place invariants in 26 ms
[2023-03-19 23:57:46] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2023-03-19 23:57:46] [INFO ] Invariant cache hit.
[2023-03-19 23:57:51] [INFO ] Implicit Places using invariants and state equation in 5316 ms returned []
Implicit Place search using SMT with State Equation took 6745 ms to find 0 implicit places.
[2023-03-19 23:57:51] [INFO ] Invariant cache hit.
[2023-03-19 23:57:53] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8836 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p0, (AND p0 p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1083 1) (EQ s1097 1)), p1:(AND (EQ s1322 1) (EQ s75 1)), p2:(AND (EQ s1906 1) (EQ s1916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8114 ms.
Product exploration explored 100000 steps with 50000 reset in 8285 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-14 finished in 25717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 64 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:58:10] [INFO ] Invariant cache hit.
[2023-03-19 23:58:12] [INFO ] Implicit Places using invariants in 1615 ms returned []
[2023-03-19 23:58:12] [INFO ] Invariant cache hit.
[2023-03-19 23:58:17] [INFO ] Implicit Places using invariants and state equation in 4948 ms returned []
Implicit Place search using SMT with State Equation took 6567 ms to find 0 implicit places.
[2023-03-19 23:58:17] [INFO ] Invariant cache hit.
[2023-03-19 23:58:19] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8520 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s2007 0) (EQ s2009 0)) (OR (EQ s1661 0) (EQ s1665 0) (EQ s1676 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 938 steps with 0 reset in 14 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-15 finished in 8736 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&&X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100A-LTLFireability-01
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 246 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:58:19] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-19 23:58:21] [INFO ] Implicit Places using invariants in 1556 ms returned []
[2023-03-19 23:58:21] [INFO ] Invariant cache hit.
[2023-03-19 23:58:23] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 3953 ms to find 0 implicit places.
[2023-03-19 23:58:23] [INFO ] Invariant cache hit.
[2023-03-19 23:58:26] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6540 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 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 p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2149 0), p1:(OR (EQ s935 0) (EQ s939 0) (EQ s950 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33570 reset in 2233 ms.
Product exploration explored 100000 steps with 33128 reset in 2463 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 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:58:32] [INFO ] Invariant cache hit.
[2023-03-19 23:58:32] [INFO ] [Real]Absence check using 900 positive place invariants in 195 ms returned sat
[2023-03-19 23:58:34] [INFO ] After 2257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:58:34] [INFO ] [Nat]Absence check using 900 positive place invariants in 219 ms returned sat
[2023-03-19 23:58:36] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:58:36] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2023-03-19 23:58:37] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-19 23:58:37] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-19 23:58:37] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 0 ms to minimize.
[2023-03-19 23:58:37] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2023-03-19 23:58:38] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-19 23:58:38] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2023-03-19 23:58:38] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-19 23:58:38] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:58:39] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2023-03-19 23:58:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2680 ms
[2023-03-19 23:58:39] [INFO ] After 4366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-19 23:58:39] [INFO ] After 5462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 212 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 154 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 108923 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{1=1}
Probabilistic random walk after 108923 steps, saw 107446 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:58:43] [INFO ] Computed 900 place invariants in 32 ms
[2023-03-19 23:58:44] [INFO ] [Real]Absence check using 900 positive place invariants in 188 ms returned sat
[2023-03-19 23:58:45] [INFO ] After 2234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:58:46] [INFO ] [Nat]Absence check using 900 positive place invariants in 238 ms returned sat
[2023-03-19 23:58:48] [INFO ] After 1458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:58:48] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-19 23:58:48] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-19 23:58:48] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
[2023-03-19 23:58:49] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 1 ms to minimize.
[2023-03-19 23:58:49] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-19 23:58:49] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2023-03-19 23:58:50] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2023-03-19 23:58:50] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2023-03-19 23:58:50] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-19 23:58:51] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:58:51] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:58:51] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-19 23:58:51] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:58:52] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-19 23:58:52] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2023-03-19 23:58:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4353 ms
[2023-03-19 23:58:52] [INFO ] After 5921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-19 23:58:52] [INFO ] After 6830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133685 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133685 steps, saw 131970 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:58:56] [INFO ] Invariant cache hit.
[2023-03-19 23:58:56] [INFO ] [Real]Absence check using 900 positive place invariants in 203 ms returned sat
[2023-03-19 23:58:58] [INFO ] After 2026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:58:59] [INFO ] [Nat]Absence check using 900 positive place invariants in 293 ms returned sat
[2023-03-19 23:59:00] [INFO ] After 1680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:59:01] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-19 23:59:01] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 0 ms to minimize.
[2023-03-19 23:59:01] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 1 ms to minimize.
[2023-03-19 23:59:02] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 0 ms to minimize.
[2023-03-19 23:59:02] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 1 ms to minimize.
[2023-03-19 23:59:02] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2023-03-19 23:59:03] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:59:03] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2023-03-19 23:59:03] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-19 23:59:04] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 2 ms to minimize.
[2023-03-19 23:59:04] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-19 23:59:04] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2023-03-19 23:59:04] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 0 ms to minimize.
[2023-03-19 23:59:05] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 0 ms to minimize.
[2023-03-19 23:59:05] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2023-03-19 23:59:05] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 13 ms to minimize.
[2023-03-19 23:59:05] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-19 23:59:06] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-19 23:59:06] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-19 23:59:06] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-19 23:59:06] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5934 ms
[2023-03-19 23:59:06] [INFO ] After 7731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-19 23:59:06] [INFO ] After 8621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 137 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:59:07] [INFO ] Invariant cache hit.
[2023-03-19 23:59:09] [INFO ] Implicit Places using invariants in 2132 ms returned []
[2023-03-19 23:59:09] [INFO ] Invariant cache hit.
[2023-03-19 23:59:14] [INFO ] Implicit Places using invariants and state equation in 5068 ms returned []
Implicit Place search using SMT with State Equation took 7214 ms to find 0 implicit places.
[2023-03-19 23:59:14] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-19 23:59:14] [INFO ] Invariant cache hit.
[2023-03-19 23:59:16] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9347 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:59:16] [INFO ] Invariant cache hit.
[2023-03-19 23:59:17] [INFO ] [Real]Absence check using 900 positive place invariants in 267 ms returned sat
[2023-03-19 23:59:18] [INFO ] After 2083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:59:19] [INFO ] [Nat]Absence check using 900 positive place invariants in 209 ms returned sat
[2023-03-19 23:59:21] [INFO ] After 1549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:59:21] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 0 ms to minimize.
[2023-03-19 23:59:21] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 1 ms to minimize.
[2023-03-19 23:59:22] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-19 23:59:22] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:59:22] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-19 23:59:22] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-19 23:59:23] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2023-03-19 23:59:23] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-19 23:59:23] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:59:23] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:59:24] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 1 ms to minimize.
[2023-03-19 23:59:24] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2023-03-19 23:59:24] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 0 ms to minimize.
[2023-03-19 23:59:25] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-19 23:59:25] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2023-03-19 23:59:25] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-19 23:59:25] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2023-03-19 23:59:26] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-19 23:59:26] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-19 23:59:26] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-19 23:59:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5675 ms
[2023-03-19 23:59:26] [INFO ] After 7349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-19 23:59:26] [INFO ] After 8229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 465 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 108 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:59:28] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-19 23:59:29] [INFO ] Implicit Places using invariants in 1585 ms returned []
[2023-03-19 23:59:29] [INFO ] Invariant cache hit.
[2023-03-19 23:59:33] [INFO ] Implicit Places using invariants and state equation in 4237 ms returned []
Implicit Place search using SMT with State Equation took 5838 ms to find 0 implicit places.
[2023-03-19 23:59:33] [INFO ] Invariant cache hit.
[2023-03-19 23:59:36] [INFO ] Dead Transitions using invariants and state equation in 2513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8491 ms. Remains : 2499/2499 places, 2400/2400 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:59:37] [INFO ] Invariant cache hit.
[2023-03-19 23:59:38] [INFO ] [Real]Absence check using 900 positive place invariants in 199 ms returned sat
[2023-03-19 23:59:40] [INFO ] After 2672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:59:40] [INFO ] [Nat]Absence check using 900 positive place invariants in 216 ms returned sat
[2023-03-19 23:59:42] [INFO ] After 1511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:59:42] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2023-03-19 23:59:43] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:59:43] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:59:43] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2023-03-19 23:59:43] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2023-03-19 23:59:44] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-03-19 23:59:44] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-03-19 23:59:44] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:59:44] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-19 23:59:44] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-19 23:59:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2426 ms
[2023-03-19 23:59:45] [INFO ] After 4216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-19 23:59:45] [INFO ] After 5315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 206 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 145 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 108000 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{1=1}
Probabilistic random walk after 108000 steps, saw 106531 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-19 23:59:49] [INFO ] Computed 900 place invariants in 34 ms
[2023-03-19 23:59:50] [INFO ] [Real]Absence check using 900 positive place invariants in 248 ms returned sat
[2023-03-19 23:59:51] [INFO ] After 2284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:59:52] [INFO ] [Nat]Absence check using 900 positive place invariants in 170 ms returned sat
[2023-03-19 23:59:53] [INFO ] After 1572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:59:54] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:59:54] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-19 23:59:54] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:59:55] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:59:55] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-19 23:59:55] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2023-03-19 23:59:56] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2023-03-19 23:59:56] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-19 23:59:56] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 0 ms to minimize.
[2023-03-19 23:59:57] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 0 ms to minimize.
[2023-03-19 23:59:57] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:59:57] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-19 23:59:57] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:59:58] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-19 23:59:58] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2023-03-19 23:59:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4371 ms
[2023-03-19 23:59:58] [INFO ] After 6001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 23:59:58] [INFO ] After 6798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 109 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 130808 steps, run timeout after 3011 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130808 steps, saw 129119 distinct states, run finished after 3012 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:00:02] [INFO ] Invariant cache hit.
[2023-03-20 00:00:02] [INFO ] [Real]Absence check using 900 positive place invariants in 352 ms returned sat
[2023-03-20 00:00:04] [INFO ] After 2339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:00:05] [INFO ] [Nat]Absence check using 900 positive place invariants in 196 ms returned sat
[2023-03-20 00:00:06] [INFO ] After 1450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:00:06] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-20 00:00:07] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-20 00:00:07] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-20 00:00:07] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2023-03-20 00:00:08] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 0 ms to minimize.
[2023-03-20 00:00:08] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 0 ms to minimize.
[2023-03-20 00:00:08] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2023-03-20 00:00:08] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-20 00:00:09] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2023-03-20 00:00:09] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 0 ms to minimize.
[2023-03-20 00:00:09] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 0 ms to minimize.
[2023-03-20 00:00:10] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-20 00:00:10] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2023-03-20 00:00:10] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-03-20 00:00:11] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 1 ms to minimize.
[2023-03-20 00:00:11] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2023-03-20 00:00:11] [INFO ] Deduced a trap composed of 23 places in 486 ms of which 0 ms to minimize.
[2023-03-20 00:00:12] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-20 00:00:12] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-20 00:00:12] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-20 00:00:12] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6086 ms
[2023-03-20 00:00:12] [INFO ] After 7636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-20 00:00:13] [INFO ] After 8584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 76 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 133 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 76 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-20 00:00:13] [INFO ] Invariant cache hit.
[2023-03-20 00:00:15] [INFO ] Implicit Places using invariants in 1992 ms returned []
[2023-03-20 00:00:15] [INFO ] Invariant cache hit.
[2023-03-20 00:00:17] [INFO ] Implicit Places using invariants and state equation in 1701 ms returned []
Implicit Place search using SMT with State Equation took 3707 ms to find 0 implicit places.
[2023-03-20 00:00:17] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-20 00:00:17] [INFO ] Invariant cache hit.
[2023-03-20 00:00:19] [INFO ] Dead Transitions using invariants and state equation in 2162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6033 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 00:00:19] [INFO ] Invariant cache hit.
[2023-03-20 00:00:20] [INFO ] [Real]Absence check using 900 positive place invariants in 194 ms returned sat
[2023-03-20 00:00:21] [INFO ] After 2172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:00:22] [INFO ] [Nat]Absence check using 900 positive place invariants in 259 ms returned sat
[2023-03-20 00:00:24] [INFO ] After 1742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:00:24] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 2 ms to minimize.
[2023-03-20 00:00:25] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-20 00:00:25] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2023-03-20 00:00:25] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 2 ms to minimize.
[2023-03-20 00:00:26] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 1 ms to minimize.
[2023-03-20 00:00:26] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2023-03-20 00:00:27] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 2 ms to minimize.
[2023-03-20 00:00:27] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-20 00:00:27] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-20 00:00:27] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2023-03-20 00:00:28] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 1 ms to minimize.
[2023-03-20 00:00:28] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2023-03-20 00:00:28] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 0 ms to minimize.
[2023-03-20 00:00:29] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-20 00:00:29] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2023-03-20 00:00:29] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-20 00:00:30] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 1 ms to minimize.
[2023-03-20 00:00:30] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-20 00:00:30] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-20 00:00:30] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-20 00:00:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6515 ms
[2023-03-20 00:00:31] [INFO ] After 8385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 00:00:31] [INFO ] After 9671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33314 reset in 2394 ms.
Product exploration explored 100000 steps with 33356 reset in 2773 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 133 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-20 00:00:37] [INFO ] Computed 900 place invariants in 42 ms
[2023-03-20 00:00:39] [INFO ] Implicit Places using invariants in 1961 ms returned []
[2023-03-20 00:00:39] [INFO ] Invariant cache hit.
[2023-03-20 00:00:44] [INFO ] Implicit Places using invariants and state equation in 4743 ms returned []
Implicit Place search using SMT with State Equation took 6727 ms to find 0 implicit places.
[2023-03-20 00:00:44] [INFO ] Invariant cache hit.
[2023-03-20 00:00:46] [INFO ] Dead Transitions using invariants and state equation in 2085 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8961 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-01 finished in 147313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(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' '!(F((G(!p0)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&G(!p0))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G((p1||F(p2)))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-07
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 261 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-20 00:00:47] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-20 00:00:49] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2023-03-20 00:00:49] [INFO ] Invariant cache hit.
[2023-03-20 00:00:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:00:51] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
[2023-03-20 00:00:51] [INFO ] Invariant cache hit.
[2023-03-20 00:00:53] [INFO ] Dead Transitions using invariants and state equation in 2175 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6635 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1806 ms.
Product exploration explored 100000 steps with 30 reset in 2203 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 597 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1867 steps, including 0 resets, run visited all 2 properties in 83 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 442 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-20 00:00:59] [INFO ] Invariant cache hit.
[2023-03-20 00:01:03] [INFO ] [Real]Absence check using 901 positive place invariants in 1155 ms returned sat
[2023-03-20 00:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:01:14] [INFO ] [Real]Absence check using state equation in 10878 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2501 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 145 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-20 00:01:14] [INFO ] Invariant cache hit.
[2023-03-20 00:01:16] [INFO ] Implicit Places using invariants in 1516 ms returned []
[2023-03-20 00:01:16] [INFO ] Invariant cache hit.
[2023-03-20 00:01:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:01:21] [INFO ] Implicit Places using invariants and state equation in 5728 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7260 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7493 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1914 steps, including 0 resets, run visited all 2 properties in 86 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-20 00:01:23] [INFO ] Computed 900 place invariants in 11 ms
[2023-03-20 00:01:27] [INFO ] [Real]Absence check using 900 positive place invariants in 1041 ms returned sat
[2023-03-20 00:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:01:38] [INFO ] [Real]Absence check using state equation in 10574 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 1990 ms.
Product exploration explored 100000 steps with 29 reset in 2247 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 76 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-20 00:01:42] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-20 00:01:44] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2023-03-20 00:01:44] [INFO ] Invariant cache hit.
[2023-03-20 00:01:48] [INFO ] Implicit Places using invariants and state equation in 4347 ms returned []
Implicit Place search using SMT with State Equation took 5737 ms to find 0 implicit places.
[2023-03-20 00:01:49] [INFO ] Redundant transitions in 420 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-20 00:01:49] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-20 00:01:50] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2500 places, 2399/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7999 ms. Remains : 2499/2500 places, 2399/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-07 finished in 64222 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(X(G(p0)))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-09
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 219 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-20 00:01:51] [INFO ] Computed 901 place invariants in 11 ms
[2023-03-20 00:01:53] [INFO ] Implicit Places using invariants in 1769 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1770 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 84 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2073 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s738 0) (EQ s746 0) (EQ s750 0) (EQ s2408 0) (EQ s2423 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1558 ms.
Product exploration explored 100000 steps with 19 reset in 1902 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104904 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104904 steps, saw 98240 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-20 00:02:00] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-20 00:02:01] [INFO ] [Real]Absence check using 900 positive place invariants in 297 ms returned sat
[2023-03-20 00:02:03] [INFO ] After 2440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:02:03] [INFO ] [Nat]Absence check using 900 positive place invariants in 174 ms returned sat
[2023-03-20 00:02:09] [INFO ] After 5822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:02:14] [INFO ] Deduced a trap composed of 11 places in 517 ms of which 0 ms to minimize.
[2023-03-20 00:02:19] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2023-03-20 00:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 13972 ms
[2023-03-20 00:02:28] [INFO ] After 24360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-20 00:02:28] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 239 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 170 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 139869 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139869 steps, saw 137891 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-20 00:02:31] [INFO ] Computed 900 place invariants in 37 ms
[2023-03-20 00:02:32] [INFO ] [Real]Absence check using 897 positive place invariants in 233 ms returned sat
[2023-03-20 00:02:32] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 00:02:34] [INFO ] After 2728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:02:35] [INFO ] [Nat]Absence check using 897 positive place invariants in 190 ms returned sat
[2023-03-20 00:02:35] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 00:02:45] [INFO ] After 10763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 213 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 145 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-20 00:02:45] [INFO ] Invariant cache hit.
[2023-03-20 00:02:48] [INFO ] Implicit Places using invariants in 2944 ms returned []
[2023-03-20 00:02:48] [INFO ] Invariant cache hit.
[2023-03-20 00:02:54] [INFO ] Implicit Places using invariants and state equation in 6142 ms returned []
Implicit Place search using SMT with State Equation took 9090 ms to find 0 implicit places.
[2023-03-20 00:02:55] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-20 00:02:55] [INFO ] Invariant cache hit.
[2023-03-20 00:02:56] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10943 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 00:02:56] [INFO ] Invariant cache hit.
[2023-03-20 00:02:57] [INFO ] [Real]Absence check using 897 positive place invariants in 366 ms returned sat
[2023-03-20 00:02:57] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 00:02:59] [INFO ] After 2427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:02:59] [INFO ] [Nat]Absence check using 897 positive place invariants in 241 ms returned sat
[2023-03-20 00:02:59] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 56 ms returned sat
[2023-03-20 00:03:11] [INFO ] After 11921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 116 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-20 00:03:11] [INFO ] Computed 900 place invariants in 17 ms
[2023-03-20 00:03:13] [INFO ] Implicit Places using invariants in 1637 ms returned []
[2023-03-20 00:03:13] [INFO ] Invariant cache hit.
[2023-03-20 00:03:18] [INFO ] Implicit Places using invariants and state equation in 4816 ms returned []
Implicit Place search using SMT with State Equation took 6467 ms to find 0 implicit places.
[2023-03-20 00:03:18] [INFO ] Invariant cache hit.
[2023-03-20 00:03:20] [INFO ] Dead Transitions using invariants and state equation in 2236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8852 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104259 steps, run timeout after 3044 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104259 steps, saw 97648 distinct states, run finished after 3044 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:03:24] [INFO ] Invariant cache hit.
[2023-03-20 00:03:25] [INFO ] [Real]Absence check using 900 positive place invariants in 302 ms returned sat
[2023-03-20 00:03:26] [INFO ] After 2357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:03:27] [INFO ] [Nat]Absence check using 900 positive place invariants in 201 ms returned sat
[2023-03-20 00:03:36] [INFO ] After 8726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:03:37] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 1 ms to minimize.
[2023-03-20 00:03:37] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2023-03-20 00:03:38] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 0 ms to minimize.
[2023-03-20 00:03:38] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2023-03-20 00:03:39] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 0 ms to minimize.
[2023-03-20 00:03:40] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 0 ms to minimize.
[2023-03-20 00:03:40] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 0 ms to minimize.
[2023-03-20 00:03:41] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2023-03-20 00:03:41] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2023-03-20 00:03:42] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2023-03-20 00:03:42] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-20 00:03:43] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2023-03-20 00:03:43] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-20 00:03:44] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-20 00:03:50] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2023-03-20 00:03:51] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 15026 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:03:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:03:51] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 195 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 153 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152466 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152466 steps, saw 150359 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-20 00:03:55] [INFO ] Computed 900 place invariants in 14 ms
[2023-03-20 00:03:56] [INFO ] [Real]Absence check using 897 positive place invariants in 245 ms returned sat
[2023-03-20 00:03:56] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 00:03:57] [INFO ] After 2291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:03:58] [INFO ] [Nat]Absence check using 897 positive place invariants in 204 ms returned sat
[2023-03-20 00:03:58] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 00:04:08] [INFO ] After 10808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 125 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-20 00:04:08] [INFO ] Invariant cache hit.
[2023-03-20 00:04:11] [INFO ] Implicit Places using invariants in 2985 ms returned []
[2023-03-20 00:04:11] [INFO ] Invariant cache hit.
[2023-03-20 00:04:17] [INFO ] Implicit Places using invariants and state equation in 6152 ms returned []
Implicit Place search using SMT with State Equation took 9162 ms to find 0 implicit places.
[2023-03-20 00:04:17] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-20 00:04:18] [INFO ] Invariant cache hit.
[2023-03-20 00:04:20] [INFO ] Dead Transitions using invariants and state equation in 2244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11638 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 00:04:20] [INFO ] Invariant cache hit.
[2023-03-20 00:04:20] [INFO ] [Real]Absence check using 897 positive place invariants in 329 ms returned sat
[2023-03-20 00:04:21] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-20 00:04:22] [INFO ] After 2233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:04:23] [INFO ] [Nat]Absence check using 897 positive place invariants in 174 ms returned sat
[2023-03-20 00:04:23] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-20 00:04:33] [INFO ] After 11046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1507 ms.
Product exploration explored 100000 steps with 19 reset in 1806 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-20 00:04:40] [INFO ] Redundant transitions in 1850 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-20 00:04:40] [INFO ] Computed 900 place invariants in 8 ms
[2023-03-20 00:04:42] [INFO ] Dead Transitions using invariants and state equation in 2297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 121 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4408 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 103 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-20 00:04:42] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-20 00:04:45] [INFO ] Implicit Places using invariants in 2244 ms returned []
[2023-03-20 00:04:45] [INFO ] Invariant cache hit.
[2023-03-20 00:04:50] [INFO ] Implicit Places using invariants and state equation in 5003 ms returned []
Implicit Place search using SMT with State Equation took 7250 ms to find 0 implicit places.
[2023-03-20 00:04:50] [INFO ] Invariant cache hit.
[2023-03-20 00:04:52] [INFO ] Dead Transitions using invariants and state equation in 2048 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9402 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-09 finished in 181298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||F(p1)) U p2)||G(F(p3)))))'
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 00:04:52] [INFO ] Flatten gal took : 179 ms
[2023-03-20 00:04:52] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 00:04:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 2403 transitions and 10806 arcs took 17 ms.
Total runtime 1671114 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
LTLFireability

BK_STOP 1679271256549

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 2/449 2/32 ShieldIIPs-PT-100A-LTLFireability-01 80465 m, 16093 m/sec, 342413 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 7/449 4/32 ShieldIIPs-PT-100A-LTLFireability-01 190099 m, 21926 m/sec, 929446 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 12/449 5/32 ShieldIIPs-PT-100A-LTLFireability-01 295277 m, 21035 m/sec, 1524381 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 17/449 7/32 ShieldIIPs-PT-100A-LTLFireability-01 397817 m, 20508 m/sec, 2113017 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 22/449 9/32 ShieldIIPs-PT-100A-LTLFireability-01 498927 m, 20222 m/sec, 2702290 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 28/449 10/32 ShieldIIPs-PT-100A-LTLFireability-01 602611 m, 20736 m/sec, 3289487 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 33/449 12/32 ShieldIIPs-PT-100A-LTLFireability-01 698963 m, 19270 m/sec, 3872401 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 38/449 13/32 ShieldIIPs-PT-100A-LTLFireability-01 791409 m, 18489 m/sec, 4458872 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 43/449 15/32 ShieldIIPs-PT-100A-LTLFireability-01 887965 m, 19311 m/sec, 5048165 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 48/449 17/32 ShieldIIPs-PT-100A-LTLFireability-01 984451 m, 19297 m/sec, 5636033 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 53/449 18/32 ShieldIIPs-PT-100A-LTLFireability-01 1083863 m, 19882 m/sec, 6225405 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 58/449 20/32 ShieldIIPs-PT-100A-LTLFireability-01 1177673 m, 18762 m/sec, 6812506 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 63/449 21/32 ShieldIIPs-PT-100A-LTLFireability-01 1271041 m, 18673 m/sec, 7402157 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 68/449 23/32 ShieldIIPs-PT-100A-LTLFireability-01 1365501 m, 18892 m/sec, 7992712 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 73/449 25/32 ShieldIIPs-PT-100A-LTLFireability-01 1471715 m, 21242 m/sec, 8570454 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 78/449 26/32 ShieldIIPs-PT-100A-LTLFireability-01 1568249 m, 19306 m/sec, 9153088 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 83/449 28/32 ShieldIIPs-PT-100A-LTLFireability-01 1664439 m, 19238 m/sec, 9734080 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 88/449 29/32 ShieldIIPs-PT-100A-LTLFireability-01 1757863 m, 18684 m/sec, 10319899 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 93/449 31/32 ShieldIIPs-PT-100A-LTLFireability-01 1852545 m, 18936 m/sec, 10906039 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 98/449 32/32 ShieldIIPs-PT-100A-LTLFireability-01 1945329 m, 18556 m/sec, 11490824 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 108 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 20 (type EXCL) for 19 ShieldIIPs-PT-100A-LTLFireability-11
lola: time limit : 498 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 5/498 4/32 ShieldIIPs-PT-100A-LTLFireability-11 114123 m, 22824 m/sec, 569264 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 10/498 6/32 ShieldIIPs-PT-100A-LTLFireability-11 213895 m, 19954 m/sec, 1149630 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 15/498 9/32 ShieldIIPs-PT-100A-LTLFireability-11 312114 m, 19643 m/sec, 1714291 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 20/498 11/32 ShieldIIPs-PT-100A-LTLFireability-11 402305 m, 18038 m/sec, 2269652 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 25/498 14/32 ShieldIIPs-PT-100A-LTLFireability-11 494407 m, 18420 m/sec, 2830887 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 30/498 16/32 ShieldIIPs-PT-100A-LTLFireability-11 588751 m, 18868 m/sec, 3405509 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 35/498 19/32 ShieldIIPs-PT-100A-LTLFireability-11 680280 m, 18305 m/sec, 3981618 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 40/498 21/32 ShieldIIPs-PT-100A-LTLFireability-11 779227 m, 19789 m/sec, 4547409 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 45/498 24/32 ShieldIIPs-PT-100A-LTLFireability-11 871727 m, 18500 m/sec, 5113364 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 50/498 26/32 ShieldIIPs-PT-100A-LTLFireability-11 960660 m, 17786 m/sec, 5673644 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 55/498 28/32 ShieldIIPs-PT-100A-LTLFireability-11 1050410 m, 17950 m/sec, 6229412 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 60/498 31/32 ShieldIIPs-PT-100A-LTLFireability-11 1136221 m, 17162 m/sec, 6791830 t fired, .

Time elapsed: 168 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 20 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 173 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 17 (type EXCL) for 16 ShieldIIPs-PT-100A-LTLFireability-09
lola: time limit : 571 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 5/571 4/32 ShieldIIPs-PT-100A-LTLFireability-09 114783 m, 22956 m/sec, 574495 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 10/571 6/32 ShieldIIPs-PT-100A-LTLFireability-09 214993 m, 20042 m/sec, 1155420 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 15/571 9/32 ShieldIIPs-PT-100A-LTLFireability-09 312832 m, 19567 m/sec, 1719219 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 20/571 11/32 ShieldIIPs-PT-100A-LTLFireability-09 402546 m, 17942 m/sec, 2271443 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 25/571 14/32 ShieldIIPs-PT-100A-LTLFireability-09 495046 m, 18500 m/sec, 2835078 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 30/571 16/32 ShieldIIPs-PT-100A-LTLFireability-09 587707 m, 18532 m/sec, 3398633 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 35/571 19/32 ShieldIIPs-PT-100A-LTLFireability-09 677541 m, 17966 m/sec, 3965845 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 40/571 21/32 ShieldIIPs-PT-100A-LTLFireability-09 773411 m, 19174 m/sec, 4516228 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 45/571 23/32 ShieldIIPs-PT-100A-LTLFireability-09 864544 m, 18226 m/sec, 5066890 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 50/571 26/32 ShieldIIPs-PT-100A-LTLFireability-09 953685 m, 17828 m/sec, 5628294 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 55/571 28/32 ShieldIIPs-PT-100A-LTLFireability-09 1043174 m, 17897 m/sec, 6186190 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 60/571 31/32 ShieldIIPs-PT-100A-LTLFireability-09 1130844 m, 17534 m/sec, 6751523 t fired, .

Time elapsed: 233 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 17 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 238 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 14 (type EXCL) for 13 ShieldIIPs-PT-100A-LTLFireability-07
lola: time limit : 672 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/672 2/32 ShieldIIPs-PT-100A-LTLFireability-07 96344 m, 19268 m/sec, 603340 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/672 3/32 ShieldIIPs-PT-100A-LTLFireability-07 175923 m, 15915 m/sec, 1221276 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/672 5/32 ShieldIIPs-PT-100A-LTLFireability-07 255623 m, 15940 m/sec, 1826345 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/672 6/32 ShieldIIPs-PT-100A-LTLFireability-07 325085 m, 13892 m/sec, 2437472 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 25/672 7/32 ShieldIIPs-PT-100A-LTLFireability-07 404089 m, 15800 m/sec, 3041316 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 30/672 8/32 ShieldIIPs-PT-100A-LTLFireability-07 476036 m, 14389 m/sec, 3650020 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 35/672 9/32 ShieldIIPs-PT-100A-LTLFireability-07 545389 m, 13870 m/sec, 4256558 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 40/672 10/32 ShieldIIPs-PT-100A-LTLFireability-07 613019 m, 13526 m/sec, 4865876 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 45/672 11/32 ShieldIIPs-PT-100A-LTLFireability-07 680372 m, 13470 m/sec, 5472927 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 50/672 12/32 ShieldIIPs-PT-100A-LTLFireability-07 757698 m, 15465 m/sec, 6079971 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 55/672 13/32 ShieldIIPs-PT-100A-LTLFireability-07 826823 m, 13825 m/sec, 6689542 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 60/672 14/32 ShieldIIPs-PT-100A-LTLFireability-07 897925 m, 14220 m/sec, 7297348 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 65/672 15/32 ShieldIIPs-PT-100A-LTLFireability-07 961854 m, 12785 m/sec, 7905952 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 70/672 16/32 ShieldIIPs-PT-100A-LTLFireability-07 1029183 m, 13465 m/sec, 8512104 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 75/672 17/32 ShieldIIPs-PT-100A-LTLFireability-07 1096306 m, 13424 m/sec, 9118975 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 80/672 18/32 ShieldIIPs-PT-100A-LTLFireability-07 1158921 m, 12523 m/sec, 9728491 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 85/672 19/32 ShieldIIPs-PT-100A-LTLFireability-07 1221927 m, 12601 m/sec, 10336641 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 90/672 20/32 ShieldIIPs-PT-100A-LTLFireability-07 1280563 m, 11727 m/sec, 10946307 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 95/672 21/32 ShieldIIPs-PT-100A-LTLFireability-07 1348746 m, 13636 m/sec, 11552890 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 100/672 22/32 ShieldIIPs-PT-100A-LTLFireability-07 1424219 m, 15094 m/sec, 12162001 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 105/672 23/32 ShieldIIPs-PT-100A-LTLFireability-07 1494100 m, 13976 m/sec, 12770692 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 110/672 24/32 ShieldIIPs-PT-100A-LTLFireability-07 1562982 m, 13776 m/sec, 13374248 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 115/672 25/32 ShieldIIPs-PT-100A-LTLFireability-07 1625198 m, 12443 m/sec, 13982887 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 120/672 26/32 ShieldIIPs-PT-100A-LTLFireability-07 1694970 m, 13954 m/sec, 14591170 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 125/672 27/32 ShieldIIPs-PT-100A-LTLFireability-07 1761204 m, 13246 m/sec, 15201051 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 130/672 28/32 ShieldIIPs-PT-100A-LTLFireability-07 1823702 m, 12499 m/sec, 15810399 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 135/672 29/32 ShieldIIPs-PT-100A-LTLFireability-07 1886024 m, 12464 m/sec, 16418800 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 140/672 29/32 ShieldIIPs-PT-100A-LTLFireability-07 1943258 m, 11446 m/sec, 17027390 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 145/672 30/32 ShieldIIPs-PT-100A-LTLFireability-07 2009399 m, 13228 m/sec, 17634382 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 150/672 31/32 ShieldIIPs-PT-100A-LTLFireability-07 2076913 m, 13502 m/sec, 18243689 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 155/672 32/32 ShieldIIPs-PT-100A-LTLFireability-07 2139442 m, 12505 m/sec, 18853729 t fired, .

Time elapsed: 393 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 14 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 398 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 23 (type EXCL) for 22 ShieldIIPs-PT-100A-LTLFireability-13
lola: time limit : 800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
23 LTL EXCL 5/800 8/32 ShieldIIPs-PT-100A-LTLFireability-13 249660 m, 49932 m/sec, 505204 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
23 LTL EXCL 10/800 14/32 ShieldIIPs-PT-100A-LTLFireability-13 487249 m, 47517 m/sec, 1029149 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
23 LTL EXCL 15/800 21/32 ShieldIIPs-PT-100A-LTLFireability-13 733037 m, 49157 m/sec, 1550539 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
23 LTL EXCL 20/800 27/32 ShieldIIPs-PT-100A-LTLFireability-13 958646 m, 45121 m/sec, 2071287 t fired, .

Time elapsed: 418 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 23 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 423 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 8 (type EXCL) for 3 ShieldIIPs-PT-100A-LTLFireability-02
lola: time limit : 1059 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1059 3/32 ShieldIIPs-PT-100A-LTLFireability-02 197270 m, 39454 m/sec, 525025 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1059 5/32 ShieldIIPs-PT-100A-LTLFireability-02 378856 m, 36317 m/sec, 1069706 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1059 7/32 ShieldIIPs-PT-100A-LTLFireability-02 555022 m, 35233 m/sec, 1618594 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1059 9/32 ShieldIIPs-PT-100A-LTLFireability-02 731645 m, 35324 m/sec, 2164819 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1059 11/32 ShieldIIPs-PT-100A-LTLFireability-02 908725 m, 35416 m/sec, 2711650 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1059 13/32 ShieldIIPs-PT-100A-LTLFireability-02 1086596 m, 35574 m/sec, 3258067 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1059 15/32 ShieldIIPs-PT-100A-LTLFireability-02 1268363 m, 36353 m/sec, 3803732 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1059 17/32 ShieldIIPs-PT-100A-LTLFireability-02 1449059 m, 36139 m/sec, 4348803 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/1059 19/32 ShieldIIPs-PT-100A-LTLFireability-02 1633379 m, 36864 m/sec, 4893839 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/1059 21/32 ShieldIIPs-PT-100A-LTLFireability-02 1812727 m, 35869 m/sec, 5437500 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 55/1059 23/32 ShieldIIPs-PT-100A-LTLFireability-02 1987398 m, 34934 m/sec, 5980025 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 60/1059 25/32 ShieldIIPs-PT-100A-LTLFireability-02 2164606 m, 35441 m/sec, 6523957 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 65/1059 27/32 ShieldIIPs-PT-100A-LTLFireability-02 2337897 m, 34658 m/sec, 7072639 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 70/1059 29/32 ShieldIIPs-PT-100A-LTLFireability-02 2514567 m, 35334 m/sec, 7620617 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 75/1059 31/32 ShieldIIPs-PT-100A-LTLFireability-02 2692134 m, 35513 m/sec, 8168087 t fired, .

Time elapsed: 498 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 8 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 1 0 0 2 0 1 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 503 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 6 (type EXCL) for 3 ShieldIIPs-PT-100A-LTLFireability-02
lola: time limit : 1548 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 5/1548 11/32 ShieldIIPs-PT-100A-LTLFireability-02 289595 m, 57919 m/sec, 448236 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 10/1548 23/32 ShieldIIPs-PT-100A-LTLFireability-02 611119 m, 64304 m/sec, 949362 t fired, .

Time elapsed: 513 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 6 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 518 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 11 (type EXCL) for 10 ShieldIIPs-PT-100A-LTLFireability-06
lola: time limit : 3082 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/3082 5/32 ShieldIIPs-PT-100A-LTLFireability-06 337989 m, 67597 m/sec, 443266 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/3082 10/32 ShieldIIPs-PT-100A-LTLFireability-06 681673 m, 68736 m/sec, 896186 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/3082 13/32 ShieldIIPs-PT-100A-LTLFireability-06 1023097 m, 68284 m/sec, 1346189 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/3082 17/32 ShieldIIPs-PT-100A-LTLFireability-06 1362831 m, 67946 m/sec, 1793939 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/3082 21/32 ShieldIIPs-PT-100A-LTLFireability-06 1702733 m, 67980 m/sec, 2241877 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/3082 24/32 ShieldIIPs-PT-100A-LTLFireability-06 2042155 m, 67884 m/sec, 2689170 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/3082 28/32 ShieldIIPs-PT-100A-LTLFireability-06 2380730 m, 67715 m/sec, 3135407 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/3082 31/32 ShieldIIPs-PT-100A-LTLFireability-06 2719815 m, 67817 m/sec, 3582287 t fired, .

Time elapsed: 558 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 11 (type EXCL) for ShieldIIPs-PT-100A-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100A-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-02: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100A-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100A-LTLFireability-01: LTL unknown AGGR
ShieldIIPs-PT-100A-LTLFireability-02: CONJ unknown CONJ
ShieldIIPs-PT-100A-LTLFireability-06: LTL unknown AGGR
ShieldIIPs-PT-100A-LTLFireability-07: LTL unknown AGGR
ShieldIIPs-PT-100A-LTLFireability-09: LTL unknown AGGR
ShieldIIPs-PT-100A-LTLFireability-11: LTL unknown AGGR
ShieldIIPs-PT-100A-LTLFireability-13: LTL unknown AGGR


Time elapsed: 563 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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