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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 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.4K 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 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 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 762K 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-040B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679280022484

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-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:40:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:40:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:40:24] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-20 02:40:24] [INFO ] Transformed 3123 places.
[2023-03-20 02:40:24] [INFO ] Transformed 2843 transitions.
[2023-03-20 02:40:24] [INFO ] Found NUPN structural information;
[2023-03-20 02:40:24] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 434 places :
Symmetric choice reduction at 0 with 434 rule applications. Total rules 434 place count 2689 transition count 2409
Iterating global reduction 0 with 434 rules applied. Total rules applied 868 place count 2689 transition count 2409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 869 place count 2688 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 870 place count 2688 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 871 place count 2687 transition count 2407
Iterating global reduction 0 with 1 rules applied. Total rules applied 872 place count 2687 transition count 2407
Applied a total of 872 rules in 1218 ms. Remains 2687 /3123 variables (removed 436) and now considering 2407/2843 (removed 436) transitions.
// Phase 1: matrix 2407 rows 2687 cols
[2023-03-20 02:40:26] [INFO ] Computed 441 place invariants in 49 ms
[2023-03-20 02:40:28] [INFO ] Implicit Places using invariants in 1661 ms returned []
[2023-03-20 02:40:28] [INFO ] Invariant cache hit.
[2023-03-20 02:40:31] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 4829 ms to find 0 implicit places.
[2023-03-20 02:40:31] [INFO ] Invariant cache hit.
[2023-03-20 02:40:33] [INFO ] Dead Transitions using invariants and state equation in 1865 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2687/3123 places, 2407/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7915 ms. Remains : 2687/3123 places, 2407/2843 transitions.
Support contains 40 out of 2687 places after structural reductions.
[2023-03-20 02:40:33] [INFO ] Flatten gal took : 161 ms
[2023-03-20 02:40:33] [INFO ] Flatten gal took : 87 ms
[2023-03-20 02:40:33] [INFO ] Input system was already deterministic with 2407 transitions.
Support contains 39 out of 2687 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 31) seen :13
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 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 7 ms. (steps per millisecond=143 ) 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 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 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 7 ms. (steps per millisecond=143 ) 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 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 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-20 02:40:34] [INFO ] Invariant cache hit.
[2023-03-20 02:40:36] [INFO ] [Real]Absence check using 441 positive place invariants in 228 ms returned sat
[2023-03-20 02:40:36] [INFO ] After 2124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-20 02:40:38] [INFO ] [Nat]Absence check using 441 positive place invariants in 274 ms returned sat
[2023-03-20 02:40:42] [INFO ] After 3520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-20 02:40:43] [INFO ] Deduced a trap composed of 17 places in 461 ms of which 8 ms to minimize.
[2023-03-20 02:40:44] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 2 ms to minimize.
[2023-03-20 02:40:44] [INFO ] Deduced a trap composed of 37 places in 395 ms of which 1 ms to minimize.
[2023-03-20 02:40:45] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 1 ms to minimize.
[2023-03-20 02:40:45] [INFO ] Deduced a trap composed of 21 places in 450 ms of which 1 ms to minimize.
[2023-03-20 02:40:46] [INFO ] Deduced a trap composed of 46 places in 427 ms of which 1 ms to minimize.
[2023-03-20 02:40:46] [INFO ] Deduced a trap composed of 17 places in 420 ms of which 1 ms to minimize.
[2023-03-20 02:40:47] [INFO ] Deduced a trap composed of 35 places in 432 ms of which 1 ms to minimize.
[2023-03-20 02:40:47] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 1 ms to minimize.
[2023-03-20 02:40:48] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 1 ms to minimize.
[2023-03-20 02:40:48] [INFO ] Deduced a trap composed of 16 places in 373 ms of which 1 ms to minimize.
[2023-03-20 02:40:49] [INFO ] Deduced a trap composed of 27 places in 402 ms of which 1 ms to minimize.
[2023-03-20 02:40:49] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 1 ms to minimize.
[2023-03-20 02:40:50] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:40:50] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:40:50] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 4 ms to minimize.
[2023-03-20 02:40:51] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 1 ms to minimize.
[2023-03-20 02:40:51] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 1 ms to minimize.
[2023-03-20 02:40:52] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 1 ms to minimize.
[2023-03-20 02:40:52] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 0 ms to minimize.
[2023-03-20 02:40:52] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 0 ms to minimize.
[2023-03-20 02:40:53] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2023-03-20 02:40:53] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:40:54] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 1 ms to minimize.
[2023-03-20 02:40:54] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 1 ms to minimize.
[2023-03-20 02:40:54] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:40:54] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:40:55] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 2 ms to minimize.
[2023-03-20 02:40:55] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 0 ms to minimize.
[2023-03-20 02:40:55] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2023-03-20 02:40:56] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:40:56] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 0 ms to minimize.
[2023-03-20 02:40:56] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 0 ms to minimize.
[2023-03-20 02:40:57] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 4 ms to minimize.
[2023-03-20 02:40:57] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 1 ms to minimize.
[2023-03-20 02:40:57] [INFO ] Deduced a trap composed of 53 places in 254 ms of which 0 ms to minimize.
[2023-03-20 02:40:58] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 0 ms to minimize.
[2023-03-20 02:40:58] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 1 ms to minimize.
[2023-03-20 02:40:58] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:40:58] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:40:59] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2023-03-20 02:40:59] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 0 ms to minimize.
[2023-03-20 02:40:59] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:40:59] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 0 ms to minimize.
[2023-03-20 02:41:00] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 0 ms to minimize.
[2023-03-20 02:41:00] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 0 ms to minimize.
[2023-03-20 02:41:00] [INFO ] Deduced a trap composed of 50 places in 325 ms of which 1 ms to minimize.
[2023-03-20 02:41:01] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 0 ms to minimize.
[2023-03-20 02:41:01] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:41:01] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 0 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:41:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:41:01] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 2065 ms.
Support contains 24 out of 2687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 2687 transition count 1859
Reduce places removed 548 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 551 rules applied. Total rules applied 1099 place count 2139 transition count 1856
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1102 place count 2136 transition count 1856
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 308 Pre rules applied. Total rules applied 1102 place count 2136 transition count 1548
Deduced a syphon composed of 308 places in 2 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 616 rules applied. Total rules applied 1718 place count 1828 transition count 1548
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1719 place count 1827 transition count 1547
Iterating global reduction 3 with 1 rules applied. Total rules applied 1720 place count 1827 transition count 1547
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1720 place count 1827 transition count 1546
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1722 place count 1826 transition count 1546
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 3 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 3080 place count 1147 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3081 place count 1147 transition count 866
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 3083 place count 1146 transition count 865
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3285 place count 1045 transition count 865
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3313 place count 1031 transition count 865
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3314 place count 1031 transition count 864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3315 place count 1030 transition count 864
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 5 with 116 rules applied. Total rules applied 3431 place count 1030 transition count 864
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3432 place count 1029 transition count 863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3433 place count 1028 transition count 863
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3433 place count 1028 transition count 861
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3437 place count 1026 transition count 861
Applied a total of 3437 rules in 749 ms. Remains 1026 /2687 variables (removed 1661) and now considering 861/2407 (removed 1546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 1026/2687 places, 861/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 861 rows 1026 cols
[2023-03-20 02:41:04] [INFO ] Computed 440 place invariants in 10 ms
[2023-03-20 02:41:05] [INFO ] [Real]Absence check using 440 positive place invariants in 81 ms returned sat
[2023-03-20 02:41:05] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 02:41:06] [INFO ] [Nat]Absence check using 440 positive place invariants in 113 ms returned sat
[2023-03-20 02:41:07] [INFO ] After 1112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 02:41:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:41:08] [INFO ] After 920ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 02:41:08] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-20 02:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-20 02:41:09] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-20 02:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-20 02:41:10] [INFO ] After 2546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 663 ms.
[2023-03-20 02:41:10] [INFO ] After 5137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 21 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 861/861 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1025 transition count 860
Applied a total of 2 rules in 46 ms. Remains 1025 /1026 variables (removed 1) and now considering 860/861 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1025/1026 places, 860/861 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 68311 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68311 steps, saw 51851 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 860 rows 1025 cols
[2023-03-20 02:41:14] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-20 02:41:15] [INFO ] [Real]Absence check using 440 positive place invariants in 187 ms returned sat
[2023-03-20 02:41:15] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 02:41:15] [INFO ] [Nat]Absence check using 440 positive place invariants in 114 ms returned sat
[2023-03-20 02:41:17] [INFO ] After 1217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 02:41:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:41:18] [INFO ] After 669ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 02:41:19] [INFO ] Deduced a trap composed of 6 places in 906 ms of which 19 ms to minimize.
[2023-03-20 02:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 991 ms
[2023-03-20 02:41:20] [INFO ] After 2733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 871 ms.
[2023-03-20 02:41:21] [INFO ] After 5917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 193 ms.
Support contains 21 out of 1025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 860/860 transitions.
Applied a total of 0 rules in 22 ms. Remains 1025 /1025 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1025/1025 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 860/860 transitions.
Applied a total of 0 rules in 20 ms. Remains 1025 /1025 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-20 02:41:21] [INFO ] Invariant cache hit.
[2023-03-20 02:41:21] [INFO ] Implicit Places using invariants in 565 ms returned [1008, 1012]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 580 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1023/1025 places, 860/860 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1021 transition count 858
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1021 transition count 858
Applied a total of 4 rules in 48 ms. Remains 1021 /1023 variables (removed 2) and now considering 858/860 (removed 2) transitions.
// Phase 1: matrix 858 rows 1021 cols
[2023-03-20 02:41:21] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:41:22] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-20 02:41:22] [INFO ] Invariant cache hit.
[2023-03-20 02:41:24] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1021/1025 places, 858/860 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3079 ms. Remains : 1021/1025 places, 858/860 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 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 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) 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 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 98740 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98740 steps, saw 73391 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-20 02:41:28] [INFO ] Invariant cache hit.
[2023-03-20 02:41:29] [INFO ] [Real]Absence check using 438 positive place invariants in 83 ms returned sat
[2023-03-20 02:41:29] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:41:29] [INFO ] [Nat]Absence check using 438 positive place invariants in 248 ms returned sat
[2023-03-20 02:41:31] [INFO ] After 1737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 02:41:32] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-20 02:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-20 02:41:33] [INFO ] After 3330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 829 ms.
[2023-03-20 02:41:34] [INFO ] After 5159ms 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 175 ms.
Support contains 19 out of 1021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1021/1021 places, 858/858 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 1021 transition count 857
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 1020 transition count 857
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 1019 transition count 856
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 6 place count 1018 transition count 856
Applied a total of 6 rules in 116 ms. Remains 1018 /1021 variables (removed 3) and now considering 856/858 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1018/1021 places, 856/858 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) 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 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 101105 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{3=1}
Probabilistic random walk after 101105 steps, saw 82576 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :1
Running SMT prover for 13 properties.
// Phase 1: matrix 856 rows 1018 cols
[2023-03-20 02:41:38] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:41:39] [INFO ] [Real]Absence check using 438 positive place invariants in 86 ms returned sat
[2023-03-20 02:41:39] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 02:41:39] [INFO ] [Nat]Absence check using 438 positive place invariants in 102 ms returned sat
[2023-03-20 02:41:41] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-20 02:41:41] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-20 02:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2023-03-20 02:41:42] [INFO ] After 2678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 773 ms.
[2023-03-20 02:41:43] [INFO ] After 4390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 259 ms.
Support contains 14 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 856/856 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 1018 transition count 855
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 1017 transition count 855
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 1012 transition count 850
Applied a total of 12 rules in 37 ms. Remains 1012 /1018 variables (removed 6) and now considering 850/856 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1012/1018 places, 850/856 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 92112 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{5=1, 6=1}
Probabilistic random walk after 92112 steps, saw 75396 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :2
Running SMT prover for 8 properties.
// Phase 1: matrix 850 rows 1012 cols
[2023-03-20 02:41:47] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:41:48] [INFO ] [Real]Absence check using 438 positive place invariants in 84 ms returned sat
[2023-03-20 02:41:48] [INFO ] After 871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:41:49] [INFO ] [Nat]Absence check using 438 positive place invariants in 120 ms returned sat
[2023-03-20 02:41:50] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:41:51] [INFO ] After 1995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-20 02:41:51] [INFO ] After 3131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 11 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 850/850 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 1012 transition count 848
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 1010 transition count 848
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 6 place count 1009 transition count 847
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 10 place count 1007 transition count 847
Applied a total of 10 rules in 68 ms. Remains 1007 /1012 variables (removed 5) and now considering 847/850 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1007/1012 places, 847/850 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 102647 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{2=1, 6=1}
Probabilistic random walk after 102647 steps, saw 80933 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 847 rows 1007 cols
[2023-03-20 02:41:55] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-20 02:41:56] [INFO ] [Real]Absence check using 438 positive place invariants in 77 ms returned sat
[2023-03-20 02:41:56] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:41:56] [INFO ] [Nat]Absence check using 438 positive place invariants in 77 ms returned sat
[2023-03-20 02:41:57] [INFO ] After 924ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 02:41:57] [INFO ] After 1353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-20 02:41:58] [INFO ] After 2065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 9 out of 1007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 847/847 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1007 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1006 transition count 846
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 2 with 2 rules applied. Total rules applied 4 place count 1005 transition count 845
Applied a total of 4 rules in 49 ms. Remains 1005 /1007 variables (removed 2) and now considering 845/847 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1005/1007 places, 845/847 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 103900 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{1=1, 5=1}
Probabilistic random walk after 103900 steps, saw 85001 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 845 rows 1005 cols
[2023-03-20 02:42:01] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-20 02:42:02] [INFO ] [Real]Absence check using 438 positive place invariants in 57 ms returned sat
[2023-03-20 02:42:02] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:42:02] [INFO ] [Nat]Absence check using 438 positive place invariants in 65 ms returned sat
[2023-03-20 02:42:02] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:42:03] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-20 02:42:03] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 5 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 845/845 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 1005 transition count 843
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 1003 transition count 843
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 6 place count 1002 transition count 842
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1002 transition count 842
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1001 transition count 841
Applied a total of 8 rules in 73 ms. Remains 1001 /1005 variables (removed 4) and now considering 841/845 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1001/1005 places, 841/845 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 98194 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98194 steps, saw 77867 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 841 rows 1001 cols
[2023-03-20 02:42:07] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:42:07] [INFO ] [Real]Absence check using 438 positive place invariants in 94 ms returned sat
[2023-03-20 02:42:07] [INFO ] After 342ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-20 02:42:07] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2023-03-20 02:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-20 02:42:07] [INFO ] After 563ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:42:07] [INFO ] After 832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:42:08] [INFO ] [Nat]Absence check using 438 positive place invariants in 115 ms returned sat
[2023-03-20 02:42:09] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:42:09] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 14 ms to minimize.
[2023-03-20 02:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-20 02:42:09] [INFO ] After 1380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-20 02:42:09] [INFO ] After 1981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 841/841 transitions.
Applied a total of 0 rules in 24 ms. Remains 1001 /1001 variables (removed 0) and now considering 841/841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1001/1001 places, 841/841 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 841/841 transitions.
Applied a total of 0 rules in 18 ms. Remains 1001 /1001 variables (removed 0) and now considering 841/841 (removed 0) transitions.
[2023-03-20 02:42:09] [INFO ] Invariant cache hit.
[2023-03-20 02:42:10] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-20 02:42:10] [INFO ] Invariant cache hit.
[2023-03-20 02:42:12] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-20 02:42:12] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-20 02:42:12] [INFO ] Invariant cache hit.
[2023-03-20 02:42:12] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2831 ms. Remains : 1001/1001 places, 841/841 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 1001 transition count 841
Applied a total of 234 rules in 47 ms. Remains 1001 /1001 variables (removed 0) and now considering 841/841 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 841 rows 1001 cols
[2023-03-20 02:42:12] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:42:13] [INFO ] [Real]Absence check using 438 positive place invariants in 79 ms returned sat
[2023-03-20 02:42:13] [INFO ] After 519ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-20 02:42:13] [INFO ] State equation strengthened by 228 read => feed constraints.
[2023-03-20 02:42:13] [INFO ] After 134ms SMT Verify possible using 228 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:42:13] [INFO ] After 955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:42:14] [INFO ] [Nat]Absence check using 438 positive place invariants in 104 ms returned sat
[2023-03-20 02:42:14] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:42:15] [INFO ] After 257ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 02:42:15] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 0 ms to minimize.
[2023-03-20 02:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2023-03-20 02:42:15] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 3 ms to minimize.
[2023-03-20 02:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2023-03-20 02:42:16] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2023-03-20 02:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-20 02:42:16] [INFO ] After 1596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-20 02:42:16] [INFO ] After 2878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 638 stabilizing places and 638 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p1 U (p2||G(p1))) U ((!p3&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))&&p0)))'
Support contains 4 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2686 transition count 1848
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 2128 transition count 1847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1530
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1755 place count 1807 transition count 1527
Iterating global reduction 3 with 3 rules applied. Total rules applied 1758 place count 1807 transition count 1527
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1758 place count 1807 transition count 1524
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1764 place count 1804 transition count 1524
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 3124 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3125 place count 1124 transition count 843
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 3127 place count 1123 transition count 842
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 3329 place count 1022 transition count 842
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3363 place count 1005 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3365 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3366 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3366 place count 1002 transition count 838
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 3370 place count 1000 transition count 838
Applied a total of 3370 rules in 473 ms. Remains 1000 /2687 variables (removed 1687) and now considering 838/2407 (removed 1569) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2023-03-20 02:42:17] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-20 02:42:18] [INFO ] Implicit Places using invariants in 474 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2687 places, 838/2407 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 996 transition count 836
Applied a total of 4 rules in 72 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2023-03-20 02:42:18] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-20 02:42:18] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-20 02:42:18] [INFO ] Invariant cache hit.
[2023-03-20 02:42:19] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2687 places, 836/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2840 ms. Remains : 996/2687 places, 836/2407 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p3 p0) (AND p1 p3 p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s585 1) (NEQ s877 1)), p1:(NEQ s585 1), p0:(AND (EQ s732 1) (EQ s734 1)), p3:(AND (EQ s732 1) (EQ s734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14 reset in 803 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-00 finished in 4083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1531
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1750 place count 1811 transition count 1531
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1753 place count 1808 transition count 1528
Iterating global reduction 2 with 3 rules applied. Total rules applied 1756 place count 1808 transition count 1528
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1756 place count 1808 transition count 1525
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1762 place count 1805 transition count 1525
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 3126 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3127 place count 1123 transition count 842
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 3129 place count 1122 transition count 841
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 3331 place count 1021 transition count 841
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3365 place count 1004 transition count 841
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3367 place count 1002 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3368 place count 1001 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3368 place count 1001 transition count 837
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3372 place count 999 transition count 837
Applied a total of 3372 rules in 479 ms. Remains 999 /2687 variables (removed 1688) and now considering 837/2407 (removed 1570) transitions.
// Phase 1: matrix 837 rows 999 cols
[2023-03-20 02:42:21] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-20 02:42:22] [INFO ] Implicit Places using invariants in 564 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 565 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2687 places, 837/2407 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 995 transition count 835
Applied a total of 4 rules in 33 ms. Remains 995 /997 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 995 cols
[2023-03-20 02:42:22] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-20 02:42:22] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-20 02:42:22] [INFO ] Invariant cache hit.
[2023-03-20 02:42:23] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2687 places, 835/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2797 ms. Remains : 995/2687 places, 835/2407 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s147 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 664 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-01 finished in 3571 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))&&(X(X(p1)) U (p1 U p0))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 300 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-20 02:42:24] [INFO ] Computed 441 place invariants in 16 ms
[2023-03-20 02:42:25] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-20 02:42:25] [INFO ] Invariant cache hit.
[2023-03-20 02:42:28] [INFO ] Implicit Places using invariants and state equation in 3008 ms returned []
Implicit Place search using SMT with State Equation took 3987 ms to find 0 implicit places.
[2023-03-20 02:42:28] [INFO ] Invariant cache hit.
[2023-03-20 02:42:30] [INFO ] Dead Transitions using invariants and state equation in 1947 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6234 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s865 1) (EQ s891 1)), p1:(EQ s2061 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-04 finished in 6520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 2 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 377 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
[2023-03-20 02:42:31] [INFO ] Invariant cache hit.
[2023-03-20 02:42:32] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2023-03-20 02:42:32] [INFO ] Invariant cache hit.
[2023-03-20 02:42:35] [INFO ] Implicit Places using invariants and state equation in 3109 ms returned []
Implicit Place search using SMT with State Equation took 4148 ms to find 0 implicit places.
[2023-03-20 02:42:35] [INFO ] Invariant cache hit.
[2023-03-20 02:42:37] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5997 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s1631 1), p0:(EQ s1104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 301 reset in 468 ms.
Product exploration explored 100000 steps with 297 reset in 519 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Finished random walk after 317 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=158 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 353 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1)]
[2023-03-20 02:42:39] [INFO ] Invariant cache hit.
[2023-03-20 02:42:42] [INFO ] [Real]Absence check using 441 positive place invariants in 852 ms returned sat
[2023-03-20 02:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:42:54] [INFO ] [Real]Absence check using state equation in 12376 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2681 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2680 transition count 1840
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2120 transition count 1840
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 1120 place count 2120 transition count 1520
Deduced a syphon composed of 320 places in 3 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 2 with 1348 rules applied. Total rules applied 3108 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3109 place count 1126 transition count 845
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 3111 place count 1125 transition count 844
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 3313 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3349 place count 1006 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3351 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3352 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3352 place count 1003 transition count 840
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 3356 place count 1001 transition count 840
Applied a total of 3356 rules in 449 ms. Remains 1001 /2681 variables (removed 1680) and now considering 840/2401 (removed 1561) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-20 02:42:54] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-20 02:42:55] [INFO ] Implicit Places using invariants in 707 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 710 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2681 places, 840/2401 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 997 transition count 838
Applied a total of 4 rules in 33 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-20 02:42:55] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:42:56] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-20 02:42:56] [INFO ] Invariant cache hit.
[2023-03-20 02:42:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 02:42:57] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2681 places, 838/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3004 ms. Remains : 997/2681 places, 838/2401 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/997 stabilizing places and 4/838 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 346 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1)]
[2023-03-20 02:42:58] [INFO ] Invariant cache hit.
[2023-03-20 02:42:59] [INFO ] [Real]Absence check using 438 positive place invariants in 252 ms returned sat
[2023-03-20 02:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:43:00] [INFO ] [Real]Absence check using state equation in 1482 ms returned sat
[2023-03-20 02:43:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:43:01] [INFO ] [Nat]Absence check using 438 positive place invariants in 230 ms returned sat
[2023-03-20 02:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:43:02] [INFO ] [Nat]Absence check using state equation in 1351 ms returned sat
[2023-03-20 02:43:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 02:43:02] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2023-03-20 02:43:02] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-20 02:43:03] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-20 02:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-03-20 02:43:03] [INFO ] Computed and/alt/rep : 832/1343/832 causal constraints (skipped 0 transitions) in 74 ms.
[2023-03-20 02:43:15] [INFO ] Added : 595 causal constraints over 119 iterations in 12426 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 17014 reset in 790 ms.
Stack based approach found an accepted trace after 4 steps with 1 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-05 finished in 45264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2682 transition count 2402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2682 transition count 2402
Applied a total of 10 rules in 333 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-20 02:43:16] [INFO ] Computed 441 place invariants in 13 ms
[2023-03-20 02:43:17] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2023-03-20 02:43:17] [INFO ] Invariant cache hit.
[2023-03-20 02:43:20] [INFO ] Implicit Places using invariants and state equation in 2840 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
[2023-03-20 02:43:20] [INFO ] Invariant cache hit.
[2023-03-20 02:43:22] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2687 places, 2402/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5822 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s1032 1), p0:(AND (NEQ s155 1) (EQ s1193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-06 finished in 6039 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))||F(p1)))'
Support contains 4 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2682 transition count 2402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2682 transition count 2402
Applied a total of 10 rules in 289 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-20 02:43:22] [INFO ] Computed 441 place invariants in 18 ms
[2023-03-20 02:43:23] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2023-03-20 02:43:23] [INFO ] Invariant cache hit.
[2023-03-20 02:43:24] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2023-03-20 02:43:24] [INFO ] Invariant cache hit.
[2023-03-20 02:43:26] [INFO ] Dead Transitions using invariants and state equation in 2081 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2687 places, 2402/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4380 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1568 1), p0:(OR (AND (EQ s2304 1) (EQ s2344 1)) (EQ s1331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 245 reset in 467 ms.
Product exploration explored 100000 steps with 243 reset in 585 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2682 stabilizing places and 638/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 398 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=132 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-20 02:43:28] [INFO ] Invariant cache hit.
[2023-03-20 02:43:30] [INFO ] [Real]Absence check using 441 positive place invariants in 699 ms returned sat
[2023-03-20 02:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:43:43] [INFO ] [Real]Absence check using state equation in 12707 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2681 transition count 1841
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2121 transition count 1841
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 1120 place count 2121 transition count 1523
Deduced a syphon composed of 318 places in 3 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1756 place count 1803 transition count 1523
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3108 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3109 place count 1127 transition count 846
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3111 place count 1126 transition count 845
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 3313 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3347 place count 1008 transition count 845
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3349 place count 1006 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3350 place count 1005 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3350 place count 1005 transition count 841
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 3354 place count 1003 transition count 841
Applied a total of 3354 rules in 372 ms. Remains 1003 /2682 variables (removed 1679) and now considering 841/2402 (removed 1561) transitions.
// Phase 1: matrix 841 rows 1003 cols
[2023-03-20 02:43:44] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-20 02:43:44] [INFO ] Implicit Places using invariants in 594 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 595 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2682 places, 841/2402 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 999 transition count 839
Applied a total of 4 rules in 31 ms. Remains 999 /1001 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 999 cols
[2023-03-20 02:43:44] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:43:45] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-20 02:43:45] [INFO ] Invariant cache hit.
[2023-03-20 02:43:46] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/2682 places, 839/2402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2666 ms. Remains : 999/2682 places, 839/2402 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/999 stabilizing places and 2/839 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 262 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-20 02:43:47] [INFO ] Invariant cache hit.
[2023-03-20 02:43:48] [INFO ] [Real]Absence check using 438 positive place invariants in 244 ms returned sat
[2023-03-20 02:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:43:49] [INFO ] [Real]Absence check using state equation in 1816 ms returned sat
[2023-03-20 02:43:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:43:50] [INFO ] [Nat]Absence check using 438 positive place invariants in 312 ms returned sat
[2023-03-20 02:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:43:52] [INFO ] [Nat]Absence check using state equation in 1475 ms returned sat
[2023-03-20 02:43:52] [INFO ] Computed and/alt/rep : 833/1318/833 causal constraints (skipped 0 transitions) in 70 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:44:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17730 reset in 742 ms.
Stack based approach found an accepted trace after 174 steps with 36 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-07 finished in 43344 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) U p1)||X(F(p0)))))'
Support contains 2 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 299 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-20 02:44:06] [INFO ] Computed 441 place invariants in 14 ms
[2023-03-20 02:44:07] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-20 02:44:07] [INFO ] Invariant cache hit.
[2023-03-20 02:44:10] [INFO ] Implicit Places using invariants and state equation in 2992 ms returned []
Implicit Place search using SMT with State Equation took 3924 ms to find 0 implicit places.
[2023-03-20 02:44:10] [INFO ] Invariant cache hit.
[2023-03-20 02:44:11] [INFO ] Dead Transitions using invariants and state equation in 1665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5911 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1497 1), p0:(EQ s2619 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9456 reset in 419 ms.
Product exploration explored 100000 steps with 9378 reset in 476 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-20 02:44:13] [INFO ] Invariant cache hit.
[2023-03-20 02:44:15] [INFO ] [Real]Absence check using 441 positive place invariants in 641 ms returned sat
[2023-03-20 02:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:44:28] [INFO ] [Real]Absence check using state equation in 12810 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2680 transition count 1842
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2122 transition count 1842
Performed 322 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 322 Pre rules applied. Total rules applied 1116 place count 2122 transition count 1520
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 2 with 644 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 2 with 1350 rules applied. Total rules applied 3110 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3111 place count 1125 transition count 844
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 3113 place count 1124 transition count 843
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 3315 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3351 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3352 place count 1004 transition count 842
Applied a total of 3352 rules in 367 ms. Remains 1004 /2681 variables (removed 1677) and now considering 842/2401 (removed 1559) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2023-03-20 02:44:28] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-20 02:44:29] [INFO ] Implicit Places using invariants in 499 ms returned [997]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 519 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2681 places, 842/2401 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 1003 transition count 840
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 1001 transition count 840
Applied a total of 4 rules in 21 ms. Remains 1001 /1003 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-20 02:44:29] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-20 02:44:29] [INFO ] Implicit Places using invariants in 479 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 486 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/2681 places, 840/2401 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 997 transition count 838
Applied a total of 4 rules in 32 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-20 02:44:29] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-20 02:44:30] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-20 02:44:30] [INFO ] Invariant cache hit.
[2023-03-20 02:44:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-20 02:44:31] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 997/2681 places, 838/2401 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3146 ms. Remains : 997/2681 places, 838/2401 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/997 stabilizing places and 4/838 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLFireability-08 finished in 25793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1||F(G(p2)))))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 272 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-20 02:44:31] [INFO ] Computed 441 place invariants in 6 ms
[2023-03-20 02:44:32] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-20 02:44:32] [INFO ] Invariant cache hit.
[2023-03-20 02:44:35] [INFO ] Implicit Places using invariants and state equation in 2982 ms returned []
Implicit Place search using SMT with State Equation took 3953 ms to find 0 implicit places.
[2023-03-20 02:44:35] [INFO ] Invariant cache hit.
[2023-03-20 02:44:37] [INFO ] Dead Transitions using invariants and state equation in 1551 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5777 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2248 0), p1:(EQ s550 0), p2:(EQ s1470 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1113 ms.
Product exploration explored 100000 steps with 33333 reset in 1016 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLFireability-09 finished in 8335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1530
Deduced a syphon composed of 317 places in 3 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1754 place count 1808 transition count 1528
Iterating global reduction 2 with 2 rules applied. Total rules applied 1756 place count 1808 transition count 1528
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1756 place count 1808 transition count 1526
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1760 place count 1806 transition count 1526
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 3120 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1126 transition count 845
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 3123 place count 1125 transition count 844
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 3325 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3361 place count 1006 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3363 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3364 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3364 place count 1003 transition count 840
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 3368 place count 1001 transition count 840
Applied a total of 3368 rules in 495 ms. Remains 1001 /2687 variables (removed 1686) and now considering 840/2407 (removed 1567) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-20 02:44:40] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-20 02:44:41] [INFO ] Implicit Places using invariants in 650 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 653 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2687 places, 840/2407 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 997 transition count 838
Applied a total of 4 rules in 33 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-20 02:44:41] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:44:41] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-20 02:44:41] [INFO ] Invariant cache hit.
[2023-03-20 02:44:43] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2687 places, 838/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3156 ms. Remains : 997/2687 places, 838/2407 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s551 0), p1:(AND (EQ s178 1) (EQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 661 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-10 finished in 3983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U p2)))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2682 transition count 2402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2682 transition count 2402
Applied a total of 10 rules in 278 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-20 02:44:44] [INFO ] Computed 441 place invariants in 14 ms
[2023-03-20 02:44:45] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-20 02:44:45] [INFO ] Invariant cache hit.
[2023-03-20 02:44:47] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2023-03-20 02:44:47] [INFO ] Invariant cache hit.
[2023-03-20 02:44:49] [INFO ] Dead Transitions using invariants and state equation in 1721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2687 places, 2402/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5499 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2346 1), p2:(EQ s2109 1), p1:(EQ s1163 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-11 finished in 5732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1532
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1748 place count 1812 transition count 1532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1751 place count 1809 transition count 1529
Iterating global reduction 2 with 3 rules applied. Total rules applied 1754 place count 1809 transition count 1529
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1754 place count 1809 transition count 1526
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1760 place count 1806 transition count 1526
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 3124 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3125 place count 1124 transition count 843
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 3127 place count 1123 transition count 842
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 3329 place count 1022 transition count 842
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3363 place count 1005 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3365 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3366 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3366 place count 1002 transition count 838
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 3370 place count 1000 transition count 838
Applied a total of 3370 rules in 412 ms. Remains 1000 /2687 variables (removed 1687) and now considering 838/2407 (removed 1569) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2023-03-20 02:44:50] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-20 02:44:50] [INFO ] Implicit Places using invariants in 553 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 555 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2687 places, 838/2407 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 996 transition count 836
Applied a total of 4 rules in 40 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2023-03-20 02:44:50] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-20 02:44:51] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-20 02:44:51] [INFO ] Invariant cache hit.
[2023-03-20 02:44:52] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2687 places, 836/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2628 ms. Remains : 996/2687 places, 836/2407 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s148 1) (EQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Stack based approach found an accepted trace after 201 steps with 0 reset with depth 202 and stack size 202 in 2 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-12 finished in 3339 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 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1530
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1755 place count 1807 transition count 1527
Iterating global reduction 2 with 3 rules applied. Total rules applied 1758 place count 1807 transition count 1527
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1758 place count 1807 transition count 1524
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1764 place count 1804 transition count 1524
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 3126 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3127 place count 1123 transition count 842
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 3129 place count 1122 transition count 841
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 3331 place count 1021 transition count 841
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3367 place count 1003 transition count 841
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3369 place count 1001 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3370 place count 1000 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3370 place count 1000 transition count 837
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 3374 place count 998 transition count 837
Applied a total of 3374 rules in 375 ms. Remains 998 /2687 variables (removed 1689) and now considering 837/2407 (removed 1570) transitions.
// Phase 1: matrix 837 rows 998 cols
[2023-03-20 02:44:53] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-20 02:44:54] [INFO ] Implicit Places using invariants in 628 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 630 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/2687 places, 837/2407 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 994 transition count 835
Applied a total of 4 rules in 31 ms. Remains 994 /996 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 994 cols
[2023-03-20 02:44:54] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-20 02:44:54] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-20 02:44:54] [INFO ] Invariant cache hit.
[2023-03-20 02:44:55] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 994/2687 places, 835/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2938 ms. Remains : 994/2687 places, 835/2407 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s280 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 693 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-13 finished in 3693 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(p1))||p0) U (G(p2) U p3)))'
Support contains 5 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2686 transition count 1850
Reduce places removed 556 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 557 rules applied. Total rules applied 1113 place count 2130 transition count 1849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1114 place count 2129 transition count 1849
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 1114 place count 2129 transition count 1532
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1748 place count 1812 transition count 1532
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1751 place count 1809 transition count 1529
Iterating global reduction 3 with 3 rules applied. Total rules applied 1754 place count 1809 transition count 1529
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1754 place count 1809 transition count 1526
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1760 place count 1806 transition count 1526
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 3112 place count 1130 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3113 place count 1130 transition count 849
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 3115 place count 1129 transition count 848
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 3317 place count 1028 transition count 848
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3353 place count 1010 transition count 848
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3354 place count 1010 transition count 848
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3356 place count 1008 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3357 place count 1007 transition count 846
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3357 place count 1007 transition count 844
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 3361 place count 1005 transition count 844
Applied a total of 3361 rules in 508 ms. Remains 1005 /2687 variables (removed 1682) and now considering 844/2407 (removed 1563) transitions.
// Phase 1: matrix 844 rows 1005 cols
[2023-03-20 02:44:57] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-20 02:44:57] [INFO ] Implicit Places using invariants in 541 ms returned [988, 992]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 556 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2687 places, 844/2407 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 1001 transition count 842
Applied a total of 4 rules in 32 ms. Remains 1001 /1003 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 1001 cols
[2023-03-20 02:44:57] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-20 02:44:58] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-20 02:44:58] [INFO ] Invariant cache hit.
[2023-03-20 02:44:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:44:59] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1001/2687 places, 842/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2881 ms. Remains : 1001/2687 places, 842/2407 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s317 1) (EQ s352 1)), p2:(EQ s375 1), p0:(OR (EQ s278 1) (EQ s554 1)), p1:(NEQ s554 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 26598 reset in 891 ms.
Stack based approach found an accepted trace after 35 steps with 11 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-14 finished in 3971 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 U p1))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2686 transition count 1849
Reduce places removed 557 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 558 rules applied. Total rules applied 1115 place count 2129 transition count 1848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1116 place count 2128 transition count 1848
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 1116 place count 2128 transition count 1533
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1746 place count 1813 transition count 1533
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1749 place count 1810 transition count 1530
Iterating global reduction 3 with 3 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1752 place count 1810 transition count 1527
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1758 place count 1807 transition count 1527
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 3 with 1364 rules applied. Total rules applied 3122 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3123 place count 1125 transition count 844
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 3125 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3327 place count 1023 transition count 843
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3359 place count 1007 transition count 843
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3361 place count 1005 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3362 place count 1004 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3362 place count 1004 transition count 839
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 3366 place count 1002 transition count 839
Applied a total of 3366 rules in 385 ms. Remains 1002 /2687 variables (removed 1685) and now considering 839/2407 (removed 1568) transitions.
// Phase 1: matrix 839 rows 1002 cols
[2023-03-20 02:45:01] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-20 02:45:01] [INFO ] Implicit Places using invariants in 536 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 537 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2687 places, 839/2407 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 998 transition count 837
Applied a total of 4 rules in 31 ms. Remains 998 /1000 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 998 cols
[2023-03-20 02:45:01] [INFO ] Computed 438 place invariants in 13 ms
[2023-03-20 02:45:02] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-20 02:45:02] [INFO ] Invariant cache hit.
[2023-03-20 02:45:03] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 998/2687 places, 837/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2637 ms. Remains : 998/2687 places, 837/2407 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s904 1), p0:(AND (EQ s929 1) (EQ s673 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 0 reset in 669 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-15 finished in 3445 ms.
All properties solved by simple procedures.
Total runtime 279476 ms.
ITS solved all properties within timeout

BK_STOP 1679280304368

--------------------
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

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-040B"
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-040B, 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-167903715600668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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