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-167903715600684.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 ShieldPPPt-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-167903715600684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 955K 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 ShieldPPPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679280447220

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=ShieldPPPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:47:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:47:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:47:30] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2023-03-20 02:47:30] [INFO ] Transformed 3903 places.
[2023-03-20 02:47:30] [INFO ] Transformed 3553 transitions.
[2023-03-20 02:47:30] [INFO ] Found NUPN structural information;
[2023-03-20 02:47:30] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 46 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 537 places :
Symmetric choice reduction at 0 with 537 rule applications. Total rules 537 place count 3366 transition count 3016
Iterating global reduction 0 with 537 rules applied. Total rules applied 1074 place count 3366 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1075 place count 3365 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 1076 place count 3365 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 3364 transition count 3014
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 3364 transition count 3014
Applied a total of 1078 rules in 1703 ms. Remains 3364 /3903 variables (removed 539) and now considering 3014/3553 (removed 539) transitions.
// Phase 1: matrix 3014 rows 3364 cols
[2023-03-20 02:47:32] [INFO ] Computed 551 place invariants in 69 ms
[2023-03-20 02:47:33] [INFO ] Implicit Places using invariants in 1469 ms returned []
[2023-03-20 02:47:33] [INFO ] Invariant cache hit.
[2023-03-20 02:47:38] [INFO ] Implicit Places using invariants and state equation in 4614 ms returned []
Implicit Place search using SMT with State Equation took 6155 ms to find 0 implicit places.
[2023-03-20 02:47:38] [INFO ] Invariant cache hit.
[2023-03-20 02:47:41] [INFO ] Dead Transitions using invariants and state equation in 3014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3364/3903 places, 3014/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10877 ms. Remains : 3364/3903 places, 3014/3553 transitions.
Support contains 46 out of 3364 places after structural reductions.
[2023-03-20 02:47:41] [INFO ] Flatten gal took : 205 ms
[2023-03-20 02:47:42] [INFO ] Flatten gal took : 113 ms
[2023-03-20 02:47:42] [INFO ] Input system was already deterministic with 3014 transitions.
Support contains 43 out of 3364 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 41) seen :23
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-20 02:47:43] [INFO ] Invariant cache hit.
[2023-03-20 02:47:45] [INFO ] [Real]Absence check using 551 positive place invariants in 258 ms returned sat
[2023-03-20 02:47:46] [INFO ] After 3007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-20 02:47:47] [INFO ] [Nat]Absence check using 551 positive place invariants in 296 ms returned sat
[2023-03-20 02:47:53] [INFO ] After 4065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-20 02:47:54] [INFO ] Deduced a trap composed of 25 places in 1069 ms of which 26 ms to minimize.
[2023-03-20 02:47:55] [INFO ] Deduced a trap composed of 20 places in 988 ms of which 2 ms to minimize.
[2023-03-20 02:47:57] [INFO ] Deduced a trap composed of 20 places in 961 ms of which 5 ms to minimize.
[2023-03-20 02:47:58] [INFO ] Deduced a trap composed of 26 places in 872 ms of which 15 ms to minimize.
[2023-03-20 02:47:58] [INFO ] Deduced a trap composed of 17 places in 771 ms of which 3 ms to minimize.
[2023-03-20 02:47:59] [INFO ] Deduced a trap composed of 18 places in 877 ms of which 2 ms to minimize.
[2023-03-20 02:48:00] [INFO ] Deduced a trap composed of 24 places in 747 ms of which 14 ms to minimize.
[2023-03-20 02:48:01] [INFO ] Deduced a trap composed of 47 places in 776 ms of which 2 ms to minimize.
[2023-03-20 02:48:02] [INFO ] Deduced a trap composed of 33 places in 769 ms of which 2 ms to minimize.
[2023-03-20 02:48:03] [INFO ] Deduced a trap composed of 35 places in 703 ms of which 1 ms to minimize.
[2023-03-20 02:48:04] [INFO ] Deduced a trap composed of 16 places in 799 ms of which 2 ms to minimize.
[2023-03-20 02:48:05] [INFO ] Deduced a trap composed of 32 places in 738 ms of which 2 ms to minimize.
[2023-03-20 02:48:06] [INFO ] Deduced a trap composed of 27 places in 670 ms of which 2 ms to minimize.
[2023-03-20 02:48:06] [INFO ] Deduced a trap composed of 26 places in 649 ms of which 1 ms to minimize.
[2023-03-20 02:48:07] [INFO ] Deduced a trap composed of 21 places in 880 ms of which 3 ms to minimize.
[2023-03-20 02:48:08] [INFO ] Deduced a trap composed of 28 places in 817 ms of which 2 ms to minimize.
[2023-03-20 02:48:09] [INFO ] Deduced a trap composed of 42 places in 780 ms of which 2 ms to minimize.
[2023-03-20 02:48:10] [INFO ] Deduced a trap composed of 31 places in 747 ms of which 1 ms to minimize.
[2023-03-20 02:48:11] [INFO ] Deduced a trap composed of 34 places in 724 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:48:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:48:11] [INFO ] After 25384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2566 ms.
Support contains 23 out of 3364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Drop transitions removed 687 transitions
Trivial Post-agglo rules discarded 687 transitions
Performed 687 trivial Post agglomeration. Transition count delta: 687
Iterating post reduction 0 with 687 rules applied. Total rules applied 687 place count 3364 transition count 2327
Reduce places removed 687 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 694 rules applied. Total rules applied 1381 place count 2677 transition count 2320
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1388 place count 2670 transition count 2320
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 392 Pre rules applied. Total rules applied 1388 place count 2670 transition count 1928
Deduced a syphon composed of 392 places in 4 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 3 with 784 rules applied. Total rules applied 2172 place count 2278 transition count 1928
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2179 place count 2271 transition count 1921
Iterating global reduction 3 with 7 rules applied. Total rules applied 2186 place count 2271 transition count 1921
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2186 place count 2271 transition count 1917
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2194 place count 2267 transition count 1917
Performed 842 Post agglomeration using F-continuation condition.Transition count delta: 842
Deduced a syphon composed of 842 places in 4 ms
Reduce places removed 842 places and 0 transitions.
Iterating global reduction 3 with 1684 rules applied. Total rules applied 3878 place count 1425 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3879 place count 1425 transition count 1074
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3881 place count 1424 transition count 1073
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4083 place count 1323 transition count 1073
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 4171 place count 1279 transition count 1073
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4172 place count 1279 transition count 1072
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4173 place count 1278 transition count 1072
Partial Free-agglomeration rule applied 147 times.
Drop transitions removed 147 transitions
Iterating global reduction 5 with 147 rules applied. Total rules applied 4320 place count 1278 transition count 1072
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4321 place count 1277 transition count 1071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4322 place count 1276 transition count 1071
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4322 place count 1276 transition count 1069
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4326 place count 1274 transition count 1069
Applied a total of 4326 rules in 799 ms. Remains 1274 /3364 variables (removed 2090) and now considering 1069/3014 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 799 ms. Remains : 1274/3364 places, 1069/3014 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1069 rows 1274 cols
[2023-03-20 02:48:16] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-20 02:48:17] [INFO ] [Real]Absence check using 550 positive place invariants in 122 ms returned sat
[2023-03-20 02:48:17] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:48:17] [INFO ] [Nat]Absence check using 550 positive place invariants in 155 ms returned sat
[2023-03-20 02:48:19] [INFO ] After 1438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 02:48:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 02:48:20] [INFO ] After 996ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-20 02:48:20] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 2 ms to minimize.
[2023-03-20 02:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-20 02:48:21] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-20 02:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-20 02:48:22] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-20 02:48:23] [INFO ] After 3527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1004 ms.
[2023-03-20 02:48:24] [INFO ] After 6788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 196 ms.
Support contains 19 out of 1274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1274/1274 places, 1069/1069 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1274 transition count 1067
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1272 transition count 1067
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1270 transition count 1065
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1269 transition count 1065
Applied a total of 10 rules in 77 ms. Remains 1269 /1274 variables (removed 5) and now considering 1065/1069 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1269/1274 places, 1065/1069 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) 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 14) 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 14) seen :0
Interrupted probabilistic random walk after 97835 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97835 steps, saw 83494 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1065 rows 1269 cols
[2023-03-20 02:48:28] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-20 02:48:29] [INFO ] [Real]Absence check using 550 positive place invariants in 277 ms returned sat
[2023-03-20 02:48:30] [INFO ] After 1101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:8
[2023-03-20 02:48:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 02:48:31] [INFO ] After 499ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:48:31] [INFO ] After 2551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:48:32] [INFO ] [Nat]Absence check using 550 positive place invariants in 196 ms returned sat
[2023-03-20 02:48:33] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 02:48:34] [INFO ] After 992ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-20 02:48:36] [INFO ] After 2744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 996 ms.
[2023-03-20 02:48:37] [INFO ] After 6228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 19 out of 1269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1269/1269 places, 1065/1065 transitions.
Applied a total of 0 rules in 27 ms. Remains 1269 /1269 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1269/1269 places, 1065/1065 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1269/1269 places, 1065/1065 transitions.
Applied a total of 0 rules in 36 ms. Remains 1269 /1269 variables (removed 0) and now considering 1065/1065 (removed 0) transitions.
[2023-03-20 02:48:38] [INFO ] Invariant cache hit.
[2023-03-20 02:48:38] [INFO ] Implicit Places using invariants in 890 ms returned [1252, 1256]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 893 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1267/1269 places, 1065/1065 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1265 transition count 1063
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1265 transition count 1063
Applied a total of 4 rules in 47 ms. Remains 1265 /1267 variables (removed 2) and now considering 1063/1065 (removed 2) transitions.
// Phase 1: matrix 1063 rows 1265 cols
[2023-03-20 02:48:38] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-20 02:48:39] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-20 02:48:39] [INFO ] Invariant cache hit.
[2023-03-20 02:48:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:48:41] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1265/1269 places, 1063/1065 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3521 ms. Remains : 1265/1269 places, 1063/1065 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 77239 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77239 steps, saw 65841 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-20 02:48:46] [INFO ] Invariant cache hit.
[2023-03-20 02:48:46] [INFO ] [Real]Absence check using 548 positive place invariants in 143 ms returned sat
[2023-03-20 02:48:47] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:48:47] [INFO ] [Nat]Absence check using 548 positive place invariants in 128 ms returned sat
[2023-03-20 02:48:49] [INFO ] After 1374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 02:48:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:48:50] [INFO ] After 1070ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-20 02:48:51] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-20 02:48:51] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-20 02:48:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2023-03-20 02:48:52] [INFO ] After 3174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 980 ms.
[2023-03-20 02:48:53] [INFO ] After 6766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 321 ms.
Support contains 19 out of 1265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1063/1063 transitions.
Applied a total of 0 rules in 26 ms. Remains 1265 /1265 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1265/1265 places, 1063/1063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1063/1063 transitions.
Applied a total of 0 rules in 25 ms. Remains 1265 /1265 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2023-03-20 02:48:54] [INFO ] Invariant cache hit.
[2023-03-20 02:48:55] [INFO ] Implicit Places using invariants in 701 ms returned []
[2023-03-20 02:48:55] [INFO ] Invariant cache hit.
[2023-03-20 02:48:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:48:56] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2306 ms to find 0 implicit places.
[2023-03-20 02:48:56] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 02:48:56] [INFO ] Invariant cache hit.
[2023-03-20 02:48:57] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3084 ms. Remains : 1265/1265 places, 1063/1063 transitions.
Partial Free-agglomeration rule applied 286 times.
Drop transitions removed 286 transitions
Iterating global reduction 0 with 286 rules applied. Total rules applied 286 place count 1265 transition count 1063
Applied a total of 286 rules in 65 ms. Remains 1265 /1265 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 1063 rows 1265 cols
[2023-03-20 02:48:57] [INFO ] Computed 548 place invariants in 6 ms
[2023-03-20 02:48:58] [INFO ] [Real]Absence check using 548 positive place invariants in 143 ms returned sat
[2023-03-20 02:48:58] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:48:59] [INFO ] [Nat]Absence check using 548 positive place invariants in 216 ms returned sat
[2023-03-20 02:49:01] [INFO ] After 1492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 02:49:01] [INFO ] State equation strengthened by 281 read => feed constraints.
[2023-03-20 02:49:02] [INFO ] After 1286ms SMT Verify possible using 281 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-20 02:49:02] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:49:03] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2023-03-20 02:49:03] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 0 ms to minimize.
[2023-03-20 02:49:04] [INFO ] Deduced a trap composed of 5 places in 418 ms of which 1 ms to minimize.
[2023-03-20 02:49:04] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-20 02:49:04] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 0 ms to minimize.
[2023-03-20 02:49:05] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 4 ms to minimize.
[2023-03-20 02:49:05] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-20 02:49:05] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2023-03-20 02:49:05] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-20 02:49:06] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-03-20 02:49:06] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 0 ms to minimize.
[2023-03-20 02:49:06] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-20 02:49:07] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 1 ms to minimize.
[2023-03-20 02:49:07] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:49:08] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:49:08] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-20 02:49:08] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 1 ms to minimize.
[2023-03-20 02:49:09] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:49:09] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2023-03-20 02:49:09] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6949 ms
[2023-03-20 02:49:10] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 0 ms to minimize.
[2023-03-20 02:49:10] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:49:10] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-20 02:49:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 873 ms
[2023-03-20 02:49:11] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:49:11] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2023-03-20 02:49:11] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-20 02:49:12] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:49:12] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 1 ms to minimize.
[2023-03-20 02:49:12] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-20 02:49:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1993 ms
[2023-03-20 02:49:13] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 5 ms to minimize.
[2023-03-20 02:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-20 02:49:13] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2023-03-20 02:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-20 02:49:14] [INFO ] After 13246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1073 ms.
[2023-03-20 02:49:15] [INFO ] After 17172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Computed a total of 801 stabilizing places and 801 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((X(p0)||G(p1))))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 517 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:49:16] [INFO ] Computed 551 place invariants in 15 ms
[2023-03-20 02:49:18] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2023-03-20 02:49:18] [INFO ] Invariant cache hit.
[2023-03-20 02:49:22] [INFO ] Implicit Places using invariants and state equation in 3724 ms returned []
Implicit Place search using SMT with State Equation took 5218 ms to find 0 implicit places.
[2023-03-20 02:49:22] [INFO ] Invariant cache hit.
[2023-03-20 02:49:24] [INFO ] Dead Transitions using invariants and state equation in 2618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8357 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 500 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s2522 0), p1:(EQ s2522 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1264 ms.
Product exploration explored 100000 steps with 33333 reset in 1144 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-00 finished in 11611 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)&&X(p1)))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 449 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-20 02:49:28] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-20 02:49:29] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2023-03-20 02:49:29] [INFO ] Invariant cache hit.
[2023-03-20 02:49:33] [INFO ] Implicit Places using invariants and state equation in 3731 ms returned []
Implicit Place search using SMT with State Equation took 5162 ms to find 0 implicit places.
[2023-03-20 02:49:33] [INFO ] Invariant cache hit.
[2023-03-20 02:49:35] [INFO ] Dead Transitions using invariants and state equation in 2421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8049 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s84 1)), p1:(EQ s2273 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 953 ms.
Stack based approach found an accepted trace after 2488 steps with 0 reset with depth 2489 and stack size 2489 in 41 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-01 finished in 9320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(F(G(p1)) U (G(p2)&&F(p3))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1920
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2195 place count 2261 transition count 1911
Iterating global reduction 2 with 9 rules applied. Total rules applied 2204 place count 2261 transition count 1911
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2204 place count 2261 transition count 1905
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2216 place count 2255 transition count 1905
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3908 place count 1409 transition count 1059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1409 transition count 1058
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3911 place count 1408 transition count 1057
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1307 transition count 1057
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4209 place count 1259 transition count 1057
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4211 place count 1257 transition count 1055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4212 place count 1256 transition count 1055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4212 place count 1256 transition count 1053
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4216 place count 1254 transition count 1053
Applied a total of 4216 rules in 663 ms. Remains 1254 /3364 variables (removed 2110) and now considering 1053/3014 (removed 1961) transitions.
// Phase 1: matrix 1053 rows 1254 cols
[2023-03-20 02:49:37] [INFO ] Computed 550 place invariants in 8 ms
[2023-03-20 02:49:38] [INFO ] Implicit Places using invariants in 746 ms returned [1237, 1241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 747 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/3364 places, 1053/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1250 transition count 1051
Applied a total of 4 rules in 47 ms. Remains 1250 /1252 variables (removed 2) and now considering 1051/1053 (removed 2) transitions.
// Phase 1: matrix 1051 rows 1250 cols
[2023-03-20 02:49:38] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-20 02:49:39] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-20 02:49:39] [INFO ] Invariant cache hit.
[2023-03-20 02:49:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 02:49:41] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1250/3364 places, 1051/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3934 ms. Remains : 1250/3364 places, 1051/3014 transitions.
Stuttering acceptance computed with spot in 456 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s728 1), p2:(EQ s75 1), p3:(EQ s429 1), p1:(AND (EQ s857 1) (EQ s882 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 823 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-02 finished in 5252 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 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3363 transition count 2314
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2664 transition count 2314
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1398 place count 2664 transition count 1919
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2188 place count 2269 transition count 1919
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2199 place count 2258 transition count 1908
Iterating global reduction 2 with 11 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1900
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2226 place count 2250 transition count 1900
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3920 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3921 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3923 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4125 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4219 place count 1254 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4221 place count 1252 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4222 place count 1251 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4222 place count 1251 transition count 1047
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4226 place count 1249 transition count 1047
Applied a total of 4226 rules in 583 ms. Remains 1249 /3364 variables (removed 2115) and now considering 1047/3014 (removed 1967) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2023-03-20 02:49:43] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-20 02:49:43] [INFO ] Implicit Places using invariants in 771 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 772 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3364 places, 1047/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1045
Applied a total of 4 rules in 41 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2023-03-20 02:49:43] [INFO ] Computed 548 place invariants in 5 ms
[2023-03-20 02:49:44] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-20 02:49:44] [INFO ] Invariant cache hit.
[2023-03-20 02:49:46] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3364 places, 1045/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4097 ms. Remains : 1245/3364 places, 1045/3014 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1195 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 400 reset in 913 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 2 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-03 finished in 5086 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))||(G((p2||X(p3)))&&F(p0)))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 432 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:49:47] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-20 02:49:49] [INFO ] Implicit Places using invariants in 1498 ms returned []
[2023-03-20 02:49:49] [INFO ] Invariant cache hit.
[2023-03-20 02:49:53] [INFO ] Implicit Places using invariants and state equation in 3960 ms returned []
Implicit Place search using SMT with State Equation took 5460 ms to find 0 implicit places.
[2023-03-20 02:49:53] [INFO ] Invariant cache hit.
[2023-03-20 02:49:55] [INFO ] Dead Transitions using invariants and state equation in 1601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7513 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s920 1), p2:(EQ s2976 1), p1:(EQ s2940 0), p3:(EQ s2940 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 884 ms.
Stack based approach found an accepted trace after 5239 steps with 1 reset with depth 5135 and stack size 5135 in 50 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-04 finished in 8813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3363 transition count 2313
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1918
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2268 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2200 place count 2258 transition count 1908
Iterating global reduction 2 with 10 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1901
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3916 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3917 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3919 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4121 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4217 place count 1255 transition count 1053
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4219 place count 1253 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4220 place count 1252 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4220 place count 1252 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4224 place count 1250 transition count 1049
Applied a total of 4224 rules in 541 ms. Remains 1250 /3364 variables (removed 2114) and now considering 1049/3014 (removed 1965) transitions.
// Phase 1: matrix 1049 rows 1250 cols
[2023-03-20 02:49:56] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-20 02:49:57] [INFO ] Implicit Places using invariants in 805 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 807 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1248/3364 places, 1049/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1246 transition count 1047
Applied a total of 4 rules in 44 ms. Remains 1246 /1248 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1246 cols
[2023-03-20 02:49:57] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-20 02:49:58] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-20 02:49:58] [INFO ] Invariant cache hit.
[2023-03-20 02:50:00] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/3364 places, 1047/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3874 ms. Remains : 1246/3364 places, 1047/3014 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1021 1), p1:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 107 reset in 847 ms.
Stack based approach found an accepted trace after 440 steps with 6 reset with depth 147 and stack size 147 in 5 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-05 finished in 4881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 411 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-20 02:50:01] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-20 02:50:02] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2023-03-20 02:50:02] [INFO ] Invariant cache hit.
[2023-03-20 02:50:04] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2924 ms to find 0 implicit places.
[2023-03-20 02:50:04] [INFO ] Invariant cache hit.
[2023-03-20 02:50:07] [INFO ] Dead Transitions using invariants and state equation in 2559 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5906 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1974 1), p0:(AND (EQ s1974 1) (EQ s2471 1) (EQ s633 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 886 ms.
Stack based approach found an accepted trace after 1416 steps with 0 reset with depth 1417 and stack size 1417 in 13 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-06 finished in 7138 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&&(p1 U (p2||G(p1)))) U (G((!p0&&(p1 U (p2||G(p1)))))||((p1 U (p2||G(p1)))&&p3))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 501 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:50:08] [INFO ] Computed 551 place invariants in 11 ms
[2023-03-20 02:50:10] [INFO ] Implicit Places using invariants in 1402 ms returned []
[2023-03-20 02:50:10] [INFO ] Invariant cache hit.
[2023-03-20 02:50:14] [INFO ] Implicit Places using invariants and state equation in 4231 ms returned []
Implicit Place search using SMT with State Equation took 5663 ms to find 0 implicit places.
[2023-03-20 02:50:14] [INFO ] Invariant cache hit.
[2023-03-20 02:50:17] [INFO ] Dead Transitions using invariants and state equation in 2782 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8949 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0))), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s2311 1) (EQ s2336 1))) (NOT (OR (AND (EQ s2311 1) (EQ s2336 1)) (EQ s2492 1)))), p2:(AND (NEQ s486 1) (NEQ s515 1)), p0:(OR (AND (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1757 ms.
Product exploration explored 100000 steps with 50000 reset in 1597 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0))))), (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p3 p2 (NOT p0) p1)
Knowledge based reduction with 9 factoid took 460 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-07 finished in 13147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(p2)))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 440 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-20 02:50:21] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-20 02:50:23] [INFO ] Implicit Places using invariants in 1655 ms returned []
[2023-03-20 02:50:23] [INFO ] Invariant cache hit.
[2023-03-20 02:50:27] [INFO ] Implicit Places using invariants and state equation in 4083 ms returned []
Implicit Place search using SMT with State Equation took 5744 ms to find 0 implicit places.
[2023-03-20 02:50:27] [INFO ] Invariant cache hit.
[2023-03-20 02:50:30] [INFO ] Dead Transitions using invariants and state equation in 2488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8674 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), true, (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s3254 1), p1:(EQ s2932 1), p2:(AND (EQ s2664 0) (EQ s3254 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1749 ms.
Product exploration explored 100000 steps with 50000 reset in 1806 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-08 finished in 12808 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((p1&&X(p1))))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 492 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:50:34] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-20 02:50:36] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2023-03-20 02:50:36] [INFO ] Invariant cache hit.
[2023-03-20 02:50:38] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 3391 ms to find 0 implicit places.
[2023-03-20 02:50:38] [INFO ] Invariant cache hit.
[2023-03-20 02:50:40] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6644 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s2804 0), p1:(EQ s230 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33384 reset in 1296 ms.
Product exploration explored 100000 steps with 33239 reset in 1292 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 315 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:50:44] [INFO ] Invariant cache hit.
[2023-03-20 02:50:44] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:50:45] [INFO ] [Nat]Absence check using 551 positive place invariants in 242 ms returned sat
[2023-03-20 02:50:47] [INFO ] After 1730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:50:48] [INFO ] Deduced a trap composed of 26 places in 929 ms of which 2 ms to minimize.
[2023-03-20 02:50:49] [INFO ] Deduced a trap composed of 22 places in 834 ms of which 2 ms to minimize.
[2023-03-20 02:50:50] [INFO ] Deduced a trap composed of 28 places in 813 ms of which 1 ms to minimize.
[2023-03-20 02:50:51] [INFO ] Deduced a trap composed of 24 places in 833 ms of which 2 ms to minimize.
[2023-03-20 02:50:52] [INFO ] Deduced a trap composed of 18 places in 810 ms of which 4 ms to minimize.
[2023-03-20 02:50:52] [INFO ] Deduced a trap composed of 18 places in 707 ms of which 1 ms to minimize.
[2023-03-20 02:50:53] [INFO ] Deduced a trap composed of 18 places in 717 ms of which 1 ms to minimize.
[2023-03-20 02:50:54] [INFO ] Deduced a trap composed of 20 places in 908 ms of which 2 ms to minimize.
[2023-03-20 02:50:55] [INFO ] Deduced a trap composed of 26 places in 716 ms of which 2 ms to minimize.
[2023-03-20 02:50:56] [INFO ] Deduced a trap composed of 20 places in 1138 ms of which 24 ms to minimize.
[2023-03-20 02:50:57] [INFO ] Deduced a trap composed of 29 places in 690 ms of which 2 ms to minimize.
[2023-03-20 02:50:58] [INFO ] Deduced a trap composed of 28 places in 804 ms of which 2 ms to minimize.
[2023-03-20 02:50:59] [INFO ] Deduced a trap composed of 28 places in 826 ms of which 2 ms to minimize.
[2023-03-20 02:51:00] [INFO ] Deduced a trap composed of 24 places in 766 ms of which 2 ms to minimize.
[2023-03-20 02:51:01] [INFO ] Deduced a trap composed of 32 places in 757 ms of which 2 ms to minimize.
[2023-03-20 02:51:02] [INFO ] Deduced a trap composed of 36 places in 720 ms of which 1 ms to minimize.
[2023-03-20 02:51:03] [INFO ] Deduced a trap composed of 27 places in 665 ms of which 2 ms to minimize.
[2023-03-20 02:51:03] [INFO ] Deduced a trap composed of 27 places in 619 ms of which 2 ms to minimize.
[2023-03-20 02:51:04] [INFO ] Deduced a trap composed of 25 places in 671 ms of which 1 ms to minimize.
[2023-03-20 02:51:05] [INFO ] Deduced a trap composed of 22 places in 701 ms of which 1 ms to minimize.
[2023-03-20 02:51:06] [INFO ] Deduced a trap composed of 23 places in 691 ms of which 1 ms to minimize.
[2023-03-20 02:51:07] [INFO ] Deduced a trap composed of 31 places in 673 ms of which 1 ms to minimize.
[2023-03-20 02:51:07] [INFO ] Deduced a trap composed of 47 places in 661 ms of which 2 ms to minimize.
[2023-03-20 02:51:08] [INFO ] Deduced a trap composed of 35 places in 610 ms of which 3 ms to minimize.
[2023-03-20 02:51:09] [INFO ] Deduced a trap composed of 28 places in 533 ms of which 1 ms to minimize.
[2023-03-20 02:51:09] [INFO ] Deduced a trap composed of 30 places in 569 ms of which 2 ms to minimize.
[2023-03-20 02:51:12] [INFO ] Deduced a trap composed of 15 places in 2139 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:51:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:51:12] [INFO ] After 27150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4347 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4348 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4352 place count 1249 transition count 1048
Applied a total of 4352 rules in 480 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 186742 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186742 steps, saw 156631 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-20 02:51:15] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-20 02:51:15] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:51:16] [INFO ] [Nat]Absence check using 550 positive place invariants in 124 ms returned sat
[2023-03-20 02:51:16] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:51:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:51:16] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:51:16] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-20 02:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-20 02:51:16] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 02:51:16] [INFO ] After 1048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 28 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 24 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-20 02:51:17] [INFO ] Invariant cache hit.
[2023-03-20 02:51:17] [INFO ] Implicit Places using invariants in 800 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 802 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 41 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:51:17] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-20 02:51:18] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-20 02:51:18] [INFO ] Invariant cache hit.
[2023-03-20 02:51:20] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3109 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 180443 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180443 steps, saw 150740 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:51:23] [INFO ] Invariant cache hit.
[2023-03-20 02:51:23] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:51:23] [INFO ] [Nat]Absence check using 548 positive place invariants in 120 ms returned sat
[2023-03-20 02:51:24] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:51:24] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 02:51:24] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 32 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 27 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-20 02:51:24] [INFO ] Invariant cache hit.
[2023-03-20 02:51:25] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-20 02:51:25] [INFO ] Invariant cache hit.
[2023-03-20 02:51:26] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
[2023-03-20 02:51:26] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-20 02:51:26] [INFO ] Invariant cache hit.
[2023-03-20 02:51:27] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3146 ms. Remains : 1245/1245 places, 1046/1046 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 1245 transition count 1046
Applied a total of 296 rules in 54 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:51:27] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-20 02:51:27] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:51:27] [INFO ] [Nat]Absence check using 548 positive place invariants in 73 ms returned sat
[2023-03-20 02:51:28] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:51:28] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-20 02:51:28] [INFO ] After 155ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:51:29] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:51:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-20 02:51:29] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-20 02:51:29] [INFO ] After 1517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 446 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 321 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:51:30] [INFO ] Computed 551 place invariants in 15 ms
[2023-03-20 02:51:31] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2023-03-20 02:51:31] [INFO ] Invariant cache hit.
[2023-03-20 02:51:32] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
[2023-03-20 02:51:32] [INFO ] Invariant cache hit.
[2023-03-20 02:51:35] [INFO ] Dead Transitions using invariants and state equation in 2389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5132 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105830 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105830 steps, saw 78683 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:51:39] [INFO ] Invariant cache hit.
[2023-03-20 02:51:39] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:51:40] [INFO ] [Nat]Absence check using 551 positive place invariants in 227 ms returned sat
[2023-03-20 02:51:42] [INFO ] After 2108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:51:43] [INFO ] Deduced a trap composed of 25 places in 786 ms of which 2 ms to minimize.
[2023-03-20 02:51:44] [INFO ] Deduced a trap composed of 23 places in 746 ms of which 2 ms to minimize.
[2023-03-20 02:51:45] [INFO ] Deduced a trap composed of 29 places in 837 ms of which 2 ms to minimize.
[2023-03-20 02:51:46] [INFO ] Deduced a trap composed of 18 places in 1069 ms of which 4 ms to minimize.
[2023-03-20 02:51:47] [INFO ] Deduced a trap composed of 28 places in 836 ms of which 1 ms to minimize.
[2023-03-20 02:51:48] [INFO ] Deduced a trap composed of 23 places in 714 ms of which 2 ms to minimize.
[2023-03-20 02:51:49] [INFO ] Deduced a trap composed of 22 places in 725 ms of which 2 ms to minimize.
[2023-03-20 02:51:50] [INFO ] Deduced a trap composed of 25 places in 773 ms of which 2 ms to minimize.
[2023-03-20 02:51:50] [INFO ] Deduced a trap composed of 23 places in 706 ms of which 2 ms to minimize.
[2023-03-20 02:51:52] [INFO ] Deduced a trap composed of 31 places in 909 ms of which 2 ms to minimize.
[2023-03-20 02:51:52] [INFO ] Deduced a trap composed of 26 places in 702 ms of which 2 ms to minimize.
[2023-03-20 02:51:53] [INFO ] Deduced a trap composed of 28 places in 579 ms of which 2 ms to minimize.
[2023-03-20 02:51:54] [INFO ] Deduced a trap composed of 24 places in 648 ms of which 2 ms to minimize.
[2023-03-20 02:51:55] [INFO ] Deduced a trap composed of 29 places in 648 ms of which 1 ms to minimize.
[2023-03-20 02:51:55] [INFO ] Deduced a trap composed of 27 places in 594 ms of which 2 ms to minimize.
[2023-03-20 02:51:56] [INFO ] Deduced a trap composed of 38 places in 669 ms of which 2 ms to minimize.
[2023-03-20 02:51:57] [INFO ] Deduced a trap composed of 32 places in 671 ms of which 1 ms to minimize.
[2023-03-20 02:51:58] [INFO ] Deduced a trap composed of 36 places in 667 ms of which 1 ms to minimize.
[2023-03-20 02:51:59] [INFO ] Deduced a trap composed of 32 places in 664 ms of which 2 ms to minimize.
[2023-03-20 02:51:59] [INFO ] Deduced a trap composed of 19 places in 613 ms of which 2 ms to minimize.
[2023-03-20 02:52:00] [INFO ] Deduced a trap composed of 37 places in 559 ms of which 1 ms to minimize.
[2023-03-20 02:52:01] [INFO ] Deduced a trap composed of 45 places in 633 ms of which 2 ms to minimize.
[2023-03-20 02:52:01] [INFO ] Deduced a trap composed of 46 places in 560 ms of which 1 ms to minimize.
[2023-03-20 02:52:02] [INFO ] Deduced a trap composed of 44 places in 592 ms of which 1 ms to minimize.
[2023-03-20 02:52:03] [INFO ] Deduced a trap composed of 36 places in 547 ms of which 2 ms to minimize.
[2023-03-20 02:52:04] [INFO ] Deduced a trap composed of 40 places in 718 ms of which 2 ms to minimize.
[2023-03-20 02:52:05] [INFO ] Deduced a trap composed of 43 places in 926 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:52:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:52:05] [INFO ] After 25569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 172 ms.
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3351 transition count 2303
Reduce places removed 698 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 700 rules applied. Total rules applied 1398 place count 2653 transition count 2301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1903
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 2196 place count 2253 transition count 1903
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 3 with 1696 rules applied. Total rules applied 3892 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3893 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3895 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4097 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4193 place count 1255 transition count 1053
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4342 place count 1255 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4343 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4344 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4344 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Applied a total of 4348 rules in 633 ms. Remains 1251 /3351 variables (removed 2100) and now considering 1050/3001 (removed 1951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 1251/3351 places, 1050/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1050 rows 1251 cols
[2023-03-20 02:52:06] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-20 02:52:06] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:52:06] [INFO ] [Nat]Absence check using 550 positive place invariants in 87 ms returned sat
[2023-03-20 02:52:07] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:52:07] [INFO ] After 49ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:07] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-20 02:52:07] [INFO ] After 1006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1050/1050 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1251 transition count 1049
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1250 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1249 transition count 1048
Applied a total of 4 rules in 64 ms. Remains 1249 /1251 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1249/1251 places, 1048/1050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 171607 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171607 steps, saw 143601 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-20 02:52:10] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-20 02:52:10] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:52:11] [INFO ] [Nat]Absence check using 550 positive place invariants in 85 ms returned sat
[2023-03-20 02:52:11] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:52:11] [INFO ] After 105ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:11] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-20 02:52:12] [INFO ] After 1164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 29 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 26 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-20 02:52:12] [INFO ] Invariant cache hit.
[2023-03-20 02:52:12] [INFO ] Implicit Places using invariants in 700 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 701 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 68 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:52:12] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-20 02:52:13] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-20 02:52:13] [INFO ] Invariant cache hit.
[2023-03-20 02:52:15] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3161 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 176472 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176472 steps, saw 147475 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:52:18] [INFO ] Invariant cache hit.
[2023-03-20 02:52:18] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:52:18] [INFO ] [Nat]Absence check using 548 positive place invariants in 74 ms returned sat
[2023-03-20 02:52:19] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:19] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:52:19] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:52:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2023-03-20 02:52:19] [INFO ] After 1054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-20 02:52:19] [INFO ] After 1362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 32 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-20 02:52:20] [INFO ] Invariant cache hit.
[2023-03-20 02:52:20] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-20 02:52:20] [INFO ] Invariant cache hit.
[2023-03-20 02:52:22] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2360 ms to find 0 implicit places.
[2023-03-20 02:52:22] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-20 02:52:22] [INFO ] Invariant cache hit.
[2023-03-20 02:52:22] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2985 ms. Remains : 1245/1245 places, 1046/1046 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 1245 transition count 1046
Applied a total of 296 rules in 51 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:52:23] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-20 02:52:23] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:52:23] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2023-03-20 02:52:24] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:24] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-20 02:52:24] [INFO ] After 168ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 02:52:24] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-20 02:52:24] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 435 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33292 reset in 1489 ms.
Product exploration explored 100000 steps with 33302 reset in 1440 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 248 Pre rules applied. Total rules applied 700 place count 3351 transition count 3199
Deduced a syphon composed of 948 places in 5 ms
Iterating global reduction 1 with 248 rules applied. Total rules applied 948 place count 3351 transition count 3199
Performed 950 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1898 places in 6 ms
Iterating global reduction 1 with 950 rules applied. Total rules applied 1898 place count 3351 transition count 3199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1899 place count 3351 transition count 3198
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2251 place count 2999 transition count 2846
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2603 place count 2999 transition count 2846
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2604 place count 2999 transition count 2846
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2606 place count 2997 transition count 2844
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2608 place count 2997 transition count 2844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2709 place count 2997 transition count 3274
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2810 place count 2896 transition count 3072
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2911 place count 2896 transition count 3072
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -411
Deduced a syphon composed of 1641 places in 4 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3007 place count 2896 transition count 3483
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 3103 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 3 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3199 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 5 ms
Applied a total of 3199 rules in 2714 ms. Remains 2800 /3351 variables (removed 551) and now considering 3291/3001 (removed -290) transitions.
[2023-03-20 02:52:31] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 3291 rows 2800 cols
[2023-03-20 02:52:31] [INFO ] Computed 551 place invariants in 27 ms
[2023-03-20 02:52:34] [INFO ] Dead Transitions using invariants and state equation in 2628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3291/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5415 ms. Remains : 2800/3351 places, 3291/3001 transitions.
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 282 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:52:34] [INFO ] Computed 551 place invariants in 28 ms
[2023-03-20 02:52:36] [INFO ] Implicit Places using invariants in 1453 ms returned []
[2023-03-20 02:52:36] [INFO ] Invariant cache hit.
[2023-03-20 02:52:39] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 4985 ms to find 0 implicit places.
[2023-03-20 02:52:39] [INFO ] Invariant cache hit.
[2023-03-20 02:52:42] [INFO ] Dead Transitions using invariants and state equation in 2575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7857 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 128203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||G(p2))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 601 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
[2023-03-20 02:52:43] [INFO ] Invariant cache hit.
[2023-03-20 02:52:44] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2023-03-20 02:52:44] [INFO ] Invariant cache hit.
[2023-03-20 02:52:45] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2846 ms to find 0 implicit places.
[2023-03-20 02:52:45] [INFO ] Invariant cache hit.
[2023-03-20 02:52:48] [INFO ] Dead Transitions using invariants and state equation in 2781 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6230 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s1075 1), p2:(NEQ s2734 1), p0:(EQ s1313 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 120 reset in 616 ms.
Product exploration explored 100000 steps with 119 reset in 720 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3351 stabilizing places and 798/3001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1285 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 712 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 1176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 251 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
[2023-03-20 02:52:53] [INFO ] Invariant cache hit.
[2023-03-20 02:52:55] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2023-03-20 02:52:55] [INFO ] Invariant cache hit.
[2023-03-20 02:52:59] [INFO ] Implicit Places using invariants and state equation in 4066 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
[2023-03-20 02:52:59] [INFO ] Invariant cache hit.
[2023-03-20 02:53:01] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7686 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3351 stabilizing places and 798/3001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 896 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 117 reset in 588 ms.
Product exploration explored 100000 steps with 119 reset in 598 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 700 place count 3351 transition count 3201
Deduced a syphon composed of 950 places in 5 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 950 place count 3351 transition count 3201
Performed 946 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1896 places in 6 ms
Iterating global reduction 1 with 946 rules applied. Total rules applied 1896 place count 3351 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1897 place count 3351 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 2247 place count 3001 transition count 2850
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 350 rules applied. Total rules applied 2597 place count 3001 transition count 2850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2598 place count 3001 transition count 2850
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2600 place count 2999 transition count 2848
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2602 place count 2999 transition count 2848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2703 place count 2999 transition count 3278
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2804 place count 2898 transition count 3076
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2905 place count 2898 transition count 3076
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1643 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3003 place count 2898 transition count 3491
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3101 place count 2800 transition count 3295
Deduced a syphon composed of 1545 places in 3 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3199 place count 2800 transition count 3295
Deduced a syphon composed of 1545 places in 4 ms
Applied a total of 3199 rules in 1749 ms. Remains 2800 /3351 variables (removed 551) and now considering 3295/3001 (removed -294) transitions.
[2023-03-20 02:53:05] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 3295 rows 2800 cols
[2023-03-20 02:53:05] [INFO ] Computed 551 place invariants in 26 ms
[2023-03-20 02:53:07] [INFO ] Dead Transitions using invariants and state equation in 1628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3295/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3467 ms. Remains : 2800/3351 places, 3295/3001 transitions.
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 225 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-20 02:53:07] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-20 02:53:08] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2023-03-20 02:53:08] [INFO ] Invariant cache hit.
[2023-03-20 02:53:12] [INFO ] Implicit Places using invariants and state equation in 3874 ms returned []
Implicit Place search using SMT with State Equation took 5169 ms to find 0 implicit places.
[2023-03-20 02:53:12] [INFO ] Invariant cache hit.
[2023-03-20 02:53:15] [INFO ] Dead Transitions using invariants and state equation in 2616 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8011 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-10 finished in 33022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 492 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-20 02:53:16] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-20 02:53:17] [INFO ] Implicit Places using invariants in 1619 ms returned []
[2023-03-20 02:53:17] [INFO ] Invariant cache hit.
[2023-03-20 02:53:21] [INFO ] Implicit Places using invariants and state equation in 4252 ms returned []
Implicit Place search using SMT with State Equation took 5901 ms to find 0 implicit places.
[2023-03-20 02:53:21] [INFO ] Invariant cache hit.
[2023-03-20 02:53:24] [INFO ] Dead Transitions using invariants and state equation in 2623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9030 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2245 1), p1:(EQ s1562 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-11 finished in 9174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(p1&&G(p2))))||G(p3)))'
Support contains 4 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3363 transition count 2314
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2664 transition count 2314
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1398 place count 2664 transition count 1920
Deduced a syphon composed of 394 places in 3 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2196 place count 2260 transition count 1910
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 2 with 1688 rules applied. Total rules applied 3910 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3911 place count 1408 transition count 1057
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3913 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4115 place count 1306 transition count 1056
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4211 place count 1258 transition count 1056
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4213 place count 1256 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4214 place count 1255 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4214 place count 1255 transition count 1052
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4218 place count 1253 transition count 1052
Applied a total of 4218 rules in 591 ms. Remains 1253 /3364 variables (removed 2111) and now considering 1052/3014 (removed 1962) transitions.
// Phase 1: matrix 1052 rows 1253 cols
[2023-03-20 02:53:25] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-20 02:53:25] [INFO ] Implicit Places using invariants in 675 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 676 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3364 places, 1052/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1050
Applied a total of 4 rules in 47 ms. Remains 1249 /1251 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1249 cols
[2023-03-20 02:53:26] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-20 02:53:26] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-20 02:53:26] [INFO ] Invariant cache hit.
[2023-03-20 02:53:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:53:28] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3364 places, 1050/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3614 ms. Remains : 1249/3364 places, 1050/3014 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2 p3) (AND p1 p2 p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p2) p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s1159 0), p1:(EQ s53 0), p3:(EQ s530 0), p2:(EQ s1226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 203 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-12 finished in 3815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1920
Deduced a syphon composed of 395 places in 2 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2196 place count 2260 transition count 1910
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3918 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3919 place count 1404 transition count 1053
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3921 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4123 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4219 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4221 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4222 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4222 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4226 place count 1249 transition count 1048
Applied a total of 4226 rules in 597 ms. Remains 1249 /3364 variables (removed 2115) and now considering 1048/3014 (removed 1966) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-20 02:53:29] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-20 02:53:29] [INFO ] Implicit Places using invariants in 688 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 689 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3364 places, 1048/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 47 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:53:29] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-20 02:53:30] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-20 02:53:30] [INFO ] Invariant cache hit.
[2023-03-20 02:53:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:53:32] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3364 places, 1046/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3544 ms. Remains : 1245/3364 places, 1046/3014 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0, true, p0]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-13 finished in 3616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3363 transition count 2313
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1918
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2268 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2200 place count 2258 transition count 1908
Iterating global reduction 2 with 10 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1901
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3920 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3921 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3923 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4125 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4221 place count 1253 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4223 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4224 place count 1250 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4224 place count 1250 transition count 1047
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4228 place count 1248 transition count 1047
Applied a total of 4228 rules in 646 ms. Remains 1248 /3364 variables (removed 2116) and now considering 1047/3014 (removed 1967) transitions.
// Phase 1: matrix 1047 rows 1248 cols
[2023-03-20 02:53:32] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-20 02:53:33] [INFO ] Implicit Places using invariants in 730 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 745 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1246/3364 places, 1047/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 1045
Applied a total of 4 rules in 48 ms. Remains 1244 /1246 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2023-03-20 02:53:33] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-20 02:53:34] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-20 02:53:34] [INFO ] Invariant cache hit.
[2023-03-20 02:53:35] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1244/3364 places, 1045/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3759 ms. Remains : 1244/3364 places, 1045/3014 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s200 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 0 reset in 749 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-14 finished in 4554 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(G(p1))||G((F(p2)&&(!p1 U (p3||G(!p1)))))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3363 transition count 2317
Reduce places removed 696 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 698 rules applied. Total rules applied 1394 place count 2667 transition count 2315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1921
Deduced a syphon composed of 394 places in 4 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 2184 place count 2271 transition count 1921
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2195 place count 2260 transition count 1910
Iterating global reduction 3 with 11 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3914 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3915 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3917 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4119 place count 1304 transition count 1054
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 4211 place count 1258 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4213 place count 1256 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4214 place count 1255 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4214 place count 1255 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4218 place count 1253 transition count 1050
Applied a total of 4218 rules in 719 ms. Remains 1253 /3364 variables (removed 2111) and now considering 1050/3014 (removed 1964) transitions.
// Phase 1: matrix 1050 rows 1253 cols
[2023-03-20 02:53:37] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-20 02:53:38] [INFO ] Implicit Places using invariants in 826 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 853 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3364 places, 1050/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1048
Applied a total of 4 rules in 47 ms. Remains 1249 /1251 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-20 02:53:38] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-20 02:53:39] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-20 02:53:39] [INFO ] Invariant cache hit.
[2023-03-20 02:53:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 02:53:40] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3364 places, 1048/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3973 ms. Remains : 1249/3364 places, 1048/3014 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={1} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=3 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 2} source=4 dest: 2}, { cond=(AND p0 p1 p3), acceptance={1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p3))), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1207 1), p1:(EQ s455 1), p2:(EQ s147 1), p3:(AND (NEQ s455 1) (NOT (AND (EQ s640 1) (EQ s642 1))))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 734 ms.
Stack based approach found an accepted trace after 243 steps with 0 reset with depth 244 and stack size 244 in 3 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-15 finished in 5053 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((p1&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-050B-LTLFireability-09
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 700 rules applied. Total rules applied 1398 place count 2665 transition count 2313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1920
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2197 place count 2259 transition count 1909
Iterating global reduction 3 with 11 rules applied. Total rules applied 2208 place count 2259 transition count 1909
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 2208 place count 2259 transition count 1901
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 2 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 3 with 1690 rules applied. Total rules applied 3914 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3915 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3917 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4119 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4215 place count 1256 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4217 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4218 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4218 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4222 place count 1251 transition count 1050
Applied a total of 4222 rules in 709 ms. Remains 1251 /3364 variables (removed 2113) and now considering 1050/3014 (removed 1964) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2023-03-20 02:53:42] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-20 02:53:43] [INFO ] Implicit Places using invariants in 689 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 690 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1249/3364 places, 1050/3014 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 48 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-20 02:53:43] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-20 02:53:44] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-20 02:53:44] [INFO ] Invariant cache hit.
[2023-03-20 02:53:45] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1247/3364 places, 1048/3014 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3671 ms. Remains : 1247/3364 places, 1048/3014 transitions.
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s1050 0), p1:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33419 reset in 1162 ms.
Product exploration explored 100000 steps with 33278 reset in 1278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:53:48] [INFO ] Invariant cache hit.
[2023-03-20 02:53:49] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:53:49] [INFO ] [Nat]Absence check using 548 positive place invariants in 84 ms returned sat
[2023-03-20 02:53:49] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:53:49] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-20 02:53:50] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1246 transition count 1047
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 65 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 203437 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203437 steps, saw 146707 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:53:53] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-20 02:53:53] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:53:53] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2023-03-20 02:53:54] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:53:54] [INFO ] After 579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-20 02:53:54] [INFO ] After 902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 40 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 27 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-20 02:53:54] [INFO ] Invariant cache hit.
[2023-03-20 02:53:55] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-20 02:53:55] [INFO ] Invariant cache hit.
[2023-03-20 02:53:56] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
[2023-03-20 02:53:56] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 02:53:56] [INFO ] Invariant cache hit.
[2023-03-20 02:53:57] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2949 ms. Remains : 1245/1245 places, 1046/1046 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 1245 transition count 1046
Applied a total of 296 rules in 58 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:53:57] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-20 02:53:57] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:53:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 81 ms returned sat
[2023-03-20 02:53:58] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:53:58] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-20 02:53:58] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 37 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-20 02:53:59] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-20 02:53:59] [INFO ] Implicit Places using invariants in 716 ms returned []
[2023-03-20 02:53:59] [INFO ] Invariant cache hit.
[2023-03-20 02:54:01] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2023-03-20 02:54:01] [INFO ] Invariant cache hit.
[2023-03-20 02:54:01] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2897 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:54:02] [INFO ] Invariant cache hit.
[2023-03-20 02:54:02] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:54:03] [INFO ] [Nat]Absence check using 548 positive place invariants in 134 ms returned sat
[2023-03-20 02:54:03] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:54:03] [INFO ] After 603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 02:54:04] [INFO ] After 1105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1246 transition count 1047
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 80 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 196785 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196785 steps, saw 141886 distinct states, run finished after 3008 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:54:07] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-20 02:54:07] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:54:07] [INFO ] [Nat]Absence check using 548 positive place invariants in 75 ms returned sat
[2023-03-20 02:54:08] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:54:08] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-20 02:54:08] [INFO ] After 773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 26 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 25 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-20 02:54:08] [INFO ] Invariant cache hit.
[2023-03-20 02:54:08] [INFO ] Implicit Places using invariants in 691 ms returned []
[2023-03-20 02:54:08] [INFO ] Invariant cache hit.
[2023-03-20 02:54:10] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2023-03-20 02:54:10] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 02:54:10] [INFO ] Invariant cache hit.
[2023-03-20 02:54:11] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2836 ms. Remains : 1245/1245 places, 1046/1046 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 1245 transition count 1046
Applied a total of 296 rules in 70 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-20 02:54:11] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-20 02:54:11] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:54:11] [INFO ] [Nat]Absence check using 548 positive place invariants in 102 ms returned sat
[2023-03-20 02:54:12] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:54:12] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-20 02:54:12] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33535 reset in 1079 ms.
Product exploration explored 100000 steps with 33367 reset in 1331 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 68 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-20 02:54:15] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-20 02:54:15] [INFO ] Computed 548 place invariants in 14 ms
[2023-03-20 02:54:16] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 732 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 19 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-20 02:54:16] [INFO ] Invariant cache hit.
[2023-03-20 02:54:17] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-20 02:54:17] [INFO ] Invariant cache hit.
[2023-03-20 02:54:18] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2023-03-20 02:54:18] [INFO ] Invariant cache hit.
[2023-03-20 02:54:19] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2949 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 37656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||G(p2))))'
[2023-03-20 02:54:19] [INFO ] Flatten gal took : 97 ms
[2023-03-20 02:54:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 02:54:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3364 places, 3014 transitions and 7828 arcs took 15 ms.
Total runtime 409926 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-050B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLFireability

FORMULA ShieldPPPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679280950817

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 3 (type EXCL) for 0 ShieldPPPt-PT-050B-LTLFireability-09
lola: time limit : 1199 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
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 1 1 0 2 0 0 0
ShieldPPPt-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 4/1199 9/32 ShieldPPPt-PT-050B-LTLFireability-09 406641 m, 81328 m/sec, 561314 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 1 1 0 2 0 0 0
ShieldPPPt-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 9/1199 18/32 ShieldPPPt-PT-050B-LTLFireability-09 867648 m, 92201 m/sec, 1221231 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 1 1 0 2 0 0 0
ShieldPPPt-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 14/1199 28/32 ShieldPPPt-PT-050B-LTLFireability-09 1351652 m, 96800 m/sec, 1928255 t fired, .

Time elapsed: 16 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 3 (type EXCL) for ShieldPPPt-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
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 1 0 0 2 0 1 0
ShieldPPPt-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 21 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 8 (type EXCL) for 7 ShieldPPPt-PT-050B-LTLFireability-10
lola: time limit : 1789 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for ShieldPPPt-PT-050B-LTLFireability-10
lola: result : false
lola: markings : 427
lola: fired transitions : 427
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 5 (type EXCL) for 0 ShieldPPPt-PT-050B-LTLFireability-09
lola: time limit : 3579 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/3579 3/32 ShieldPPPt-PT-050B-LTLFireability-09 85627 m, 17125 m/sec, 334521 t fired, .

Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/3579 6/32 ShieldPPPt-PT-050B-LTLFireability-09 161037 m, 15082 m/sec, 677124 t fired, .

Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/3579 8/32 ShieldPPPt-PT-050B-LTLFireability-09 226859 m, 13164 m/sec, 1020973 t fired, .

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/3579 10/32 ShieldPPPt-PT-050B-LTLFireability-09 292517 m, 13131 m/sec, 1365071 t fired, .

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/3579 13/32 ShieldPPPt-PT-050B-LTLFireability-09 371534 m, 15803 m/sec, 1704265 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/3579 16/32 ShieldPPPt-PT-050B-LTLFireability-09 450393 m, 15771 m/sec, 2044258 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/3579 18/32 ShieldPPPt-PT-050B-LTLFireability-09 518593 m, 13640 m/sec, 2387635 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/3579 20/32 ShieldPPPt-PT-050B-LTLFireability-09 580609 m, 12403 m/sec, 2731590 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/3579 22/32 ShieldPPPt-PT-050B-LTLFireability-09 633728 m, 10623 m/sec, 3076036 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/3579 24/32 ShieldPPPt-PT-050B-LTLFireability-09 693517 m, 11957 m/sec, 3419826 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 55/3579 26/32 ShieldPPPt-PT-050B-LTLFireability-09 747155 m, 10727 m/sec, 3764380 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 60/3579 28/32 ShieldPPPt-PT-050B-LTLFireability-09 814909 m, 13550 m/sec, 4105278 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 65/3579 30/32 ShieldPPPt-PT-050B-LTLFireability-09 876975 m, 12413 m/sec, 4447128 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 5 (type EXCL) for ShieldPPPt-PT-050B-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-050B-LTLFireability-09: CONJ 0 0 0 0 2 0 2 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-LTLFireability-09: CONJ unknown CONJ
ShieldPPPt-PT-050B-LTLFireability-10: LTL false LTL model checker


Time elapsed: 91 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="ShieldPPPt-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 ShieldPPPt-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-167903715600684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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