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.r389-oct2-167903713800668.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 itstools
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 r389-oct2-167903713800668
=====================================================================

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

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 09:58:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 09:58:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:58:58] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-19 09:58:59] [INFO ] Transformed 3123 places.
[2023-03-19 09:58:59] [INFO ] Transformed 2843 transitions.
[2023-03-19 09:58:59] [INFO ] Found NUPN structural information;
[2023-03-19 09:58:59] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 431 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 1306 ms. Remains 2687 /3123 variables (removed 436) and now considering 2407/2843 (removed 436) transitions.
// Phase 1: matrix 2407 rows 2687 cols
[2023-03-19 09:59:00] [INFO ] Computed 441 place invariants in 45 ms
[2023-03-19 09:59:02] [INFO ] Implicit Places using invariants in 1638 ms returned []
[2023-03-19 09:59:02] [INFO ] Invariant cache hit.
[2023-03-19 09:59:05] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 5129 ms to find 0 implicit places.
[2023-03-19 09:59:05] [INFO ] Invariant cache hit.
[2023-03-19 09:59:07] [INFO ] Dead Transitions using invariants and state equation in 1992 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 8435 ms. Remains : 2687/3123 places, 2407/2843 transitions.
Support contains 40 out of 2687 places after structural reductions.
[2023-03-19 09:59:08] [INFO ] Flatten gal took : 165 ms
[2023-03-19 09:59:08] [INFO ] Flatten gal took : 90 ms
[2023-03-19 09:59:08] [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 576 ms. (steps per millisecond=17 ) properties (out of 31) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-19 09:59:09] [INFO ] Invariant cache hit.
[2023-03-19 09:59:10] [INFO ] [Real]Absence check using 441 positive place invariants in 295 ms returned sat
[2023-03-19 09:59:11] [INFO ] After 2204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 09:59:12] [INFO ] [Nat]Absence check using 441 positive place invariants in 194 ms returned sat
[2023-03-19 09:59:16] [INFO ] After 3432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 09:59:17] [INFO ] Deduced a trap composed of 33 places in 525 ms of which 8 ms to minimize.
[2023-03-19 09:59:18] [INFO ] Deduced a trap composed of 21 places in 799 ms of which 15 ms to minimize.
[2023-03-19 09:59:18] [INFO ] Deduced a trap composed of 17 places in 500 ms of which 1 ms to minimize.
[2023-03-19 09:59:19] [INFO ] Deduced a trap composed of 20 places in 543 ms of which 1 ms to minimize.
[2023-03-19 09:59:20] [INFO ] Deduced a trap composed of 23 places in 406 ms of which 2 ms to minimize.
[2023-03-19 09:59:20] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 1 ms to minimize.
[2023-03-19 09:59:21] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 1 ms to minimize.
[2023-03-19 09:59:21] [INFO ] Deduced a trap composed of 18 places in 458 ms of which 2 ms to minimize.
[2023-03-19 09:59:22] [INFO ] Deduced a trap composed of 17 places in 515 ms of which 1 ms to minimize.
[2023-03-19 09:59:22] [INFO ] Deduced a trap composed of 25 places in 420 ms of which 2 ms to minimize.
[2023-03-19 09:59:23] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 1 ms to minimize.
[2023-03-19 09:59:23] [INFO ] Deduced a trap composed of 30 places in 514 ms of which 3 ms to minimize.
[2023-03-19 09:59:24] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 1 ms to minimize.
[2023-03-19 09:59:24] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 1 ms to minimize.
[2023-03-19 09:59:25] [INFO ] Deduced a trap composed of 28 places in 343 ms of which 1 ms to minimize.
[2023-03-19 09:59:25] [INFO ] Deduced a trap composed of 22 places in 398 ms of which 1 ms to minimize.
[2023-03-19 09:59:26] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 1 ms to minimize.
[2023-03-19 09:59:26] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2023-03-19 09:59:26] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 1 ms to minimize.
[2023-03-19 09:59:27] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 0 ms to minimize.
[2023-03-19 09:59:27] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 0 ms to minimize.
[2023-03-19 09:59:28] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 0 ms to minimize.
[2023-03-19 09:59:28] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 1 ms to minimize.
[2023-03-19 09:59:28] [INFO ] Deduced a trap composed of 37 places in 341 ms of which 1 ms to minimize.
[2023-03-19 09:59:29] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 1 ms to minimize.
[2023-03-19 09:59:29] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2023-03-19 09:59:30] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 1 ms to minimize.
[2023-03-19 09:59:30] [INFO ] Deduced a trap composed of 46 places in 325 ms of which 1 ms to minimize.
[2023-03-19 09:59:30] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 1 ms to minimize.
[2023-03-19 09:59:31] [INFO ] Deduced a trap composed of 47 places in 273 ms of which 0 ms to minimize.
[2023-03-19 09:59:31] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 1 ms to minimize.
[2023-03-19 09:59:32] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 14 ms to minimize.
[2023-03-19 09:59:32] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 1 ms to minimize.
[2023-03-19 09:59:32] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 1 ms to minimize.
[2023-03-19 09:59:33] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 1 ms to minimize.
[2023-03-19 09:59:33] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2023-03-19 09:59:33] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 1 ms to minimize.
[2023-03-19 09:59:34] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 1 ms to minimize.
[2023-03-19 09:59:34] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2023-03-19 09:59:34] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 1 ms to minimize.
[2023-03-19 09:59:35] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 1 ms to minimize.
[2023-03-19 09:59:35] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 0 ms to minimize.
[2023-03-19 09:59:35] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 1 ms to minimize.
[2023-03-19 09:59:36] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 1 ms to minimize.
[2023-03-19 09:59:36] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:59:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:59:36] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2090 ms.
Support contains 23 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 3 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 6 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 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 3 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 3082 place count 1146 transition count 866
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3083 place count 1146 transition count 865
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 3085 place count 1145 transition count 864
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 3287 place count 1044 transition count 864
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 3315 place count 1030 transition count 864
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3316 place count 1030 transition count 863
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3317 place count 1029 transition count 863
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 5 with 116 rules applied. Total rules applied 3433 place count 1029 transition count 863
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3434 place count 1028 transition count 862
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3435 place count 1027 transition count 862
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3435 place count 1027 transition count 860
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3439 place count 1025 transition count 860
Applied a total of 3439 rules in 712 ms. Remains 1025 /2687 variables (removed 1662) and now considering 860/2407 (removed 1547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 1025/2687 places, 860/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 17) seen :2
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 1000 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 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 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 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 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 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 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 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 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 860 rows 1025 cols
[2023-03-19 09:59:39] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-19 09:59:40] [INFO ] [Real]Absence check using 440 positive place invariants in 97 ms returned sat
[2023-03-19 09:59:40] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 09:59:41] [INFO ] [Nat]Absence check using 440 positive place invariants in 117 ms returned sat
[2023-03-19 09:59:42] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-19 09:59:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:59:43] [INFO ] After 803ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-19 09:59:43] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 14 ms to minimize.
[2023-03-19 09:59:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-19 09:59:44] [INFO ] After 2192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 801 ms.
[2023-03-19 09:59:45] [INFO ] After 5162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 267 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 22 ms. Remains : 1025/1025 places, 860/860 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) 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 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 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 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 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 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 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 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 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 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 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 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 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 76113 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76113 steps, saw 57372 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-19 09:59:49] [INFO ] Invariant cache hit.
[2023-03-19 09:59:50] [INFO ] [Real]Absence check using 440 positive place invariants in 187 ms returned sat
[2023-03-19 09:59:50] [INFO ] After 744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-19 09:59:50] [INFO ] [Nat]Absence check using 440 positive place invariants in 104 ms returned sat
[2023-03-19 09:59:52] [INFO ] After 1311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-19 09:59:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:59:53] [INFO ] After 892ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-19 09:59:54] [INFO ] After 2226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 804 ms.
[2023-03-19 09:59:55] [INFO ] After 5384ms 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 197 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 24 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 24 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 22 ms. Remains 1025 /1025 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-19 09:59:55] [INFO ] Invariant cache hit.
[2023-03-19 09:59:56] [INFO ] Implicit Places using invariants in 623 ms returned [1008, 1012]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 625 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 34 ms. Remains 1021 /1023 variables (removed 2) and now considering 858/860 (removed 2) transitions.
// Phase 1: matrix 858 rows 1021 cols
[2023-03-19 09:59:56] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 09:59:57] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-19 09:59:57] [INFO ] Invariant cache hit.
[2023-03-19 09:59:58] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1844 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 2527 ms. Remains : 1021/1025 places, 858/860 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 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 10000 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 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 85930 steps, run timeout after 3038 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85930 steps, saw 64890 distinct states, run finished after 3039 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-19 10:00:03] [INFO ] Invariant cache hit.
[2023-03-19 10:00:03] [INFO ] [Real]Absence check using 438 positive place invariants in 100 ms returned sat
[2023-03-19 10:00:03] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 10:00:04] [INFO ] [Nat]Absence check using 438 positive place invariants in 108 ms returned sat
[2023-03-19 10:00:05] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 10:00:07] [INFO ] After 2573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 787 ms.
[2023-03-19 10:00:08] [INFO ] After 4373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 312 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 1 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 59 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 59 ms. Remains : 1018/1021 places, 856/858 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 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 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 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 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 72396 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{3=1}
Probabilistic random walk after 72396 steps, saw 58534 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :1
Running SMT prover for 13 properties.
// Phase 1: matrix 856 rows 1018 cols
[2023-03-19 10:00:12] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-19 10:00:13] [INFO ] [Real]Absence check using 438 positive place invariants in 100 ms returned sat
[2023-03-19 10:00:13] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 10:00:14] [INFO ] [Nat]Absence check using 438 positive place invariants in 177 ms returned sat
[2023-03-19 10:00:15] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-19 10:00:15] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 0 ms to minimize.
[2023-03-19 10:00:15] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2023-03-19 10:00:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2023-03-19 10:00:16] [INFO ] After 2397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-19 10:00:17] [INFO ] After 4082ms 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 0 properties in 228 ms.
Support contains 17 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 856/856 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1016 transition count 854
Applied a total of 4 rules in 41 ms. Remains 1016 /1018 variables (removed 2) and now considering 854/856 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1016/1018 places, 854/856 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) 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 13) seen :0
Interrupted probabilistic random walk after 78827 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{7=1}
Probabilistic random walk after 78827 steps, saw 63690 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :1
Running SMT prover for 12 properties.
// Phase 1: matrix 854 rows 1016 cols
[2023-03-19 10:00:22] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 10:00:22] [INFO ] [Real]Absence check using 438 positive place invariants in 65 ms returned sat
[2023-03-19 10:00:22] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:00:23] [INFO ] [Nat]Absence check using 438 positive place invariants in 62 ms returned sat
[2023-03-19 10:00:23] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:00:24] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-19 10:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-19 10:00:25] [INFO ] After 2033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 716 ms.
[2023-03-19 10:00:25] [INFO ] After 3177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 288 ms.
Support contains 16 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 854/854 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 1016 transition count 853
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 1015 transition count 853
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 4 place count 1014 transition count 853
Applied a total of 4 rules in 45 ms. Remains 1014 /1016 variables (removed 2) and now considering 853/854 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1014/1016 places, 853/854 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 85065 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{7=1}
Probabilistic random walk after 85065 steps, saw 68763 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 853 rows 1014 cols
[2023-03-19 10:00:30] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 10:00:31] [INFO ] [Real]Absence check using 438 positive place invariants in 143 ms returned sat
[2023-03-19 10:00:31] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:00:31] [INFO ] [Nat]Absence check using 438 positive place invariants in 98 ms returned sat
[2023-03-19 10:00:33] [INFO ] After 1190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:00:33] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-19 10:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-19 10:00:33] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-19 10:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-19 10:00:34] [INFO ] After 2724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 600 ms.
[2023-03-19 10:00:35] [INFO ] After 4187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 355 ms.
Support contains 14 out of 1014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1014/1014 places, 853/853 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 1014 transition count 852
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 1013 transition count 852
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 1012 transition count 851
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 1011 transition count 851
Applied a total of 6 rules in 51 ms. Remains 1011 /1014 variables (removed 3) and now considering 851/853 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1011/1014 places, 851/853 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 851 rows 1011 cols
[2023-03-19 10:00:36] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 10:00:37] [INFO ] [Real]Absence check using 438 positive place invariants in 87 ms returned sat
[2023-03-19 10:00:37] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 10:00:37] [INFO ] [Nat]Absence check using 438 positive place invariants in 93 ms returned sat
[2023-03-19 10:00:38] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 10:00:38] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-19 10:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-19 10:00:39] [INFO ] After 1860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 576 ms.
[2023-03-19 10:00:40] [INFO ] After 3118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 12 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 851/851 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 1011 transition count 850
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 1010 transition count 850
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 6 place count 1008 transition count 848
Applied a total of 6 rules in 40 ms. Remains 1008 /1011 variables (removed 3) and now considering 848/851 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1008/1011 places, 848/851 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 106441 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{0=1, 3=1, 7=1}
Probabilistic random walk after 106441 steps, saw 85215 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :3
Running SMT prover for 6 properties.
// Phase 1: matrix 848 rows 1008 cols
[2023-03-19 10:00:44] [INFO ] Computed 438 place invariants in 5 ms
[2023-03-19 10:00:44] [INFO ] [Real]Absence check using 438 positive place invariants in 132 ms returned sat
[2023-03-19 10:00:44] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 10:00:44] [INFO ] [Nat]Absence check using 438 positive place invariants in 83 ms returned sat
[2023-03-19 10:00:45] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 10:00:45] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2023-03-19 10:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-19 10:00:46] [INFO ] After 1139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-19 10:00:46] [INFO ] After 1789ms 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 66 ms.
Support contains 9 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 848/848 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 1008 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1007 transition count 847
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 2 with 4 rules applied. Total rules applied 6 place count 1005 transition count 845
Applied a total of 6 rules in 82 ms. Remains 1005 /1008 variables (removed 3) and now considering 845/848 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1005/1008 places, 845/848 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) 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 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 69 ms. (steps per millisecond=144 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 110372 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{1=1, 5=1}
Probabilistic random walk after 110372 steps, saw 90431 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 845 rows 1005 cols
[2023-03-19 10:00:50] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 10:00:50] [INFO ] [Real]Absence check using 438 positive place invariants in 69 ms returned sat
[2023-03-19 10:00:50] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 10:00:50] [INFO ] [Nat]Absence check using 438 positive place invariants in 84 ms returned sat
[2023-03-19 10:00:51] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 10:00:51] [INFO ] After 1057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-19 10:00:52] [INFO ] After 1676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 127 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 114 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 114 ms. Remains : 1001/1005 places, 841/845 transitions.
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 543 ms. Remains 1000 /2687 variables (removed 1687) and now considering 838/2407 (removed 1569) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2023-03-19 10:00:53] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-19 10:00:54] [INFO ] Implicit Places using invariants in 519 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 521 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 2 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 76 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2023-03-19 10:00:54] [INFO ] Computed 438 place invariants in 5 ms
[2023-03-19 10:00:54] [INFO ] Implicit Places using invariants in 591 ms returned []
[2023-03-19 10:00:54] [INFO ] Invariant cache hit.
[2023-03-19 10:00:56] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1885 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 3026 ms. Remains : 996/2687 places, 836/2407 transitions.
Stuttering acceptance computed with spot in 501 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 13 reset in 899 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-00 finished in 4540 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 1 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 0 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 486 ms. Remains 999 /2687 variables (removed 1688) and now considering 837/2407 (removed 1570) transitions.
// Phase 1: matrix 837 rows 999 cols
[2023-03-19 10:00:57] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-19 10:00:58] [INFO ] Implicit Places using invariants in 563 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 564 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 31 ms. Remains 995 /997 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 995 cols
[2023-03-19 10:00:58] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-19 10:00:59] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-19 10:00:59] [INFO ] Invariant cache hit.
[2023-03-19 10:01:00] [INFO ] Implicit Places using invariants and state equation in 1264 ms returned []
Implicit Place search using SMT with State Equation took 1863 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 2945 ms. Remains : 995/2687 places, 835/2407 transitions.
Stuttering acceptance computed with spot in 107 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 773 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-01 finished in 3857 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 321 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-19 10:01:01] [INFO ] Computed 441 place invariants in 16 ms
[2023-03-19 10:01:02] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2023-03-19 10:01:02] [INFO ] Invariant cache hit.
[2023-03-19 10:01:05] [INFO ] Implicit Places using invariants and state equation in 2848 ms returned []
Implicit Place search using SMT with State Equation took 3928 ms to find 0 implicit places.
[2023-03-19 10:01:05] [INFO ] Invariant cache hit.
[2023-03-19 10:01:07] [INFO ] Dead Transitions using invariants and state equation in 1614 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 5864 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 693 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 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-04 finished in 6610 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 331 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
[2023-03-19 10:01:08] [INFO ] Invariant cache hit.
[2023-03-19 10:01:09] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2023-03-19 10:01:09] [INFO ] Invariant cache hit.
[2023-03-19 10:01:12] [INFO ] Implicit Places using invariants and state equation in 2726 ms returned []
Implicit Place search using SMT with State Equation took 3894 ms to find 0 implicit places.
[2023-03-19 10:01:12] [INFO ] Invariant cache hit.
[2023-03-19 10:01:13] [INFO ] Dead Transitions using invariants and state equation in 1517 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 5749 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 118 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 298 reset in 448 ms.
Product exploration explored 100000 steps with 303 reset in 459 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 247 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 81 ms :[(NOT p1), (NOT p1)]
Finished random walk after 339 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=84 )
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 304 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 57 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1)]
[2023-03-19 10:01:15] [INFO ] Invariant cache hit.
[2023-03-19 10:01:17] [INFO ] [Real]Absence check using 441 positive place invariants in 721 ms returned sat
[2023-03-19 10:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:01:30] [INFO ] [Real]Absence check using state equation in 12682 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 2 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 432 ms. Remains 1001 /2681 variables (removed 1680) and now considering 840/2401 (removed 1561) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-19 10:01:31] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-19 10:01:31] [INFO ] Implicit Places using invariants in 548 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 549 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 37 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-19 10:01:31] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 10:01:32] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-19 10:01:32] [INFO ] Invariant cache hit.
[2023-03-19 10:01:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 10:01:33] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1819 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 2839 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 198 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 62 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
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 405 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 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1)]
[2023-03-19 10:01:34] [INFO ] Invariant cache hit.
[2023-03-19 10:01:35] [INFO ] [Real]Absence check using 438 positive place invariants in 260 ms returned sat
[2023-03-19 10:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:01:36] [INFO ] [Real]Absence check using state equation in 1729 ms returned sat
[2023-03-19 10:01:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:01:37] [INFO ] [Nat]Absence check using 438 positive place invariants in 227 ms returned sat
[2023-03-19 10:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:01:39] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2023-03-19 10:01:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 10:01:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 12 ms returned sat
[2023-03-19 10:01:39] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2023-03-19 10:01:39] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
[2023-03-19 10:01:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2023-03-19 10:01:39] [INFO ] Computed and/alt/rep : 832/1343/832 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-19 10:01:52] [INFO ] Deduced a trap composed of 2 places in 492 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
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-19 10:01:52] [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 (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 16855 reset in 748 ms.
Stack based approach found an accepted trace after 69 steps with 7 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-05 finished in 45425 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 279 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-19 10:01:53] [INFO ] Computed 441 place invariants in 10 ms
[2023-03-19 10:01:54] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2023-03-19 10:01:54] [INFO ] Invariant cache hit.
[2023-03-19 10:01:57] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3940 ms to find 0 implicit places.
[2023-03-19 10:01:57] [INFO ] Invariant cache hit.
[2023-03-19 10:01:59] [INFO ] Dead Transitions using invariants and state equation in 1830 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 6051 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 177 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 6278 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 284 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-19 10:01:59] [INFO ] Computed 441 place invariants in 16 ms
[2023-03-19 10:02:01] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-19 10:02:01] [INFO ] Invariant cache hit.
[2023-03-19 10:02:03] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 4059 ms to find 0 implicit places.
[2023-03-19 10:02:03] [INFO ] Invariant cache hit.
[2023-03-19 10:02:05] [INFO ] Dead Transitions using invariants and state equation in 1598 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 5941 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 111 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 251 reset in 539 ms.
Product exploration explored 100000 steps with 236 reset in 508 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 251 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 63 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 455 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=75 )
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 239 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 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-19 10:02:07] [INFO ] Invariant cache hit.
[2023-03-19 10:02:09] [INFO ] [Real]Absence check using 441 positive place invariants in 712 ms returned sat
[2023-03-19 10:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:02:22] [INFO ] [Real]Absence check using state equation in 12541 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 5 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 1 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 1 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 0 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 427 ms. Remains 1003 /2682 variables (removed 1679) and now considering 841/2402 (removed 1561) transitions.
// Phase 1: matrix 841 rows 1003 cols
[2023-03-19 10:02:22] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-19 10:02:23] [INFO ] Implicit Places using invariants in 607 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 608 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 35 ms. Remains 999 /1001 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 999 cols
[2023-03-19 10:02:23] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-19 10:02:24] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-19 10:02:24] [INFO ] Invariant cache hit.
[2023-03-19 10:02:25] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1889 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 2959 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 223 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 60 ms :[(AND (NOT p0) (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 : [(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 372 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 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-19 10:02:26] [INFO ] Invariant cache hit.
[2023-03-19 10:02:27] [INFO ] [Real]Absence check using 438 positive place invariants in 476 ms returned sat
[2023-03-19 10:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:02:29] [INFO ] [Real]Absence check using state equation in 1880 ms returned sat
[2023-03-19 10:02:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:02:30] [INFO ] [Nat]Absence check using 438 positive place invariants in 334 ms returned sat
[2023-03-19 10:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:02:32] [INFO ] [Nat]Absence check using state equation in 1639 ms returned sat
[2023-03-19 10:02:32] [INFO ] Computed and/alt/rep : 833/1318/833 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-19 10:02:44] [INFO ] Deduced a trap composed of 2 places in 603 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
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-19 10:02:44] [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 34 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17690 reset in 779 ms.
Stack based approach found an accepted trace after 63 steps with 13 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 46206 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 260 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-19 10:02:46] [INFO ] Computed 441 place invariants in 6 ms
[2023-03-19 10:02:47] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-19 10:02:47] [INFO ] Invariant cache hit.
[2023-03-19 10:02:50] [INFO ] Implicit Places using invariants and state equation in 2872 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2023-03-19 10:02:50] [INFO ] Invariant cache hit.
[2023-03-19 10:02:51] [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 5687 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 104 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 9528 reset in 429 ms.
Product exploration explored 100000 steps with 9531 reset in 463 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 275 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 32 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 361 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 68 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-19 10:02:53] [INFO ] Invariant cache hit.
[2023-03-19 10:02:55] [INFO ] [Real]Absence check using 441 positive place invariants in 686 ms returned sat
[2023-03-19 10:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:03:08] [INFO ] [Real]Absence check using state equation in 12580 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 3 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 1 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 296 ms. Remains 1004 /2681 variables (removed 1677) and now considering 842/2401 (removed 1559) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2023-03-19 10:03:08] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-19 10:03:09] [INFO ] Implicit Places using invariants in 627 ms returned [997]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 645 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 38 ms. Remains 1001 /1003 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-19 10:03:09] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-19 10:03:10] [INFO ] Implicit Places using invariants in 585 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 605 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 30 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-19 10:03:10] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-19 10:03:10] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-19 10:03:10] [INFO ] Invariant cache hit.
[2023-03-19 10:03:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-19 10:03:12] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 2060 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 3677 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 126 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 26508 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 282 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-19 10:03:12] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-19 10:03:13] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2023-03-19 10:03:13] [INFO ] Invariant cache hit.
[2023-03-19 10:03:16] [INFO ] Implicit Places using invariants and state equation in 2888 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
[2023-03-19 10:03:16] [INFO ] Invariant cache hit.
[2023-03-19 10:03:18] [INFO ] Dead Transitions using invariants and state equation in 1633 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 5815 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 145 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 916 ms.
Product exploration explored 100000 steps with 33333 reset in 861 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 261 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 8045 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 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 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 2 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 0 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 468 ms. Remains 1001 /2687 variables (removed 1686) and now considering 840/2407 (removed 1567) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-19 10:03:20] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-19 10:03:21] [INFO ] Implicit Places using invariants in 643 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 647 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 0 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-19 10:03:21] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-19 10:03:22] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-19 10:03:22] [INFO ] Invariant cache hit.
[2023-03-19 10:03:23] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1823 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 2970 ms. Remains : 997/2687 places, 838/2407 transitions.
Stuttering acceptance computed with spot in 142 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 718 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-10 finished in 3860 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 316 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-19 10:03:24] [INFO ] Computed 441 place invariants in 11 ms
[2023-03-19 10:03:25] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2023-03-19 10:03:25] [INFO ] Invariant cache hit.
[2023-03-19 10:03:28] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 4029 ms to find 0 implicit places.
[2023-03-19 10:03:28] [INFO ] Invariant cache hit.
[2023-03-19 10:03:30] [INFO ] Dead Transitions using invariants and state equation in 1745 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 6091 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 208 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 6344 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 4 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 3 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 468 ms. Remains 1000 /2687 variables (removed 1687) and now considering 838/2407 (removed 1569) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2023-03-19 10:03:31] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-19 10:03:31] [INFO ] Implicit Places using invariants in 596 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 610 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 29 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2023-03-19 10:03:31] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-19 10:03:32] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-19 10:03:32] [INFO ] Invariant cache hit.
[2023-03-19 10:03:33] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1521 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 2629 ms. Remains : 996/2687 places, 836/2407 transitions.
Stuttering acceptance computed with spot in 53 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 689 ms.
Stack based approach found an accepted trace after 372 steps with 0 reset with depth 373 and stack size 373 in 3 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-12 finished in 3399 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 4 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 439 ms. Remains 998 /2687 variables (removed 1689) and now considering 837/2407 (removed 1570) transitions.
// Phase 1: matrix 837 rows 998 cols
[2023-03-19 10:03:34] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-19 10:03:35] [INFO ] Implicit Places using invariants in 1202 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1233 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 42 ms. Remains 994 /996 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 994 cols
[2023-03-19 10:03:35] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-19 10:03:36] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-19 10:03:36] [INFO ] Invariant cache hit.
[2023-03-19 10:03:37] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 2029 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 3743 ms. Remains : 994/2687 places, 835/2407 transitions.
Stuttering acceptance computed with spot in 30 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 712 ms.
Stack based approach found an accepted trace after 90 steps with 0 reset with depth 91 and stack size 91 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-13 finished in 4512 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 2 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 1 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 493 ms. Remains 1005 /2687 variables (removed 1682) and now considering 844/2407 (removed 1563) transitions.
// Phase 1: matrix 844 rows 1005 cols
[2023-03-19 10:03:39] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-19 10:03:39] [INFO ] Implicit Places using invariants in 611 ms returned [988, 992]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 613 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 30 ms. Remains 1001 /1003 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 1001 cols
[2023-03-19 10:03:39] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-19 10:03:40] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-19 10:03:40] [INFO ] Invariant cache hit.
[2023-03-19 10:03:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 10:03:41] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1718 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 2867 ms. Remains : 1001/2687 places, 842/2407 transitions.
Stuttering acceptance computed with spot in 2232 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 26704 reset in 943 ms.
Stack based approach found an accepted trace after 47 steps with 12 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-14 finished in 6067 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 1 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 2 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 508 ms. Remains 1002 /2687 variables (removed 1685) and now considering 839/2407 (removed 1568) transitions.
// Phase 1: matrix 839 rows 1002 cols
[2023-03-19 10:03:45] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-19 10:03:45] [INFO ] Implicit Places using invariants in 560 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 563 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 33 ms. Remains 998 /1000 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 998 cols
[2023-03-19 10:03:45] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-19 10:03:46] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-19 10:03:46] [INFO ] Invariant cache hit.
[2023-03-19 10:03:47] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1592 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 2697 ms. Remains : 998/2687 places, 837/2407 transitions.
Stuttering acceptance computed with spot in 60 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 676 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-15 finished in 3453 ms.
All properties solved by simple procedures.
Total runtime 289415 ms.

BK_STOP 1679220236525

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r389-oct2-167903713800668"
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 ;