fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903714900156
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldIIPs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1530.115 495648.00 587552.00 104.20 TFTFFFFFF?FF?F?? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 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.7K 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.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 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 846K 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-050B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679268537184

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-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:29:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:29:00] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-19 23:29:00] [INFO ] Transformed 3003 places.
[2023-03-19 23:29:00] [INFO ] Transformed 2953 transitions.
[2023-03-19 23:29:00] [INFO ] Found NUPN structural information;
[2023-03-19 23:29:00] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 347 places :
Symmetric choice reduction at 0 with 347 rule applications. Total rules 347 place count 2656 transition count 2606
Iterating global reduction 0 with 347 rules applied. Total rules applied 694 place count 2656 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 695 place count 2655 transition count 2605
Iterating global reduction 0 with 1 rules applied. Total rules applied 696 place count 2655 transition count 2605
Applied a total of 696 rules in 929 ms. Remains 2655 /3003 variables (removed 348) and now considering 2605/2953 (removed 348) transitions.
// Phase 1: matrix 2605 rows 2655 cols
[2023-03-19 23:29:02] [INFO ] Computed 451 place invariants in 68 ms
[2023-03-19 23:29:04] [INFO ] Implicit Places using invariants in 2296 ms returned []
[2023-03-19 23:29:04] [INFO ] Invariant cache hit.
[2023-03-19 23:29:09] [INFO ] Implicit Places using invariants and state equation in 5478 ms returned []
Implicit Place search using SMT with State Equation took 7960 ms to find 0 implicit places.
[2023-03-19 23:29:10] [INFO ] Invariant cache hit.
[2023-03-19 23:29:12] [INFO ] Dead Transitions using invariants and state equation in 2788 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2655/3003 places, 2605/2953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11690 ms. Remains : 2655/3003 places, 2605/2953 transitions.
Support contains 44 out of 2655 places after structural reductions.
[2023-03-19 23:29:13] [INFO ] Flatten gal took : 205 ms
[2023-03-19 23:29:13] [INFO ] Flatten gal took : 124 ms
[2023-03-19 23:29:13] [INFO ] Input system was already deterministic with 2605 transitions.
Support contains 42 out of 2655 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 23:29:14] [INFO ] Invariant cache hit.
[2023-03-19 23:29:15] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 23:29:17] [INFO ] [Nat]Absence check using 451 positive place invariants in 235 ms returned sat
[2023-03-19 23:29:20] [INFO ] After 3085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 23:29:22] [INFO ] Deduced a trap composed of 20 places in 1090 ms of which 29 ms to minimize.
[2023-03-19 23:29:23] [INFO ] Deduced a trap composed of 26 places in 1086 ms of which 7 ms to minimize.
[2023-03-19 23:29:24] [INFO ] Deduced a trap composed of 30 places in 814 ms of which 16 ms to minimize.
[2023-03-19 23:29:25] [INFO ] Deduced a trap composed of 26 places in 800 ms of which 27 ms to minimize.
[2023-03-19 23:29:26] [INFO ] Deduced a trap composed of 21 places in 985 ms of which 2 ms to minimize.
[2023-03-19 23:29:26] [INFO ] Deduced a trap composed of 26 places in 771 ms of which 2 ms to minimize.
[2023-03-19 23:29:27] [INFO ] Deduced a trap composed of 27 places in 815 ms of which 26 ms to minimize.
[2023-03-19 23:29:28] [INFO ] Deduced a trap composed of 26 places in 699 ms of which 1 ms to minimize.
[2023-03-19 23:29:29] [INFO ] Deduced a trap composed of 35 places in 836 ms of which 2 ms to minimize.
[2023-03-19 23:29:30] [INFO ] Deduced a trap composed of 39 places in 802 ms of which 1 ms to minimize.
[2023-03-19 23:29:31] [INFO ] Deduced a trap composed of 34 places in 653 ms of which 1 ms to minimize.
[2023-03-19 23:29:32] [INFO ] Deduced a trap composed of 19 places in 869 ms of which 1 ms to minimize.
[2023-03-19 23:29:33] [INFO ] Deduced a trap composed of 33 places in 575 ms of which 3 ms to minimize.
[2023-03-19 23:29:33] [INFO ] Deduced a trap composed of 34 places in 559 ms of which 23 ms to minimize.
[2023-03-19 23:29:34] [INFO ] Deduced a trap composed of 34 places in 1008 ms of which 2 ms to minimize.
[2023-03-19 23:29:35] [INFO ] Deduced a trap composed of 23 places in 779 ms of which 2 ms to minimize.
[2023-03-19 23:29:36] [INFO ] Deduced a trap composed of 22 places in 610 ms of which 2 ms to minimize.
[2023-03-19 23:29:37] [INFO ] Deduced a trap composed of 28 places in 1086 ms of which 1 ms to minimize.
[2023-03-19 23:29:38] [INFO ] Deduced a trap composed of 25 places in 976 ms of which 2 ms to minimize.
[2023-03-19 23:29:39] [INFO ] Deduced a trap composed of 32 places in 787 ms of which 1 ms to minimize.
[2023-03-19 23:29:40] [INFO ] Deduced a trap composed of 39 places in 745 ms of which 2 ms to minimize.
[2023-03-19 23:29:41] [INFO ] Deduced a trap composed of 46 places in 686 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:29:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:29:41] [INFO ] After 25612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1265 ms.
Support contains 19 out of 2655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2655 transition count 2355
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2405 transition count 2355
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2405 transition count 2104
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2154 transition count 2104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1004 place count 2152 transition count 2102
Iterating global reduction 2 with 2 rules applied. Total rules applied 1006 place count 2152 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1006 place count 2152 transition count 2100
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1010 place count 2150 transition count 2100
Performed 889 Post agglomeration using F-continuation condition.Transition count delta: 889
Deduced a syphon composed of 889 places in 5 ms
Reduce places removed 889 places and 0 transitions.
Iterating global reduction 2 with 1778 rules applied. Total rules applied 2788 place count 1261 transition count 1211
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 335 times.
Drop transitions removed 335 transitions
Iterating global reduction 2 with 335 rules applied. Total rules applied 3123 place count 1261 transition count 1211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3124 place count 1260 transition count 1210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3125 place count 1259 transition count 1210
Applied a total of 3125 rules in 1008 ms. Remains 1259 /2655 variables (removed 1396) and now considering 1210/2605 (removed 1395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1008 ms. Remains : 1259/2655 places, 1210/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 10) seen :9
Finished Best-First random walk after 662 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=132 )
FORMULA ShieldIIPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPs-PT-050B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 601 stabilizing places and 601 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F(p1))||X(G(p0))))'
Support contains 2 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 371 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-19 23:29:44] [INFO ] Computed 451 place invariants in 50 ms
[2023-03-19 23:29:46] [INFO ] Implicit Places using invariants in 1954 ms returned []
[2023-03-19 23:29:46] [INFO ] Invariant cache hit.
[2023-03-19 23:29:50] [INFO ] Implicit Places using invariants and state equation in 3731 ms returned []
Implicit Place search using SMT with State Equation took 5704 ms to find 0 implicit places.
[2023-03-19 23:29:50] [INFO ] Invariant cache hit.
[2023-03-19 23:29:53] [INFO ] Dead Transitions using invariants and state equation in 2499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8588 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 463 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1076 1), p0:(NEQ s1603 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1616 ms.
Product exploration explored 100000 steps with 50000 reset in 1369 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/2652 stabilizing places and 599/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-00 finished in 12471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 334 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
[2023-03-19 23:29:57] [INFO ] Invariant cache hit.
[2023-03-19 23:29:58] [INFO ] Implicit Places using invariants in 1611 ms returned []
[2023-03-19 23:29:58] [INFO ] Invariant cache hit.
[2023-03-19 23:30:02] [INFO ] Implicit Places using invariants and state equation in 3780 ms returned []
Implicit Place search using SMT with State Equation took 5422 ms to find 0 implicit places.
[2023-03-19 23:30:02] [INFO ] Invariant cache hit.
[2023-03-19 23:30:04] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7317 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2248 1) (EQ s2270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-01 finished in 7525 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)||X(p1))))'
Support contains 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 345 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
[2023-03-19 23:30:04] [INFO ] Invariant cache hit.
[2023-03-19 23:30:05] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2023-03-19 23:30:05] [INFO ] Invariant cache hit.
[2023-03-19 23:30:09] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 5251 ms to find 0 implicit places.
[2023-03-19 23:30:09] [INFO ] Invariant cache hit.
[2023-03-19 23:30:12] [INFO ] Dead Transitions using invariants and state equation in 2119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7727 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s307 0), p1:(OR (EQ s356 0) (EQ s2329 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1324 ms.
Product exploration explored 100000 steps with 50000 reset in 1248 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-02 finished in 10594 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||X((G(!p1) U (p0&&G(!p1))))))))'
Support contains 4 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2654 transition count 2354
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2404 transition count 2354
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2404 transition count 2103
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2153 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1005 place count 2150 transition count 2100
Iterating global reduction 2 with 3 rules applied. Total rules applied 1008 place count 2150 transition count 2100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1008 place count 2150 transition count 2099
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 4 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2796 place count 1256 transition count 1206
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 2798 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 1253 transition count 1204
Applied a total of 2799 rules in 603 ms. Remains 1253 /2655 variables (removed 1402) and now considering 1204/2605 (removed 1401) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2023-03-19 23:30:15] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-19 23:30:16] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-19 23:30:16] [INFO ] Invariant cache hit.
[2023-03-19 23:30:18] [INFO ] Implicit Places using invariants and state equation in 1801 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2023-03-19 23:30:18] [INFO ] Redundant transitions in 289 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-19 23:30:18] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:30:19] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2655 places, 1203/2605 transitions.
Applied a total of 0 rules in 38 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4141 ms. Remains : 1253/2655 places, 1203/2605 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1003 1), p1:(AND (EQ s1012 1) (EQ s1019 1) (EQ s1030 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2654 steps with 0 reset in 57 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-03 finished in 4438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(X(p2)&&p1))))'
Support contains 5 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2653 transition count 2603
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2653 transition count 2603
Applied a total of 4 rules in 288 ms. Remains 2653 /2655 variables (removed 2) and now considering 2603/2605 (removed 2) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-19 23:30:19] [INFO ] Computed 451 place invariants in 20 ms
[2023-03-19 23:30:20] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2023-03-19 23:30:20] [INFO ] Invariant cache hit.
[2023-03-19 23:30:25] [INFO ] Implicit Places using invariants and state equation in 4189 ms returned []
Implicit Place search using SMT with State Equation took 5432 ms to find 0 implicit places.
[2023-03-19 23:30:25] [INFO ] Invariant cache hit.
[2023-03-19 23:30:28] [INFO ] Dead Transitions using invariants and state equation in 2879 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2655 places, 2603/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8600 ms. Remains : 2653/2655 places, 2603/2605 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s1018 1), p1:(AND (EQ s1324 1) (EQ s1340 1) (EQ s1349 1)), p2:(EQ s2185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5761 steps with 0 reset in 72 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-04 finished in 8929 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((F(p1)&&p0))))'
Support contains 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2653 transition count 2603
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2653 transition count 2603
Applied a total of 4 rules in 376 ms. Remains 2653 /2655 variables (removed 2) and now considering 2603/2605 (removed 2) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-19 23:30:28] [INFO ] Computed 451 place invariants in 22 ms
[2023-03-19 23:30:30] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2023-03-19 23:30:30] [INFO ] Invariant cache hit.
[2023-03-19 23:30:33] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 4879 ms to find 0 implicit places.
[2023-03-19 23:30:33] [INFO ] Invariant cache hit.
[2023-03-19 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 2438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2655 places, 2603/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7710 ms. Remains : 2653/2655 places, 2603/2605 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1524 1) (EQ s1539 1)), p1:(EQ s1397 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-05 finished in 8026 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)&&F(p1)))'
Support contains 2 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 4 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 2802 place count 1253 transition count 1203
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 2804 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2805 place count 1250 transition count 1201
Applied a total of 2805 rules in 539 ms. Remains 1250 /2655 variables (removed 1405) and now considering 1201/2605 (removed 1404) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2023-03-19 23:30:36] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:30:37] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-19 23:30:37] [INFO ] Invariant cache hit.
[2023-03-19 23:30:40] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 3431 ms to find 0 implicit places.
[2023-03-19 23:30:40] [INFO ] Redundant transitions in 205 ms returned [1200]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2023-03-19 23:30:40] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:30:41] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/2655 places, 1200/2605 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4944 ms. Remains : 1250/2655 places, 1200/2605 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s480 1), p0:(EQ s701 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3823 steps with 1 reset in 36 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-08 finished in 5223 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)||G(p2))))'
Support contains 4 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 7 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1006 place count 2150 transition count 2100
Iterating global reduction 2 with 2 rules applied. Total rules applied 1008 place count 2150 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1008 place count 2150 transition count 2098
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1012 place count 2148 transition count 2098
Performed 890 Post agglomeration using F-continuation condition.Transition count delta: 890
Deduced a syphon composed of 890 places in 3 ms
Reduce places removed 890 places and 0 transitions.
Iterating global reduction 2 with 1780 rules applied. Total rules applied 2792 place count 1258 transition count 1208
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 2794 place count 1256 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 1255 transition count 1206
Applied a total of 2795 rules in 585 ms. Remains 1255 /2655 variables (removed 1400) and now considering 1206/2605 (removed 1399) transitions.
// Phase 1: matrix 1206 rows 1255 cols
[2023-03-19 23:30:42] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-19 23:30:42] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-19 23:30:42] [INFO ] Invariant cache hit.
[2023-03-19 23:30:44] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
[2023-03-19 23:30:44] [INFO ] Redundant transitions in 273 ms returned [1205]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-19 23:30:44] [INFO ] Computed 450 place invariants in 6 ms
[2023-03-19 23:30:45] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1255/2655 places, 1205/2605 transitions.
Applied a total of 0 rules in 31 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4170 ms. Remains : 1255/2655 places, 1205/2605 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s164 0) (EQ s186 0)), p1:(EQ s656 1), p2:(EQ s695 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39 reset in 1029 ms.
Product exploration explored 100000 steps with 38 reset in 1198 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/1255 stabilizing places and 3/1205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 1471 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:30:50] [INFO ] Invariant cache hit.
[2023-03-19 23:30:50] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:30:51] [INFO ] [Nat]Absence check using 450 positive place invariants in 104 ms returned sat
[2023-03-19 23:30:51] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:30:52] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2023-03-19 23:30:52] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-19 23:30:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2023-03-19 23:30:52] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-19 23:30:52] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-19 23:30:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2023-03-19 23:30:53] [INFO ] After 2091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-19 23:30:53] [INFO ] After 2877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 170 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1255 transition count 1205
Applied a total of 298 rules in 130 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 103161 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103161 steps, saw 101679 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-19 23:30:57] [INFO ] Computed 450 place invariants in 37 ms
[2023-03-19 23:30:57] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:30:57] [INFO ] [Nat]Absence check using 450 positive place invariants in 110 ms returned sat
[2023-03-19 23:30:58] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:30:59] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2023-03-19 23:30:59] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-19 23:30:59] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-19 23:30:59] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2023-03-19 23:31:00] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-19 23:31:00] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-19 23:31:00] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2023-03-19 23:31:00] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2023-03-19 23:31:00] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-19 23:31:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1793 ms
[2023-03-19 23:31:01] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2023-03-19 23:31:01] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-19 23:31:01] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-19 23:31:01] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-19 23:31:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 886 ms
[2023-03-19 23:31:02] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2023-03-19 23:31:02] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2023-03-19 23:31:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2023-03-19 23:31:02] [INFO ] After 4334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-19 23:31:02] [INFO ] After 5179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 160 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 34 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 38 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-19 23:31:03] [INFO ] Invariant cache hit.
[2023-03-19 23:31:04] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2023-03-19 23:31:04] [INFO ] Invariant cache hit.
[2023-03-19 23:31:06] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3537 ms to find 0 implicit places.
[2023-03-19 23:31:06] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-19 23:31:06] [INFO ] Invariant cache hit.
[2023-03-19 23:31:07] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4327 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 33 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 23:31:07] [INFO ] Invariant cache hit.
[2023-03-19 23:31:07] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:31:08] [INFO ] [Nat]Absence check using 450 positive place invariants in 101 ms returned sat
[2023-03-19 23:31:09] [INFO ] After 1044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:31:09] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:31:09] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-19 23:31:09] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:31:10] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:31:10] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2023-03-19 23:31:10] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 13 ms to minimize.
[2023-03-19 23:31:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1194 ms
[2023-03-19 23:31:10] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-19 23:31:10] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 44 ms to minimize.
[2023-03-19 23:31:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2023-03-19 23:31:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-19 23:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-19 23:31:11] [INFO ] After 3033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-19 23:31:11] [INFO ] After 3906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1362 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 34 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-19 23:31:13] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:31:13] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-19 23:31:14] [INFO ] Invariant cache hit.
[2023-03-19 23:31:16] [INFO ] Implicit Places using invariants and state equation in 2062 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
[2023-03-19 23:31:16] [INFO ] Redundant transitions in 359 ms returned []
[2023-03-19 23:31:16] [INFO ] Invariant cache hit.
[2023-03-19 23:31:17] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3950 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/1255 stabilizing places and 3/1205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 1315 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 23:31:19] [INFO ] Invariant cache hit.
[2023-03-19 23:31:19] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:31:19] [INFO ] [Nat]Absence check using 450 positive place invariants in 83 ms returned sat
[2023-03-19 23:31:20] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:31:21] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 13 ms to minimize.
[2023-03-19 23:31:21] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-19 23:31:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2023-03-19 23:31:21] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 13 ms to minimize.
[2023-03-19 23:31:21] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-19 23:31:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2023-03-19 23:31:22] [INFO ] After 2047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-19 23:31:22] [INFO ] After 2850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 270 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1255 transition count 1205
Applied a total of 298 rules in 59 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92910 steps, run timeout after 3006 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92910 steps, saw 91637 distinct states, run finished after 3006 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-19 23:31:26] [INFO ] Computed 450 place invariants in 28 ms
[2023-03-19 23:31:26] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:31:27] [INFO ] [Nat]Absence check using 450 positive place invariants in 179 ms returned sat
[2023-03-19 23:31:28] [INFO ] After 852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:31:28] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2023-03-19 23:31:28] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2023-03-19 23:31:29] [INFO ] Deduced a trap composed of 6 places in 511 ms of which 1 ms to minimize.
[2023-03-19 23:31:29] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-19 23:31:29] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:31:29] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-19 23:31:29] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:31:30] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2023-03-19 23:31:30] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 0 ms to minimize.
[2023-03-19 23:31:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2292 ms
[2023-03-19 23:31:30] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-19 23:31:31] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 13 ms to minimize.
[2023-03-19 23:31:31] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 15 ms to minimize.
[2023-03-19 23:31:31] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:31:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 940 ms
[2023-03-19 23:31:31] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2023-03-19 23:31:32] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2023-03-19 23:31:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2023-03-19 23:31:32] [INFO ] After 4772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-19 23:31:32] [INFO ] After 5641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 132 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 55 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 65 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-19 23:31:32] [INFO ] Invariant cache hit.
[2023-03-19 23:31:33] [INFO ] Implicit Places using invariants in 916 ms returned []
[2023-03-19 23:31:33] [INFO ] Invariant cache hit.
[2023-03-19 23:31:36] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 3436 ms to find 0 implicit places.
[2023-03-19 23:31:36] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-19 23:31:36] [INFO ] Invariant cache hit.
[2023-03-19 23:31:37] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4740 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 31 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 23:31:37] [INFO ] Invariant cache hit.
[2023-03-19 23:31:37] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:31:37] [INFO ] [Nat]Absence check using 450 positive place invariants in 80 ms returned sat
[2023-03-19 23:31:38] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:31:39] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2023-03-19 23:31:39] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:31:39] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2023-03-19 23:31:39] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-19 23:31:39] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2023-03-19 23:31:40] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-19 23:31:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1226 ms
[2023-03-19 23:31:40] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-19 23:31:40] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-19 23:31:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2023-03-19 23:31:41] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2023-03-19 23:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-03-19 23:31:41] [INFO ] After 3196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-19 23:31:41] [INFO ] After 3887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1255 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 39 reset in 1027 ms.
Product exploration explored 100000 steps with 39 reset in 1139 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 74 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-19 23:31:45] [INFO ] Computed 450 place invariants in 16 ms
[2023-03-19 23:31:45] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-19 23:31:45] [INFO ] Invariant cache hit.
[2023-03-19 23:31:48] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2023-03-19 23:31:48] [INFO ] Redundant transitions in 264 ms returned []
[2023-03-19 23:31:48] [INFO ] Invariant cache hit.
[2023-03-19 23:31:49] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4324 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-09 finished in 68200 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)&&G(p1))))'
Support contains 5 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 336 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-19 23:31:50] [INFO ] Computed 451 place invariants in 30 ms
[2023-03-19 23:31:51] [INFO ] Implicit Places using invariants in 1553 ms returned []
[2023-03-19 23:31:51] [INFO ] Invariant cache hit.
[2023-03-19 23:31:55] [INFO ] Implicit Places using invariants and state equation in 3698 ms returned []
Implicit Place search using SMT with State Equation took 5280 ms to find 0 implicit places.
[2023-03-19 23:31:55] [INFO ] Invariant cache hit.
[2023-03-19 23:31:58] [INFO ] Dead Transitions using invariants and state equation in 2704 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8322 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s2361 0) (EQ s2369 0) (EQ s2390 0)), p0:(AND (EQ s2523 1) (EQ s2567 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26400 steps with 4 reset in 255 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-10 finished in 8818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 9 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2798 place count 1255 transition count 1205
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 2800 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 1252 transition count 1203
Applied a total of 2801 rules in 560 ms. Remains 1252 /2655 variables (removed 1403) and now considering 1203/2605 (removed 1402) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2023-03-19 23:31:59] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-19 23:31:59] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-19 23:31:59] [INFO ] Invariant cache hit.
[2023-03-19 23:32:01] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
[2023-03-19 23:32:02] [INFO ] Redundant transitions in 186 ms returned [1202]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-19 23:32:02] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-19 23:32:02] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/2655 places, 1202/2605 transitions.
Applied a total of 0 rules in 36 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4355 ms. Remains : 1252/2655 places, 1202/2605 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s1054 1), p1:(OR (NEQ s833 1) (NEQ s848 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 162 reset in 920 ms.
Product exploration explored 100000 steps with 155 reset in 1118 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/1252 stabilizing places and 2/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (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 4 factoid took 334 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 955 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 420 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 46 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-19 23:32:06] [INFO ] Invariant cache hit.
[2023-03-19 23:32:07] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-19 23:32:07] [INFO ] Invariant cache hit.
[2023-03-19 23:32:09] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2496 ms to find 0 implicit places.
[2023-03-19 23:32:09] [INFO ] Redundant transitions in 244 ms returned []
[2023-03-19 23:32:09] [INFO ] Invariant cache hit.
[2023-03-19 23:32:10] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3732 ms. Remains : 1252/1252 places, 1202/1202 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/1252 stabilizing places and 2/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (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 4 factoid took 384 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 3491 steps, including 1 resets, run visited all 2 properties in 34 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 126 reset in 963 ms.
Product exploration explored 100000 steps with 157 reset in 1115 ms.
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 29 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-19 23:32:14] [INFO ] Invariant cache hit.
[2023-03-19 23:32:15] [INFO ] Implicit Places using invariants in 964 ms returned []
[2023-03-19 23:32:15] [INFO ] Invariant cache hit.
[2023-03-19 23:32:17] [INFO ] Implicit Places using invariants and state equation in 2299 ms returned []
Implicit Place search using SMT with State Equation took 3326 ms to find 0 implicit places.
[2023-03-19 23:32:17] [INFO ] Redundant transitions in 240 ms returned []
[2023-03-19 23:32:17] [INFO ] Invariant cache hit.
[2023-03-19 23:32:18] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4389 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-12 finished in 20018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 3 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2800 place count 1254 transition count 1204
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 2802 place count 1252 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2803 place count 1251 transition count 1202
Applied a total of 2803 rules in 450 ms. Remains 1251 /2655 variables (removed 1404) and now considering 1202/2605 (removed 1403) transitions.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-19 23:32:19] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-19 23:32:19] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-19 23:32:19] [INFO ] Invariant cache hit.
[2023-03-19 23:32:21] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2023-03-19 23:32:21] [INFO ] Redundant transitions in 187 ms returned [1201]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-19 23:32:21] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-19 23:32:22] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/2655 places, 1201/2605 transitions.
Applied a total of 0 rules in 32 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3600 ms. Remains : 1251/2655 places, 1201/2605 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s678 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27298 reset in 978 ms.
Product exploration explored 100000 steps with 27212 reset in 1178 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/1251 stabilizing places and 2/1201 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 203 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 45 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(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 280 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
[2023-03-19 23:32:25] [INFO ] Invariant cache hit.
[2023-03-19 23:32:26] [INFO ] [Real]Absence check using 450 positive place invariants in 329 ms returned sat
[2023-03-19 23:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:32:29] [INFO ] [Real]Absence check using state equation in 3478 ms returned sat
[2023-03-19 23:32:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:32:31] [INFO ] [Nat]Absence check using 450 positive place invariants in 254 ms returned sat
[2023-03-19 23:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:32:35] [INFO ] [Nat]Absence check using state equation in 3607 ms returned sat
[2023-03-19 23:32:35] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-19 23:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-19 23:32:35] [INFO ] Computed and/alt/rep : 1197/2988/1197 causal constraints (skipped 2 transitions) in 107 ms.
[2023-03-19 23:32:45] [INFO ] Added : 345 causal constraints over 69 iterations in 9864 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 84 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-19 23:32:45] [INFO ] Invariant cache hit.
[2023-03-19 23:32:46] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2023-03-19 23:32:46] [INFO ] Invariant cache hit.
[2023-03-19 23:32:48] [INFO ] Implicit Places using invariants and state equation in 1835 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2023-03-19 23:32:48] [INFO ] Redundant transitions in 262 ms returned []
[2023-03-19 23:32:48] [INFO ] Invariant cache hit.
[2023-03-19 23:32:49] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3960 ms. Remains : 1251/1251 places, 1201/1201 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/1251 stabilizing places and 2/1201 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 220 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 68 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
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 281 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 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-19 23:32:49] [INFO ] Invariant cache hit.
[2023-03-19 23:32:51] [INFO ] [Real]Absence check using 450 positive place invariants in 273 ms returned sat
[2023-03-19 23:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:32:53] [INFO ] [Real]Absence check using state equation in 2644 ms returned sat
[2023-03-19 23:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:32:55] [INFO ] [Nat]Absence check using 450 positive place invariants in 261 ms returned sat
[2023-03-19 23:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:32:58] [INFO ] [Nat]Absence check using state equation in 3379 ms returned sat
[2023-03-19 23:32:58] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-03-19 23:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-19 23:32:58] [INFO ] Computed and/alt/rep : 1197/2988/1197 causal constraints (skipped 2 transitions) in 100 ms.
[2023-03-19 23:33:09] [INFO ] Added : 365 causal constraints over 73 iterations in 10168 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27139 reset in 1130 ms.
Product exploration explored 100000 steps with 27313 reset in 1174 ms.
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-19 23:33:11] [INFO ] Invariant cache hit.
[2023-03-19 23:33:12] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-19 23:33:12] [INFO ] Invariant cache hit.
[2023-03-19 23:33:13] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2401 ms to find 0 implicit places.
[2023-03-19 23:33:14] [INFO ] Redundant transitions in 421 ms returned []
[2023-03-19 23:33:14] [INFO ] Invariant cache hit.
[2023-03-19 23:33:14] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3547 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-14 finished in 56391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 4 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 2 with 1790 rules applied. Total rules applied 2804 place count 1252 transition count 1202
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 2806 place count 1250 transition count 1200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 1249 transition count 1200
Applied a total of 2807 rules in 524 ms. Remains 1249 /2655 variables (removed 1406) and now considering 1200/2605 (removed 1405) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2023-03-19 23:33:15] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-19 23:33:16] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-19 23:33:16] [INFO ] Invariant cache hit.
[2023-03-19 23:33:18] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
[2023-03-19 23:33:19] [INFO ] Redundant transitions in 1163 ms returned [1199]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2023-03-19 23:33:19] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-19 23:33:21] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/2655 places, 1199/2605 transitions.
Applied a total of 0 rules in 35 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6133 ms. Remains : 1249/2655 places, 1199/2605 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s12 1) (NEQ s21 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39 reset in 888 ms.
Product exploration explored 100000 steps with 39 reset in 1038 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 7552 steps, including 2 resets, run visited all 1 properties in 109 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 69 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-19 23:33:24] [INFO ] Invariant cache hit.
[2023-03-19 23:33:24] [INFO ] Implicit Places using invariants in 844 ms returned []
[2023-03-19 23:33:24] [INFO ] Invariant cache hit.
[2023-03-19 23:33:26] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
[2023-03-19 23:33:26] [INFO ] Redundant transitions in 407 ms returned []
[2023-03-19 23:33:26] [INFO ] Invariant cache hit.
[2023-03-19 23:33:27] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3671 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 166525 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166525 steps, saw 121918 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:33:30] [INFO ] Invariant cache hit.
[2023-03-19 23:33:31] [INFO ] [Real]Absence check using 450 positive place invariants in 65 ms returned sat
[2023-03-19 23:33:31] [INFO ] After 890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:33:32] [INFO ] [Nat]Absence check using 450 positive place invariants in 77 ms returned sat
[2023-03-19 23:33:32] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:33:32] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 23:33:32] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1249 transition count 1199
Applied a total of 296 rules in 125 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished probabilistic random walk after 62393 steps, run visited all 1 properties in 628 ms. (steps per millisecond=99 )
Probabilistic random walk after 62393 steps, saw 61572 distinct states, run finished after 629 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 912 ms.
Product exploration explored 100000 steps with 39 reset in 1127 ms.
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 33 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-19 23:33:36] [INFO ] Invariant cache hit.
[2023-03-19 23:33:37] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-19 23:33:37] [INFO ] Invariant cache hit.
[2023-03-19 23:33:39] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2616 ms to find 0 implicit places.
[2023-03-19 23:33:39] [INFO ] Redundant transitions in 363 ms returned []
[2023-03-19 23:33:39] [INFO ] Invariant cache hit.
[2023-03-19 23:33:40] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4024 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-15 finished in 25513 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)||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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' '!(F(G(p0)))'
[2023-03-19 23:33:41] [INFO ] Flatten gal took : 127 ms
[2023-03-19 23:33:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 23:33:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2655 places, 2605 transitions and 8210 arcs took 27 ms.
Total runtime 281057 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-050B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
LTLFireability

BK_STOP 1679269032832

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-050B-LTLFireability-09
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/719 3/32 ShieldIIPs-PT-050B-LTLFireability-09 306826 m, 61365 m/sec, 806670 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/719 5/32 ShieldIIPs-PT-050B-LTLFireability-09 644912 m, 67617 m/sec, 1717925 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/719 8/32 ShieldIIPs-PT-050B-LTLFireability-09 976191 m, 66255 m/sec, 2627381 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/719 10/32 ShieldIIPs-PT-050B-LTLFireability-09 1306495 m, 66060 m/sec, 3515871 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/719 13/32 ShieldIIPs-PT-050B-LTLFireability-09 1635821 m, 65865 m/sec, 4426269 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/719 15/32 ShieldIIPs-PT-050B-LTLFireability-09 1967751 m, 66386 m/sec, 5326033 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/719 18/32 ShieldIIPs-PT-050B-LTLFireability-09 2281799 m, 62809 m/sec, 6204848 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/719 20/32 ShieldIIPs-PT-050B-LTLFireability-09 2601561 m, 63952 m/sec, 7089523 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/719 22/32 ShieldIIPs-PT-050B-LTLFireability-09 2921326 m, 63953 m/sec, 7970776 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/719 25/32 ShieldIIPs-PT-050B-LTLFireability-09 3227672 m, 61269 m/sec, 8868442 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/719 27/32 ShieldIIPs-PT-050B-LTLFireability-09 3540250 m, 62515 m/sec, 9761191 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/719 29/32 ShieldIIPs-PT-050B-LTLFireability-09 3857443 m, 63438 m/sec, 10640941 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/719 32/32 ShieldIIPs-PT-050B-LTLFireability-09 4156834 m, 59878 m/sec, 11539359 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 1 0 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 16 (type EXCL) for 10 ShieldIIPs-PT-050B-LTLFireability-14
lola: time limit : 882 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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EG EXCL 5/882 8/32 ShieldIIPs-PT-050B-LTLFireability-14 595436 m, 119087 m/sec, 874019 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EG EXCL 10/882 15/32 ShieldIIPs-PT-050B-LTLFireability-14 1177733 m, 116459 m/sec, 1747594 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EG EXCL 15/882 22/32 ShieldIIPs-PT-050B-LTLFireability-14 1760001 m, 116453 m/sec, 2619036 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 1 0 1 0 0 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 EG EXCL 20/882 30/32 ShieldIIPs-PT-050B-LTLFireability-14 2390396 m, 126079 m/sec, 3471513 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 6 (type EXCL) for 3 ShieldIIPs-PT-050B-LTLFireability-12
lola: time limit : 1168 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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 5/1168 6/32 ShieldIIPs-PT-050B-LTLFireability-12 625977 m, 125195 m/sec, 832066 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 10/1168 11/32 ShieldIIPs-PT-050B-LTLFireability-12 1261877 m, 127180 m/sec, 1681465 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 15/1168 16/32 ShieldIIPs-PT-050B-LTLFireability-12 1881691 m, 123962 m/sec, 2526467 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 20/1168 21/32 ShieldIIPs-PT-050B-LTLFireability-12 2515133 m, 126688 m/sec, 3364826 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 25/1168 26/32 ShieldIIPs-PT-050B-LTLFireability-12 3138373 m, 124648 m/sec, 4216472 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 30/1168 31/32 ShieldIIPs-PT-050B-LTLFireability-12 3760930 m, 124511 m/sec, 5063766 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 6 (type EXCL) for ShieldIIPs-PT-050B-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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 1 0 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 8 (type EXCL) for 3 ShieldIIPs-PT-050B-LTLFireability-12
lola: time limit : 1734 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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1734 5/32 ShieldIIPs-PT-050B-LTLFireability-12 546950 m, 109390 m/sec, 955047 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1734 9/32 ShieldIIPs-PT-050B-LTLFireability-12 1099428 m, 110495 m/sec, 1922556 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1734 12/32 ShieldIIPs-PT-050B-LTLFireability-12 1594518 m, 99018 m/sec, 2885425 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1734 15/32 ShieldIIPs-PT-050B-LTLFireability-12 1919641 m, 65024 m/sec, 3840407 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1734 18/32 ShieldIIPs-PT-050B-LTLFireability-12 2246683 m, 65408 m/sec, 4783733 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1734 21/32 ShieldIIPs-PT-050B-LTLFireability-12 2576630 m, 65989 m/sec, 5720787 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1734 24/32 ShieldIIPs-PT-050B-LTLFireability-12 2881445 m, 60963 m/sec, 6651362 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1734 27/32 ShieldIIPs-PT-050B-LTLFireability-12 3174016 m, 58514 m/sec, 7568433 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/1734 30/32 ShieldIIPs-PT-050B-LTLFireability-12 3511072 m, 67411 m/sec, 8505581 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 1 0 2 0 1 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/1734 32/32 ShieldIIPs-PT-050B-LTLFireability-12 3812797 m, 60345 m/sec, 9428007 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 8 (type EXCL) for ShieldIIPs-PT-050B-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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 14 (type EXCL) for 13 ShieldIIPs-PT-050B-LTLFireability-15
lola: time limit : 3414 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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/3414 9/32 ShieldIIPs-PT-050B-LTLFireability-15 482393 m, 96478 m/sec, 876551 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/3414 17/32 ShieldIIPs-PT-050B-LTLFireability-15 961890 m, 95899 m/sec, 1814360 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/3414 25/32 ShieldIIPs-PT-050B-LTLFireability-15 1433802 m, 94382 m/sec, 2745793 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/3414 32/32 ShieldIIPs-PT-050B-LTLFireability-15 1870681 m, 87375 m/sec, 3677094 t fired, .

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for ShieldIIPs-PT-050B-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-050B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-12: CONJ 0 0 0 0 2 0 2 0
ShieldIIPs-PT-050B-LTLFireability-14: F 0 0 0 0 1 0 1 0
ShieldIIPs-PT-050B-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-050B-LTLFireability-09: LTL unknown AGGR
ShieldIIPs-PT-050B-LTLFireability-12: CONJ unknown CONJ
ShieldIIPs-PT-050B-LTLFireability-14: F unknown AGGR
ShieldIIPs-PT-050B-LTLFireability-15: LTL unknown AGGR


Time elapsed: 211 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-050B"
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-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903714900156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;