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-167903715000172.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-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715000172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.7M 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-100B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679269378212

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-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:43:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:43:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:43:00] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2023-03-19 23:43:01] [INFO ] Transformed 6003 places.
[2023-03-19 23:43:01] [INFO ] Transformed 5903 transitions.
[2023-03-19 23:43:01] [INFO ] Found NUPN structural information;
[2023-03-19 23:43:01] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 618 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 1 formulas.
FORMULA ShieldIIPs-PT-100B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 689 places :
Symmetric choice reduction at 0 with 689 rule applications. Total rules 689 place count 5314 transition count 5214
Iterating global reduction 0 with 689 rules applied. Total rules applied 1378 place count 5314 transition count 5214
Applied a total of 1378 rules in 1371 ms. Remains 5314 /6003 variables (removed 689) and now considering 5214/5903 (removed 689) transitions.
// Phase 1: matrix 5214 rows 5314 cols
[2023-03-19 23:43:03] [INFO ] Computed 901 place invariants in 82 ms
[2023-03-19 23:43:05] [INFO ] Implicit Places using invariants in 2964 ms returned []
[2023-03-19 23:43:05] [INFO ] Invariant cache hit.
[2023-03-19 23:43:08] [INFO ] Implicit Places using invariants and state equation in 2440 ms returned []
Implicit Place search using SMT with State Equation took 5437 ms to find 0 implicit places.
[2023-03-19 23:43:08] [INFO ] Invariant cache hit.
[2023-03-19 23:43:12] [INFO ] Dead Transitions using invariants and state equation in 4293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5314/6003 places, 5214/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11122 ms. Remains : 5314/6003 places, 5214/5903 transitions.
Support contains 61 out of 5314 places after structural reductions.
[2023-03-19 23:43:13] [INFO ] Flatten gal took : 331 ms
[2023-03-19 23:43:13] [INFO ] Flatten gal took : 223 ms
[2023-03-19 23:43:14] [INFO ] Input system was already deterministic with 5214 transitions.
Support contains 59 out of 5314 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 39) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-19 23:43:14] [INFO ] Invariant cache hit.
[2023-03-19 23:43:18] [INFO ] [Real]Absence check using 901 positive place invariants in 914 ms returned sat
[2023-03-19 23:43:18] [INFO ] After 3938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-19 23:43:22] [INFO ] [Nat]Absence check using 901 positive place invariants in 769 ms returned sat
[2023-03-19 23:43:35] [INFO ] After 9819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-19 23:43:37] [INFO ] Deduced a trap composed of 17 places in 2029 ms of which 13 ms to minimize.
[2023-03-19 23:43:39] [INFO ] Deduced a trap composed of 23 places in 1818 ms of which 5 ms to minimize.
[2023-03-19 23:43:41] [INFO ] Deduced a trap composed of 17 places in 1587 ms of which 2 ms to minimize.
[2023-03-19 23:43:43] [INFO ] Deduced a trap composed of 18 places in 1834 ms of which 17 ms to minimize.
[2023-03-19 23:43:45] [INFO ] Deduced a trap composed of 19 places in 1706 ms of which 9 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:43:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:43:45] [INFO ] After 26295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:27
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 5 properties in 9124 ms.
Support contains 41 out of 5314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 494 place count 5314 transition count 4720
Reduce places removed 494 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 495 rules applied. Total rules applied 989 place count 4820 transition count 4719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 990 place count 4819 transition count 4719
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 990 place count 4819 transition count 4220
Deduced a syphon composed of 499 places in 22 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1988 place count 4320 transition count 4220
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1995 place count 4313 transition count 4213
Iterating global reduction 3 with 7 rules applied. Total rules applied 2002 place count 4313 transition count 4213
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2002 place count 4313 transition count 4210
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2008 place count 4310 transition count 4210
Performed 1787 Post agglomeration using F-continuation condition.Transition count delta: 1787
Deduced a syphon composed of 1787 places in 12 ms
Reduce places removed 1787 places and 0 transitions.
Iterating global reduction 3 with 3574 rules applied. Total rules applied 5582 place count 2523 transition count 2423
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 678 times.
Drop transitions removed 678 transitions
Iterating global reduction 3 with 678 rules applied. Total rules applied 6260 place count 2523 transition count 2423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6261 place count 2522 transition count 2422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6262 place count 2521 transition count 2422
Applied a total of 6262 rules in 1707 ms. Remains 2521 /5314 variables (removed 2793) and now considering 2422/5214 (removed 2792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1707 ms. Remains : 2521/5314 places, 2422/5214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 22) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2422 rows 2521 cols
[2023-03-19 23:43:58] [INFO ] Computed 900 place invariants in 69 ms
[2023-03-19 23:43:59] [INFO ] [Real]Absence check using 888 positive place invariants in 265 ms returned sat
[2023-03-19 23:43:59] [INFO ] [Real]Absence check using 888 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-19 23:43:59] [INFO ] After 969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 23:44:00] [INFO ] [Nat]Absence check using 888 positive place invariants in 201 ms returned sat
[2023-03-19 23:44:00] [INFO ] [Nat]Absence check using 888 positive and 12 generalized place invariants in 11 ms returned sat
[2023-03-19 23:44:03] [INFO ] After 2857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 23:44:03] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 6 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 2 ms to minimize.
[2023-03-19 23:44:06] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-19 23:44:06] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:44:06] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-19 23:44:06] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4061 ms
[2023-03-19 23:44:08] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-19 23:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2023-03-19 23:44:08] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2023-03-19 23:44:09] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-19 23:44:09] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-19 23:44:09] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2023-03-19 23:44:09] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-19 23:44:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1100 ms
[2023-03-19 23:44:10] [INFO ] After 10222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1502 ms.
[2023-03-19 23:44:12] [INFO ] After 13276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1094 ms.
Support contains 25 out of 2521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2521/2521 places, 2422/2422 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2521 transition count 2420
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2519 transition count 2420
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 2511 transition count 2412
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 2511 transition count 2412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 2510 transition count 2411
Applied a total of 27 rules in 319 ms. Remains 2510 /2521 variables (removed 11) and now considering 2411/2422 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 2510/2521 places, 2411/2422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Interrupted probabilistic random walk after 127653 steps, run timeout after 6001 ms. (steps per millisecond=21 ) properties seen :{1=1, 10=1}
Probabilistic random walk after 127653 steps, saw 125741 distinct states, run finished after 6002 ms. (steps per millisecond=21 ) properties seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 2411 rows 2510 cols
[2023-03-19 23:44:22] [INFO ] Computed 900 place invariants in 36 ms
[2023-03-19 23:44:23] [INFO ] [Real]Absence check using 893 positive place invariants in 325 ms returned sat
[2023-03-19 23:44:23] [INFO ] [Real]Absence check using 893 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 23:44:26] [INFO ] After 4283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 23:44:27] [INFO ] [Nat]Absence check using 893 positive place invariants in 298 ms returned sat
[2023-03-19 23:44:27] [INFO ] [Nat]Absence check using 893 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 23:44:30] [INFO ] After 2539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 23:44:31] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 0 ms to minimize.
[2023-03-19 23:44:31] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-19 23:44:31] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 0 ms to minimize.
[2023-03-19 23:44:32] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 0 ms to minimize.
[2023-03-19 23:44:32] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-19 23:44:32] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-19 23:44:32] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2023-03-19 23:44:33] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-19 23:44:33] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 1 ms to minimize.
[2023-03-19 23:44:33] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:44:34] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 1 ms to minimize.
[2023-03-19 23:44:34] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-19 23:44:34] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 3 ms to minimize.
[2023-03-19 23:44:34] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:44:35] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:44:35] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 14 ms to minimize.
[2023-03-19 23:44:35] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-19 23:44:36] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-19 23:44:36] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 0 ms to minimize.
[2023-03-19 23:44:36] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:44:37] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-19 23:44:37] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
[2023-03-19 23:44:37] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-19 23:44:37] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:44:38] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:44:38] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2023-03-19 23:44:38] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:44:39] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-03-19 23:44:39] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8745 ms
[2023-03-19 23:44:39] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 15 ms to minimize.
[2023-03-19 23:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-19 23:44:40] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 1 ms to minimize.
[2023-03-19 23:44:40] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2023-03-19 23:44:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2023-03-19 23:44:41] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2023-03-19 23:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2023-03-19 23:44:42] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2023-03-19 23:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2023-03-19 23:44:42] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2023-03-19 23:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-19 23:44:42] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-19 23:44:43] [INFO ] After 15072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1057 ms.
[2023-03-19 23:44:44] [INFO ] After 17785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 772 ms.
Support contains 22 out of 2510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2510/2510 places, 2411/2411 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2508 transition count 2409
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 2508 transition count 2409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 2507 transition count 2408
Applied a total of 8 rules in 408 ms. Remains 2507 /2510 variables (removed 3) and now considering 2408/2411 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 2507/2510 places, 2408/2411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 132979 steps, run timeout after 6006 ms. (steps per millisecond=22 ) properties seen :{0=1}
Probabilistic random walk after 132979 steps, saw 131167 distinct states, run finished after 6006 ms. (steps per millisecond=22 ) properties seen :1
Running SMT prover for 10 properties.
// Phase 1: matrix 2408 rows 2507 cols
[2023-03-19 23:44:53] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-19 23:44:54] [INFO ] [Real]Absence check using 894 positive place invariants in 233 ms returned sat
[2023-03-19 23:44:54] [INFO ] [Real]Absence check using 894 positive and 6 generalized place invariants in 15 ms returned sat
[2023-03-19 23:44:57] [INFO ] After 4059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 23:44:58] [INFO ] [Nat]Absence check using 894 positive place invariants in 230 ms returned sat
[2023-03-19 23:44:58] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 23:45:01] [INFO ] After 2589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 23:45:02] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2023-03-19 23:45:02] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-19 23:45:02] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 14 ms to minimize.
[2023-03-19 23:45:02] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-19 23:45:02] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2023-03-19 23:45:03] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 13 ms to minimize.
[2023-03-19 23:45:03] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:45:03] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-19 23:45:03] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:45:04] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:45:04] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2023-03-19 23:45:04] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:45:04] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:45:05] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-19 23:45:05] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 0 ms to minimize.
[2023-03-19 23:45:05] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2023-03-19 23:45:05] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4158 ms
[2023-03-19 23:45:06] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-19 23:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-19 23:45:07] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-19 23:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-19 23:45:08] [INFO ] After 8971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 972 ms.
[2023-03-19 23:45:09] [INFO ] After 11233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 636 ms.
Support contains 21 out of 2507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2507/2507 places, 2408/2408 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2507 transition count 2408
Applied a total of 1 rules in 203 ms. Remains 2507 /2507 variables (removed 0) and now considering 2408/2408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 2507/2507 places, 2408/2408 transitions.
Computed a total of 1207 stabilizing places and 1207 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' '!(((p0 U G(p1))&&X((!p0&&G(F(p2))))))'
Support contains 3 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 1314 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-19 23:45:11] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-19 23:45:12] [INFO ] Implicit Places using invariants in 748 ms returned []
[2023-03-19 23:45:12] [INFO ] Invariant cache hit.
[2023-03-19 23:45:14] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2602 ms to find 0 implicit places.
[2023-03-19 23:45:14] [INFO ] Invariant cache hit.
[2023-03-19 23:45:18] [INFO ] Dead Transitions using invariants and state equation in 4271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8190 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 716 ms :[(OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p1), (OR (NOT p2) p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1379 1), p0:(NEQ s4785 1), p2:(EQ s2315 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-00 finished in 9071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1||G(p2))))))'
Support contains 6 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1363 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:45:21] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-19 23:45:23] [INFO ] Implicit Places using invariants in 2236 ms returned []
[2023-03-19 23:45:23] [INFO ] Invariant cache hit.
[2023-03-19 23:45:25] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 4277 ms to find 0 implicit places.
[2023-03-19 23:45:25] [INFO ] Invariant cache hit.
[2023-03-19 23:45:29] [INFO ] Dead Transitions using invariants and state equation in 4251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9906 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 7}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=7 dest: 7}]], initial=2, aps=[p1:(NEQ s1538 1), p2:(OR (NEQ s548 1) (EQ s5205 1)), p0:(AND (EQ s4988 1) (EQ s4433 1) (EQ s4449 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11052 steps with 0 reset in 259 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-01 finished in 10747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2024 place count 4301 transition count 4197
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2032 place count 4297 transition count 4197
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5622 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2500 transition count 2401
Applied a total of 5623 rules in 1517 ms. Remains 2500 /5314 variables (removed 2814) and now considering 2401/5214 (removed 2813) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:45:31] [INFO ] Computed 900 place invariants in 28 ms
[2023-03-19 23:45:33] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2023-03-19 23:45:33] [INFO ] Invariant cache hit.
[2023-03-19 23:45:37] [INFO ] Implicit Places using invariants and state equation in 4009 ms returned []
Implicit Place search using SMT with State Equation took 5150 ms to find 0 implicit places.
[2023-03-19 23:45:37] [INFO ] Redundant transitions in 469 ms returned [2400]
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:37] [INFO ] Computed 900 place invariants in 8 ms
[2023-03-19 23:45:39] [INFO ] Dead Transitions using invariants and state equation in 2072 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5314 places, 2400/5214 transitions.
Applied a total of 0 rules in 112 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 9336 ms. Remains : 2500/5314 places, 2400/5214 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s412 1) (EQ s421 1) (EQ s427 1)), p0:(EQ s1616 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5110 steps with 0 reset in 117 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-02 finished in 9636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 1412 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-19 23:45:41] [INFO ] Computed 901 place invariants in 42 ms
[2023-03-19 23:45:43] [INFO ] Implicit Places using invariants in 2316 ms returned []
[2023-03-19 23:45:43] [INFO ] Invariant cache hit.
[2023-03-19 23:45:46] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 4609 ms to find 0 implicit places.
[2023-03-19 23:45:46] [INFO ] Invariant cache hit.
[2023-03-19 23:45:50] [INFO ] Dead Transitions using invariants and state equation in 4792 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10823 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s3696 1), p1:(AND (EQ s438 1) (EQ s454 1) (EQ s463 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-03 finished in 11158 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||G(p1))))'
Support contains 3 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5304 transition count 5204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5304 transition count 5204
Applied a total of 20 rules in 1464 ms. Remains 5304 /5314 variables (removed 10) and now considering 5204/5214 (removed 10) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2023-03-19 23:45:52] [INFO ] Computed 901 place invariants in 21 ms
[2023-03-19 23:45:55] [INFO ] Implicit Places using invariants in 2488 ms returned []
[2023-03-19 23:45:55] [INFO ] Invariant cache hit.
[2023-03-19 23:45:57] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
[2023-03-19 23:45:57] [INFO ] Invariant cache hit.
[2023-03-19 23:46:02] [INFO ] Dead Transitions using invariants and state equation in 4767 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5314 places, 5204/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10888 ms. Remains : 5304/5314 places, 5204/5214 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s291 1), p0:(AND (EQ s4420 0) (EQ s2684 0))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3585 ms.
Product exploration explored 100000 steps with 50000 reset in 3414 ms.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Computed a total of 1201 stabilizing places and 1201 stable transitions
Detected a total of 1201/5304 stabilizing places and 1201/5204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 152 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-05 finished in 18368 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((X((G((p1||G(p2))) U (!p3&&G((p1||G(p2))))))||p0))))'
Support contains 8 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1453 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:46:11] [INFO ] Computed 901 place invariants in 57 ms
[2023-03-19 23:46:13] [INFO ] Implicit Places using invariants in 2308 ms returned []
[2023-03-19 23:46:13] [INFO ] Invariant cache hit.
[2023-03-19 23:46:15] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
[2023-03-19 23:46:15] [INFO ] Invariant cache hit.
[2023-03-19 23:46:19] [INFO ] Dead Transitions using invariants and state equation in 4091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9991 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={1} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s3974 1) (NEQ s3992 1) (NEQ s3999 1) (NEQ s695 1) (NEQ s705 1) (NEQ s724 1)), p3:(AND (EQ s3974 1) (EQ s3992 1) (EQ s3999 1) (EQ s695 1) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3512 ms.
Product exploration explored 100000 steps with 50000 reset in 3434 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-06 finished in 17723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 1266 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-19 23:46:28] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-19 23:46:30] [INFO ] Implicit Places using invariants in 1861 ms returned []
[2023-03-19 23:46:30] [INFO ] Invariant cache hit.
[2023-03-19 23:46:32] [INFO ] Implicit Places using invariants and state equation in 2050 ms returned []
Implicit Place search using SMT with State Equation took 3925 ms to find 0 implicit places.
[2023-03-19 23:46:32] [INFO ] Invariant cache hit.
[2023-03-19 23:46:36] [INFO ] Dead Transitions using invariants and state equation in 4520 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9727 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s4754 1) (EQ s4770 1) (EQ s4779 1)), p1:(EQ s4031 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]]
Entered a terminal (fully accepting) state of product in 4076 steps with 0 reset in 59 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-07 finished in 10149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 1258 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
[2023-03-19 23:46:38] [INFO ] Invariant cache hit.
[2023-03-19 23:46:40] [INFO ] Implicit Places using invariants in 1999 ms returned []
[2023-03-19 23:46:40] [INFO ] Invariant cache hit.
[2023-03-19 23:46:42] [INFO ] Implicit Places using invariants and state equation in 2021 ms returned []
Implicit Place search using SMT with State Equation took 4044 ms to find 0 implicit places.
[2023-03-19 23:46:42] [INFO ] Invariant cache hit.
[2023-03-19 23:46:47] [INFO ] Dead Transitions using invariants and state equation in 4352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9673 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4849 1) (EQ s4864 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11976 steps with 0 reset in 197 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-08 finished in 10015 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||G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1218 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:46:48] [INFO ] Computed 901 place invariants in 23 ms
[2023-03-19 23:46:50] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2023-03-19 23:46:50] [INFO ] Invariant cache hit.
[2023-03-19 23:46:52] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 4171 ms to find 0 implicit places.
[2023-03-19 23:46:52] [INFO ] Invariant cache hit.
[2023-03-19 23:46:56] [INFO ] Dead Transitions using invariants and state equation in 3835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9227 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2768 1) (EQ s254 1)), p1:(AND (EQ s2199 1) (EQ s2201 1)), p2:(EQ s2768 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19469 steps with 1 reset in 273 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-09 finished in 9791 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))||G(p1)||(X(F(p2))&&G(p3))))'
Support contains 6 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5304 transition count 5204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5304 transition count 5204
Applied a total of 20 rules in 1339 ms. Remains 5304 /5314 variables (removed 10) and now considering 5204/5214 (removed 10) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2023-03-19 23:46:58] [INFO ] Computed 901 place invariants in 41 ms
[2023-03-19 23:47:00] [INFO ] Implicit Places using invariants in 2238 ms returned []
[2023-03-19 23:47:00] [INFO ] Invariant cache hit.
[2023-03-19 23:47:02] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 4284 ms to find 0 implicit places.
[2023-03-19 23:47:02] [INFO ] Invariant cache hit.
[2023-03-19 23:47:06] [INFO ] Dead Transitions using invariants and state equation in 3871 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5314 places, 5204/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9516 ms. Remains : 5304/5314 places, 5204/5214 transitions.
Stuttering acceptance computed with spot in 577 ms :[true, (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND p1 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p3 p0 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p3 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p3 p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p0) p2), acceptance={} source=4 dest: 8}, { cond=(AND p1 p3 p0 p2), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=4 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=4 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 p2), acceptance={} source=7 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p3 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=9 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=9 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=9 dest: 12}], [{ cond=(NOT p0), acceptance={} source=10 dest: 0}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(AND p1 p0), acceptance={} source=11 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p1), acceptance={} source=12 dest: 0}, { cond=p1, acceptance={} source=12 dest: 12}]], initial=2, aps=[p3:(EQ s3413 1), p2:(AND (EQ s1788 1) (EQ s1856 1)), p1:(OR (EQ s3406 0) (EQ s3451 0)), p0:(EQ s3215 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5383 steps with 0 reset in 90 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-10 finished in 10259 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)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5313 transition count 4713
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4813 transition count 4713
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4813 transition count 4213
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2024 place count 4301 transition count 4197
Deduced a syphon composed of 4 places in 17 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2032 place count 4297 transition count 4197
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5622 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2500 transition count 2401
Applied a total of 5623 rules in 1442 ms. Remains 2500 /5314 variables (removed 2814) and now considering 2401/5214 (removed 2813) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-19 23:47:08] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-19 23:47:10] [INFO ] Implicit Places using invariants in 1892 ms returned []
[2023-03-19 23:47:10] [INFO ] Invariant cache hit.
[2023-03-19 23:47:15] [INFO ] Implicit Places using invariants and state equation in 4834 ms returned []
Implicit Place search using SMT with State Equation took 6727 ms to find 0 implicit places.
[2023-03-19 23:47:16] [INFO ] Redundant transitions in 528 ms returned [2400]
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:47:16] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-19 23:47:18] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5314 places, 2400/5214 transitions.
Applied a total of 0 rules in 111 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 10953 ms. Remains : 2500/5314 places, 2400/5214 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1328 1) (EQ s1344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 45 reset in 1424 ms.
Product exploration explored 100000 steps with 45 reset in 1875 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2200 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=66 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2023-03-19 23:47:22] [INFO ] Invariant cache hit.
[2023-03-19 23:47:26] [INFO ] [Real]Absence check using 900 positive place invariants in 1001 ms returned sat
[2023-03-19 23:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:47:37] [INFO ] [Real]Absence check using state equation in 11554 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 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 98 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:47:37] [INFO ] Invariant cache hit.
[2023-03-19 23:47:39] [INFO ] Implicit Places using invariants in 1871 ms returned []
[2023-03-19 23:47:39] [INFO ] Invariant cache hit.
[2023-03-19 23:47:43] [INFO ] Implicit Places using invariants and state equation in 3598 ms returned []
Implicit Place search using SMT with State Equation took 5490 ms to find 0 implicit places.
[2023-03-19 23:47:43] [INFO ] Redundant transitions in 378 ms returned []
[2023-03-19 23:47:43] [INFO ] Invariant cache hit.
[2023-03-19 23:47:45] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7497 ms. Remains : 2500/2500 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2195 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
[2023-03-19 23:47:45] [INFO ] Invariant cache hit.
[2023-03-19 23:47:50] [INFO ] [Real]Absence check using 900 positive place invariants in 998 ms returned sat
[2023-03-19 23:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:00] [INFO ] [Real]Absence check using state equation in 10884 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 45 reset in 1434 ms.
Product exploration explored 100000 steps with 45 reset in 1909 ms.
Support contains 2 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 104 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-19 23:48:04] [INFO ] Invariant cache hit.
[2023-03-19 23:48:06] [INFO ] Implicit Places using invariants in 1488 ms returned []
[2023-03-19 23:48:06] [INFO ] Invariant cache hit.
[2023-03-19 23:48:09] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 5363 ms to find 0 implicit places.
[2023-03-19 23:48:10] [INFO ] Redundant transitions in 355 ms returned []
[2023-03-19 23:48:10] [INFO ] Invariant cache hit.
[2023-03-19 23:48:11] [INFO ] Dead Transitions using invariants and state equation in 1669 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7502 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLFireability-11 finished in 64861 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 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 998 place count 4814 transition count 4214
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1998 place count 4314 transition count 4214
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2010 place count 4302 transition count 4202
Iterating global reduction 2 with 12 rules applied. Total rules applied 2022 place count 4302 transition count 4202
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2022 place count 4302 transition count 4198
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2030 place count 4298 transition count 4198
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 12 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5614 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5616 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 2503 transition count 2404
Applied a total of 5617 rules in 1414 ms. Remains 2503 /5314 variables (removed 2811) and now considering 2404/5214 (removed 2810) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-19 23:48:13] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2023-03-19 23:48:15] [INFO ] Invariant cache hit.
[2023-03-19 23:48:19] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 5520 ms to find 0 implicit places.
[2023-03-19 23:48:19] [INFO ] Redundant transitions in 426 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:48:19] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-19 23:48:21] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5314 places, 2403/5214 transitions.
Applied a total of 0 rules in 100 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8954 ms. Remains : 2503/5314 places, 2403/5214 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2230 0), p1:(NEQ s2230 1), p0:(NEQ s349 1), p3:(EQ s349 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 353 reset in 1481 ms.
Product exploration explored 100000 steps with 400 reset in 1839 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 1144 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:48:27] [INFO ] Invariant cache hit.
[2023-03-19 23:48:27] [INFO ] [Real]Absence check using 900 positive place invariants in 199 ms returned sat
[2023-03-19 23:48:27] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:48:28] [INFO ] [Nat]Absence check using 900 positive place invariants in 200 ms returned sat
[2023-03-19 23:48:28] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 15 factoid took 1259 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 201 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:48:30] [INFO ] Invariant cache hit.
[2023-03-19 23:48:31] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2023-03-19 23:48:31] [INFO ] Invariant cache hit.
[2023-03-19 23:48:34] [INFO ] Implicit Places using invariants and state equation in 3322 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
[2023-03-19 23:48:34] [INFO ] Redundant transitions in 453 ms returned []
[2023-03-19 23:48:34] [INFO ] Invariant cache hit.
[2023-03-19 23:48:36] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6503 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Finished random walk after 2 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0))), (F (OR (AND p3 (NOT p2)) (AND (NOT p2) (NOT p0)))), (F (AND p3 (NOT p2) p0)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 541 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 429 reset in 1539 ms.
Product exploration explored 100000 steps with 547 reset in 1895 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 99 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:48:41] [INFO ] Invariant cache hit.
[2023-03-19 23:48:42] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2023-03-19 23:48:42] [INFO ] Invariant cache hit.
[2023-03-19 23:48:43] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
[2023-03-19 23:48:44] [INFO ] Redundant transitions in 269 ms returned []
[2023-03-19 23:48:44] [INFO ] Invariant cache hit.
[2023-03-19 23:48:45] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4344 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLFireability-12 finished in 33587 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((p1||X((p2||G(p3)))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1222 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:48:47] [INFO ] Computed 901 place invariants in 51 ms
[2023-03-19 23:48:49] [INFO ] Implicit Places using invariants in 2198 ms returned []
[2023-03-19 23:48:49] [INFO ] Invariant cache hit.
[2023-03-19 23:48:51] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 4252 ms to find 0 implicit places.
[2023-03-19 23:48:51] [INFO ] Invariant cache hit.
[2023-03-19 23:48:55] [INFO ] Dead Transitions using invariants and state equation in 4260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9750 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s2239 1), p1:(EQ s101 1), p2:(EQ s1123 1), p3:(EQ s3946 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-13 finished in 10271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 5 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1360 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:48:57] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-19 23:48:59] [INFO ] Implicit Places using invariants in 2262 ms returned []
[2023-03-19 23:48:59] [INFO ] Invariant cache hit.
[2023-03-19 23:49:01] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
[2023-03-19 23:49:01] [INFO ] Invariant cache hit.
[2023-03-19 23:49:06] [INFO ] Dead Transitions using invariants and state equation in 4735 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10283 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s464 1), p1:(OR (EQ s2576 1) (AND (EQ s4183 1) (EQ s4199 1) (EQ s4208 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-14 finished in 10549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2010 place count 4303 transition count 4203
Iterating global reduction 2 with 10 rules applied. Total rules applied 2020 place count 4303 transition count 4203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2020 place count 4303 transition count 4201
Deduced a syphon composed of 2 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 11 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5614 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5616 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 2503 transition count 2404
Applied a total of 5617 rules in 1524 ms. Remains 2503 /5314 variables (removed 2811) and now considering 2404/5214 (removed 2810) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-19 23:49:08] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-19 23:49:09] [INFO ] Implicit Places using invariants in 1474 ms returned []
[2023-03-19 23:49:09] [INFO ] Invariant cache hit.
[2023-03-19 23:49:13] [INFO ] Implicit Places using invariants and state equation in 3685 ms returned []
Implicit Place search using SMT with State Equation took 5176 ms to find 0 implicit places.
[2023-03-19 23:49:13] [INFO ] Redundant transitions in 326 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-19 23:49:13] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-19 23:49:15] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5314 places, 2403/5214 transitions.
Applied a total of 0 rules in 105 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8633 ms. Remains : 2503/5314 places, 2403/5214 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s1693 1), p1:(EQ s2489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27140 reset in 2159 ms.
Product exploration explored 100000 steps with 27309 reset in 2468 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 415 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 525 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2023-03-19 23:49:21] [INFO ] Invariant cache hit.
[2023-03-19 23:49:24] [INFO ] [Real]Absence check using 900 positive place invariants in 879 ms returned sat
[2023-03-19 23:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:49:36] [INFO ] [Real]Absence check using state equation in 11575 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 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.
Applied a total of 0 rules in 145 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-19 23:49:36] [INFO ] Invariant cache hit.
[2023-03-19 23:49:37] [INFO ] Implicit Places using invariants in 1510 ms returned []
[2023-03-19 23:49:37] [INFO ] Invariant cache hit.
[2023-03-19 23:49:41] [INFO ] Implicit Places using invariants and state equation in 3836 ms returned []
Implicit Place search using SMT with State Equation took 5362 ms to find 0 implicit places.
[2023-03-19 23:49:42] [INFO ] Redundant transitions in 464 ms returned []
[2023-03-19 23:49:42] [INFO ] Invariant cache hit.
[2023-03-19 23:49:43] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7572 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 253 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-19 23:49:44] [INFO ] Invariant cache hit.
[2023-03-19 23:49:48] [INFO ] [Real]Absence check using 900 positive place invariants in 943 ms returned sat
[2023-03-19 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:49:59] [INFO ] [Real]Absence check using state equation in 11451 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27022 reset in 2071 ms.
Product exploration explored 100000 steps with 27258 reset in 2458 ms.
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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 260 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:50:04] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-19 23:50:06] [INFO ] Implicit Places using invariants in 1672 ms returned []
[2023-03-19 23:50:06] [INFO ] Invariant cache hit.
[2023-03-19 23:50:09] [INFO ] Implicit Places using invariants and state equation in 3638 ms returned []
Implicit Place search using SMT with State Equation took 5337 ms to find 0 implicit places.
[2023-03-19 23:50:10] [INFO ] Redundant transitions in 339 ms returned []
[2023-03-19 23:50:10] [INFO ] Invariant cache hit.
[2023-03-19 23:50:11] [INFO ] Dead Transitions using invariants and state equation in 1379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7334 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLFireability-15 finished in 65084 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)))'
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 U (G(p0)||(p0&&G(p1))))||(F(p2)&&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(p0)||G(p1)))'
[2023-03-19 23:50:12] [INFO ] Flatten gal took : 170 ms
[2023-03-19 23:50:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 23:50:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5314 places, 5214 transitions and 16428 arcs took 42 ms.
Total runtime 431908 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
LTLFireability

BK_STOP 1679269961660

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-100B-LTLFireability-12
lola: time limit : 1198 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-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1198 3/32 ShieldIIPs-PT-100B-LTLFireability-12 114762 m, 22952 m/sec, 355086 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1198 6/32 ShieldIIPs-PT-100B-LTLFireability-12 290344 m, 35116 m/sec, 912786 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1198 10/32 ShieldIIPs-PT-100B-LTLFireability-12 458554 m, 33642 m/sec, 1469505 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1198 13/32 ShieldIIPs-PT-100B-LTLFireability-12 627318 m, 33752 m/sec, 2024483 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1198 16/32 ShieldIIPs-PT-100B-LTLFireability-12 797669 m, 34070 m/sec, 2581616 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1198 19/32 ShieldIIPs-PT-100B-LTLFireability-12 968555 m, 34177 m/sec, 3135931 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1198 23/32 ShieldIIPs-PT-100B-LTLFireability-12 1133823 m, 33053 m/sec, 3691354 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1198 26/32 ShieldIIPs-PT-100B-LTLFireability-12 1299486 m, 33132 m/sec, 4246273 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1198 29/32 ShieldIIPs-PT-100B-LTLFireability-12 1464646 m, 33032 m/sec, 4800228 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1198 32/32 ShieldIIPs-PT-100B-LTLFireability-12 1635461 m, 34163 m/sec, 5356185 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 59 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPs-PT-100B-LTLFireability-15
lola: time limit : 1770 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-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1770 3/32 ShieldIIPs-PT-100B-LTLFireability-15 309905 m, 61981 m/sec, 435307 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1770 6/32 ShieldIIPs-PT-100B-LTLFireability-15 634148 m, 64848 m/sec, 900751 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1770 8/32 ShieldIIPs-PT-100B-LTLFireability-15 954316 m, 64033 m/sec, 1362631 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1770 10/32 ShieldIIPs-PT-100B-LTLFireability-15 1269730 m, 63082 m/sec, 1824987 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1770 13/32 ShieldIIPs-PT-100B-LTLFireability-15 1595375 m, 65129 m/sec, 2286391 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1770 15/32 ShieldIIPs-PT-100B-LTLFireability-15 1920918 m, 65108 m/sec, 2754472 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1770 18/32 ShieldIIPs-PT-100B-LTLFireability-15 2254963 m, 66809 m/sec, 3216062 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1770 20/32 ShieldIIPs-PT-100B-LTLFireability-15 2583910 m, 65789 m/sec, 3690249 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1770 23/32 ShieldIIPs-PT-100B-LTLFireability-15 2911725 m, 65563 m/sec, 4158809 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1770 25/32 ShieldIIPs-PT-100B-LTLFireability-15 3233911 m, 64437 m/sec, 4628575 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1770 28/32 ShieldIIPs-PT-100B-LTLFireability-15 3560056 m, 65229 m/sec, 5100499 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1770 30/32 ShieldIIPs-PT-100B-LTLFireability-15 3871243 m, 62237 m/sec, 5564326 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 124 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-100B-LTLFireability-11
lola: time limit : 3476 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-100B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3476 8/32 ShieldIIPs-PT-100B-LTLFireability-11 315624 m, 63124 m/sec, 440945 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3476 16/32 ShieldIIPs-PT-100B-LTLFireability-11 635232 m, 63921 m/sec, 897319 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3476 23/32 ShieldIIPs-PT-100B-LTLFireability-11 956548 m, 64263 m/sec, 1358569 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3476 31/32 ShieldIIPs-PT-100B-LTLFireability-11 1270950 m, 62880 m/sec, 1804720 t fired, .

Time elapsed: 144 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldIIPs-PT-100B-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-100B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100B-LTLFireability-11: LTL unknown AGGR
ShieldIIPs-PT-100B-LTLFireability-12: LTL unknown AGGR
ShieldIIPs-PT-100B-LTLFireability-15: LTL unknown AGGR


Time elapsed: 149 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-100B"
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-100B, 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-167903715000172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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