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.r393-oct2-167903716900316.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 ltsminxred
Input is ShieldIIPt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 686K 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 ShieldIIPt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679439266403

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:54:29] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2023-03-21 22:54:29] [INFO ] Transformed 2803 places.
[2023-03-21 22:54:29] [INFO ] Transformed 2603 transitions.
[2023-03-21 22:54:29] [INFO ] Found NUPN structural information;
[2023-03-21 22:54:29] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 43 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 429 places :
Symmetric choice reduction at 0 with 429 rule applications. Total rules 429 place count 2374 transition count 2174
Iterating global reduction 0 with 429 rules applied. Total rules applied 858 place count 2374 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 2373 transition count 2173
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 2373 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 861 place count 2372 transition count 2172
Iterating global reduction 0 with 1 rules applied. Total rules applied 862 place count 2372 transition count 2172
Applied a total of 862 rules in 1062 ms. Remains 2372 /2803 variables (removed 431) and now considering 2172/2603 (removed 431) transitions.
// Phase 1: matrix 2172 rows 2372 cols
[2023-03-21 22:54:31] [INFO ] Computed 361 place invariants in 32 ms
[2023-03-21 22:54:34] [INFO ] Implicit Places using invariants in 3371 ms returned []
[2023-03-21 22:54:34] [INFO ] Invariant cache hit.
[2023-03-21 22:54:40] [INFO ] Implicit Places using invariants and state equation in 5891 ms returned []
Implicit Place search using SMT with State Equation took 9433 ms to find 0 implicit places.
[2023-03-21 22:54:40] [INFO ] Invariant cache hit.
[2023-03-21 22:54:50] [INFO ] Dead Transitions using invariants and state equation in 10016 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2372/2803 places, 2172/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20524 ms. Remains : 2372/2803 places, 2172/2603 transitions.
Support contains 43 out of 2372 places after structural reductions.
[2023-03-21 22:54:51] [INFO ] Flatten gal took : 234 ms
[2023-03-21 22:54:51] [INFO ] Flatten gal took : 75 ms
[2023-03-21 22:54:51] [INFO ] Input system was already deterministic with 2172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 36) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-21 22:54:52] [INFO ] Invariant cache hit.
[2023-03-21 22:54:54] [INFO ] After 1338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-21 22:54:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 123 ms returned sat
[2023-03-21 22:55:02] [INFO ] After 5526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-21 22:55:03] [INFO ] Deduced a trap composed of 21 places in 1404 ms of which 7 ms to minimize.
[2023-03-21 22:55:06] [INFO ] Deduced a trap composed of 17 places in 2057 ms of which 3 ms to minimize.
[2023-03-21 22:55:09] [INFO ] Deduced a trap composed of 27 places in 3373 ms of which 4 ms to minimize.
[2023-03-21 22:55:10] [INFO ] Deduced a trap composed of 20 places in 848 ms of which 23 ms to minimize.
[2023-03-21 22:55:11] [INFO ] Deduced a trap composed of 17 places in 582 ms of which 2 ms to minimize.
[2023-03-21 22:55:11] [INFO ] Deduced a trap composed of 20 places in 652 ms of which 1 ms to minimize.
[2023-03-21 22:55:12] [INFO ] Deduced a trap composed of 19 places in 674 ms of which 2 ms to minimize.
[2023-03-21 22:55:13] [INFO ] Deduced a trap composed of 20 places in 1016 ms of which 1 ms to minimize.
[2023-03-21 22:55:14] [INFO ] Deduced a trap composed of 18 places in 686 ms of which 2 ms to minimize.
[2023-03-21 22:55:15] [INFO ] Deduced a trap composed of 24 places in 715 ms of which 2 ms to minimize.
[2023-03-21 22:55:15] [INFO ] Deduced a trap composed of 19 places in 580 ms of which 2 ms to minimize.
[2023-03-21 22:55:16] [INFO ] Deduced a trap composed of 19 places in 581 ms of which 1 ms to minimize.
[2023-03-21 22:55:17] [INFO ] Deduced a trap composed of 27 places in 576 ms of which 1 ms to minimize.
[2023-03-21 22:55:18] [INFO ] Deduced a trap composed of 22 places in 659 ms of which 1 ms to minimize.
[2023-03-21 22:55:18] [INFO ] Deduced a trap composed of 28 places in 697 ms of which 2 ms to minimize.
[2023-03-21 22:55:19] [INFO ] Deduced a trap composed of 16 places in 586 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-21 22:55:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:55:19] [INFO ] After 25507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 2695 ms.
Support contains 27 out of 2372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2372 transition count 1707
Reduce places removed 465 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 468 rules applied. Total rules applied 933 place count 1907 transition count 1704
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 936 place count 1904 transition count 1704
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 936 place count 1904 transition count 1397
Deduced a syphon composed of 307 places in 2 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1550 place count 1597 transition count 1397
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1552 place count 1595 transition count 1395
Iterating global reduction 3 with 2 rules applied. Total rules applied 1554 place count 1595 transition count 1395
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1554 place count 1595 transition count 1393
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1558 place count 1593 transition count 1393
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 1 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 3 with 1366 rules applied. Total rules applied 2924 place count 910 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2925 place count 910 transition count 709
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 2927 place count 909 transition count 708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -61
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 3129 place count 808 transition count 769
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 3149 place count 798 transition count 776
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3150 place count 798 transition count 775
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3153 place count 798 transition count 772
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3156 place count 795 transition count 772
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3196 place count 795 transition count 772
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3197 place count 794 transition count 771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3199 place count 792 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3199 place count 792 transition count 770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3201 place count 791 transition count 770
Applied a total of 3201 rules in 606 ms. Remains 791 /2372 variables (removed 1581) and now considering 770/2172 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 ms. Remains : 791/2372 places, 770/2172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 770 rows 791 cols
[2023-03-21 22:55:23] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 22:55:24] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-21 22:55:24] [INFO ] [Nat]Absence check using 359 positive place invariants in 105 ms returned sat
[2023-03-21 22:55:26] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-21 22:55:26] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-21 22:55:27] [INFO ] After 1285ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-21 22:55:29] [INFO ] After 3138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 1075 ms.
[2023-03-21 22:55:30] [INFO ] After 6331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 2 properties in 396 ms.
Support contains 23 out of 791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 791/791 places, 770/770 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 791 transition count 768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 789 transition count 768
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 788 transition count 767
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 10 place count 786 transition count 768
Applied a total of 10 rules in 91 ms. Remains 786 /791 variables (removed 5) and now considering 768/770 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 786/791 places, 768/770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 83218 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83218 steps, saw 52880 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 768 rows 786 cols
[2023-03-21 22:55:34] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 22:55:34] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-21 22:55:35] [INFO ] [Nat]Absence check using 359 positive place invariants in 83 ms returned sat
[2023-03-21 22:55:36] [INFO ] After 964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-21 22:55:36] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-21 22:55:37] [INFO ] After 896ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-21 22:55:39] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 2 ms to minimize.
[2023-03-21 22:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-21 22:55:39] [INFO ] After 2475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 969 ms.
[2023-03-21 22:55:40] [INFO ] After 5450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 837 ms.
Support contains 23 out of 786 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 786/786 places, 768/768 transitions.
Applied a total of 0 rules in 19 ms. Remains 786 /786 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 786/786 places, 768/768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 786/786 places, 768/768 transitions.
Applied a total of 0 rules in 19 ms. Remains 786 /786 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2023-03-21 22:55:41] [INFO ] Invariant cache hit.
[2023-03-21 22:55:41] [INFO ] Implicit Places using invariants in 539 ms returned [775]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 544 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 785/786 places, 768/768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 784 transition count 767
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 784 transition count 767
Applied a total of 2 rules in 51 ms. Remains 784 /785 variables (removed 1) and now considering 767/768 (removed 1) transitions.
// Phase 1: matrix 767 rows 784 cols
[2023-03-21 22:55:41] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:55:42] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-21 22:55:42] [INFO ] Invariant cache hit.
[2023-03-21 22:55:43] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-21 22:55:44] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 784/786 places, 767/768 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3373 ms. Remains : 784/786 places, 767/768 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) 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 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 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 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 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-21 22:55:44] [INFO ] Invariant cache hit.
[2023-03-21 22:55:45] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-21 22:55:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 88 ms returned sat
[2023-03-21 22:55:46] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-21 22:55:46] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-21 22:55:47] [INFO ] After 648ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-21 22:55:48] [INFO ] After 1679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 696 ms.
[2023-03-21 22:55:49] [INFO ] After 4180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 321 ms.
Support contains 21 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 767/767 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 784 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 783 transition count 766
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 2 with 2 rules applied. Total rules applied 4 place count 782 transition count 765
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 781 transition count 766
Applied a total of 6 rules in 35 ms. Remains 781 /784 variables (removed 3) and now considering 766/767 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 781/784 places, 766/767 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 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
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 82156 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82156 steps, saw 52939 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 766 rows 781 cols
[2023-03-21 22:55:53] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-21 22:55:53] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-21 22:55:53] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-21 22:55:54] [INFO ] After 954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-21 22:55:54] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-21 22:55:55] [INFO ] After 681ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-21 22:55:55] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2023-03-21 22:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-21 22:55:56] [INFO ] After 1953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 538 ms.
[2023-03-21 22:55:57] [INFO ] After 4244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 884 ms.
Support contains 21 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 766/766 transitions.
Applied a total of 0 rules in 23 ms. Remains 781 /781 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 781/781 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 766/766 transitions.
Applied a total of 0 rules in 18 ms. Remains 781 /781 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2023-03-21 22:55:58] [INFO ] Invariant cache hit.
[2023-03-21 22:55:58] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-21 22:55:58] [INFO ] Invariant cache hit.
[2023-03-21 22:55:59] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-21 22:56:00] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2023-03-21 22:56:01] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-21 22:56:01] [INFO ] Invariant cache hit.
[2023-03-21 22:56:01] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3308 ms. Remains : 781/781 places, 766/766 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 781 transition count 766
Applied a total of 99 rules in 28 ms. Remains 781 /781 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 766 rows 781 cols
[2023-03-21 22:56:01] [INFO ] Computed 358 place invariants in 6 ms
[2023-03-21 22:56:02] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-21 22:56:02] [INFO ] [Nat]Absence check using 358 positive place invariants in 107 ms returned sat
[2023-03-21 22:56:03] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-21 22:56:03] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-21 22:56:04] [INFO ] After 924ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-21 22:56:05] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 9 ms to minimize.
[2023-03-21 22:56:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-21 22:56:06] [INFO ] After 2116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 676 ms.
[2023-03-21 22:56:06] [INFO ] After 4564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Computed a total of 639 stabilizing places and 639 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 247 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-21 22:56:07] [INFO ] Computed 361 place invariants in 49 ms
[2023-03-21 22:56:08] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-03-21 22:56:08] [INFO ] Invariant cache hit.
[2023-03-21 22:56:11] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 3733 ms to find 0 implicit places.
[2023-03-21 22:56:11] [INFO ] Invariant cache hit.
[2023-03-21 22:56:12] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5278 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 592 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s321 0), p0:(OR (EQ s994 0) (EQ s1019 0) (EQ s1028 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 998 ms.
Product exploration explored 100000 steps with 0 reset in 1018 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 84875 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84875 steps, saw 56293 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:56:19] [INFO ] Invariant cache hit.
[2023-03-21 22:56:19] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:56:20] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2023-03-21 22:56:22] [INFO ] After 1942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:56:23] [INFO ] Deduced a trap composed of 17 places in 910 ms of which 3 ms to minimize.
[2023-03-21 22:56:24] [INFO ] Deduced a trap composed of 23 places in 660 ms of which 1 ms to minimize.
[2023-03-21 22:56:24] [INFO ] Deduced a trap composed of 30 places in 559 ms of which 1 ms to minimize.
[2023-03-21 22:56:25] [INFO ] Deduced a trap composed of 30 places in 954 ms of which 14 ms to minimize.
[2023-03-21 22:56:26] [INFO ] Deduced a trap composed of 28 places in 859 ms of which 1 ms to minimize.
[2023-03-21 22:56:27] [INFO ] Deduced a trap composed of 33 places in 709 ms of which 1 ms to minimize.
[2023-03-21 22:56:28] [INFO ] Deduced a trap composed of 34 places in 536 ms of which 1 ms to minimize.
[2023-03-21 22:56:28] [INFO ] Deduced a trap composed of 34 places in 719 ms of which 1 ms to minimize.
[2023-03-21 22:56:29] [INFO ] Deduced a trap composed of 16 places in 512 ms of which 2 ms to minimize.
[2023-03-21 22:56:30] [INFO ] Deduced a trap composed of 32 places in 506 ms of which 13 ms to minimize.
[2023-03-21 22:56:30] [INFO ] Deduced a trap composed of 19 places in 482 ms of which 1 ms to minimize.
[2023-03-21 22:56:31] [INFO ] Deduced a trap composed of 32 places in 490 ms of which 1 ms to minimize.
[2023-03-21 22:56:31] [INFO ] Deduced a trap composed of 20 places in 545 ms of which 1 ms to minimize.
[2023-03-21 22:56:32] [INFO ] Deduced a trap composed of 35 places in 495 ms of which 1 ms to minimize.
[2023-03-21 22:56:33] [INFO ] Deduced a trap composed of 26 places in 1032 ms of which 10 ms to minimize.
[2023-03-21 22:56:34] [INFO ] Deduced a trap composed of 18 places in 827 ms of which 4 ms to minimize.
[2023-03-21 22:56:35] [INFO ] Deduced a trap composed of 25 places in 526 ms of which 4 ms to minimize.
[2023-03-21 22:56:35] [INFO ] Deduced a trap composed of 30 places in 500 ms of which 2 ms to minimize.
[2023-03-21 22:56:36] [INFO ] Deduced a trap composed of 22 places in 465 ms of which 14 ms to minimize.
[2023-03-21 22:56:36] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 1 ms to minimize.
[2023-03-21 22:56:37] [INFO ] Deduced a trap composed of 27 places in 472 ms of which 1 ms to minimize.
[2023-03-21 22:56:37] [INFO ] Deduced a trap composed of 19 places in 536 ms of which 1 ms to minimize.
[2023-03-21 22:56:38] [INFO ] Deduced a trap composed of 35 places in 539 ms of which 1 ms to minimize.
[2023-03-21 22:56:39] [INFO ] Deduced a trap composed of 23 places in 456 ms of which 1 ms to minimize.
[2023-03-21 22:56:39] [INFO ] Deduced a trap composed of 28 places in 587 ms of which 1 ms to minimize.
[2023-03-21 22:56:40] [INFO ] Deduced a trap composed of 27 places in 499 ms of which 1 ms to minimize.
[2023-03-21 22:56:41] [INFO ] Deduced a trap composed of 29 places in 571 ms of which 1 ms to minimize.
[2023-03-21 22:56:41] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 1 ms to minimize.
[2023-03-21 22:56:42] [INFO ] Deduced a trap composed of 36 places in 375 ms of which 1 ms to minimize.
[2023-03-21 22:56:42] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 0 ms to minimize.
[2023-03-21 22:56:43] [INFO ] Deduced a trap composed of 27 places in 527 ms of which 1 ms to minimize.
[2023-03-21 22:56:43] [INFO ] Deduced a trap composed of 23 places in 666 ms of which 17 ms to minimize.
[2023-03-21 22:56:44] [INFO ] Deduced a trap composed of 25 places in 450 ms of which 1 ms to minimize.
[2023-03-21 22:56:44] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 22231 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:56:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:56:44] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 242 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 956 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1594 place count 1564 transition count 1364
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 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
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 2957 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 757
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 757
Applied a total of 3239 rules in 258 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 111257 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111257 steps, saw 71040 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 757 rows 761 cols
[2023-03-21 22:56:48] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:56:48] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:56:49] [INFO ] [Nat]Absence check using 359 positive place invariants in 226 ms returned sat
[2023-03-21 22:56:49] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:56:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:56:50] [INFO ] After 204ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:56:50] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-21 22:56:50] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 16 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 14 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-21 22:56:50] [INFO ] Invariant cache hit.
[2023-03-21 22:56:51] [INFO ] Implicit Places using invariants in 689 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 704 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 30 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 22:56:51] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:56:51] [INFO ] Implicit Places using invariants in 551 ms returned []
[2023-03-21 22:56:51] [INFO ] Invariant cache hit.
[2023-03-21 22:56:53] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2451 ms. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 112741 steps, run timeout after 3011 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112741 steps, saw 72101 distinct states, run finished after 3011 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:56:56] [INFO ] Invariant cache hit.
[2023-03-21 22:56:56] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:56:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 207 ms returned sat
[2023-03-21 22:56:57] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:56:57] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-21 22:56:58] [INFO ] After 1248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-21 22:56:58] [INFO ] Invariant cache hit.
[2023-03-21 22:56:58] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-21 22:56:58] [INFO ] Invariant cache hit.
[2023-03-21 22:57:00] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2023-03-21 22:57:00] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-21 22:57:00] [INFO ] Invariant cache hit.
[2023-03-21 22:57:00] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2603 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 22:57:00] [INFO ] Computed 358 place invariants in 6 ms
[2023-03-21 22:57:01] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:57:01] [INFO ] [Nat]Absence check using 358 positive place invariants in 136 ms returned sat
[2023-03-21 22:57:02] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-21 22:57:02] [INFO ] After 254ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:02] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-21 22:57:03] [INFO ] After 1930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 112 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-21 22:57:03] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-21 22:57:04] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-21 22:57:04] [INFO ] Invariant cache hit.
[2023-03-21 22:57:07] [INFO ] Implicit Places using invariants and state equation in 2684 ms returned []
Implicit Place search using SMT with State Equation took 3696 ms to find 0 implicit places.
[2023-03-21 22:57:07] [INFO ] Invariant cache hit.
[2023-03-21 22:57:09] [INFO ] Dead Transitions using invariants and state equation in 1572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5402 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 89791 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89791 steps, saw 58891 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:57:13] [INFO ] Invariant cache hit.
[2023-03-21 22:57:13] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:57:14] [INFO ] [Nat]Absence check using 361 positive place invariants in 256 ms returned sat
[2023-03-21 22:57:15] [INFO ] After 1683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:16] [INFO ] Deduced a trap composed of 17 places in 649 ms of which 1 ms to minimize.
[2023-03-21 22:57:17] [INFO ] Deduced a trap composed of 23 places in 583 ms of which 2 ms to minimize.
[2023-03-21 22:57:18] [INFO ] Deduced a trap composed of 30 places in 882 ms of which 3 ms to minimize.
[2023-03-21 22:57:19] [INFO ] Deduced a trap composed of 30 places in 595 ms of which 5 ms to minimize.
[2023-03-21 22:57:19] [INFO ] Deduced a trap composed of 28 places in 457 ms of which 2 ms to minimize.
[2023-03-21 22:57:20] [INFO ] Deduced a trap composed of 33 places in 619 ms of which 3 ms to minimize.
[2023-03-21 22:57:20] [INFO ] Deduced a trap composed of 34 places in 477 ms of which 1 ms to minimize.
[2023-03-21 22:57:21] [INFO ] Deduced a trap composed of 34 places in 510 ms of which 2 ms to minimize.
[2023-03-21 22:57:22] [INFO ] Deduced a trap composed of 16 places in 693 ms of which 25 ms to minimize.
[2023-03-21 22:57:22] [INFO ] Deduced a trap composed of 32 places in 629 ms of which 3 ms to minimize.
[2023-03-21 22:57:23] [INFO ] Deduced a trap composed of 19 places in 503 ms of which 1 ms to minimize.
[2023-03-21 22:57:24] [INFO ] Deduced a trap composed of 32 places in 568 ms of which 3 ms to minimize.
[2023-03-21 22:57:24] [INFO ] Deduced a trap composed of 20 places in 497 ms of which 2 ms to minimize.
[2023-03-21 22:57:25] [INFO ] Deduced a trap composed of 35 places in 472 ms of which 1 ms to minimize.
[2023-03-21 22:57:25] [INFO ] Deduced a trap composed of 26 places in 555 ms of which 1 ms to minimize.
[2023-03-21 22:57:26] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 1 ms to minimize.
[2023-03-21 22:57:26] [INFO ] Deduced a trap composed of 25 places in 496 ms of which 1 ms to minimize.
[2023-03-21 22:57:27] [INFO ] Deduced a trap composed of 30 places in 538 ms of which 1 ms to minimize.
[2023-03-21 22:57:28] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 1 ms to minimize.
[2023-03-21 22:57:28] [INFO ] Deduced a trap composed of 22 places in 457 ms of which 1 ms to minimize.
[2023-03-21 22:57:29] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 1 ms to minimize.
[2023-03-21 22:57:29] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 1 ms to minimize.
[2023-03-21 22:57:32] [INFO ] Deduced a trap composed of 35 places in 2430 ms of which 1 ms to minimize.
[2023-03-21 22:57:33] [INFO ] Deduced a trap composed of 23 places in 1572 ms of which 1 ms to minimize.
[2023-03-21 22:57:37] [INFO ] Deduced a trap composed of 28 places in 2999 ms of which 2 ms to minimize.
[2023-03-21 22:57:37] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 1 ms to minimize.
[2023-03-21 22:57:38] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 1 ms to minimize.
[2023-03-21 22:57:38] [INFO ] Deduced a trap composed of 26 places in 535 ms of which 14 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:57:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:57:38] [INFO ] After 25176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 320 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 956 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1594 place count 1564 transition count 1364
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 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
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 2957 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 757
Applied a total of 3239 rules in 334 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76103 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76103 steps, saw 48609 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 757 rows 761 cols
[2023-03-21 22:57:43] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:57:43] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:57:43] [INFO ] [Nat]Absence check using 359 positive place invariants in 61 ms returned sat
[2023-03-21 22:57:44] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:57:44] [INFO ] After 128ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:44] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-21 22:57:44] [INFO ] After 1557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 69 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-21 22:57:44] [INFO ] Invariant cache hit.
[2023-03-21 22:57:45] [INFO ] Implicit Places using invariants in 506 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 22 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 22:57:45] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:57:45] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-21 22:57:45] [INFO ] Invariant cache hit.
[2023-03-21 22:57:46] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2029 ms. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 94310 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94310 steps, saw 60357 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 22:57:50] [INFO ] Invariant cache hit.
[2023-03-21 22:57:50] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:57:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2023-03-21 22:57:51] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:51] [INFO ] After 765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-21 22:57:52] [INFO ] After 1234ms 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 90 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 47 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-21 22:57:52] [INFO ] Invariant cache hit.
[2023-03-21 22:57:52] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-21 22:57:52] [INFO ] Invariant cache hit.
[2023-03-21 22:57:54] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
[2023-03-21 22:57:54] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:57:54] [INFO ] Invariant cache hit.
[2023-03-21 22:57:55] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2977 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 47 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 22:57:55] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:57:55] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 22:57:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 82 ms returned sat
[2023-03-21 22:57:56] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-21 22:57:56] [INFO ] After 285ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 22:57:57] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-21 22:57:57] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 732 ms.
Product exploration explored 100000 steps with 0 reset in 1016 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 478 place count 2361 transition count 2281
Deduced a syphon composed of 639 places in 4 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 639 place count 2361 transition count 2281
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 2 ms
Iterating global reduction 1 with 798 rules applied. Total rules applied 1437 place count 2361 transition count 2281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2361 transition count 2280
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1756 place count 2043 transition count 1962
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 2074 place count 2043 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2075 place count 2043 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2077 place count 2041 transition count 1960
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2079 place count 2041 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -521
Deduced a syphon composed of 1219 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2180 place count 2041 transition count 2481
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2281 place count 1940 transition count 2279
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2382 place count 1940 transition count 2279
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1175 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2439 place count 1940 transition count 2586
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2496 place count 1883 transition count 2472
Deduced a syphon composed of 1118 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2553 place count 1883 transition count 2472
Deduced a syphon composed of 1118 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2562 place count 1883 transition count 2463
Deduced a syphon composed of 1118 places in 3 ms
Applied a total of 2562 rules in 1802 ms. Remains 1883 /2361 variables (removed 478) and now considering 2463/2161 (removed -302) transitions.
[2023-03-21 22:58:02] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 2463 rows 1883 cols
[2023-03-21 22:58:02] [INFO ] Computed 361 place invariants in 44 ms
[2023-03-21 22:58:04] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1883/2361 places, 2463/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3606 ms. Remains : 1883/2361 places, 2463/2161 transitions.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 188 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-21 22:58:04] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-21 22:58:05] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-21 22:58:05] [INFO ] Invariant cache hit.
[2023-03-21 22:58:09] [INFO ] Implicit Places using invariants and state equation in 4016 ms returned []
Implicit Place search using SMT with State Equation took 5025 ms to find 0 implicit places.
[2023-03-21 22:58:09] [INFO ] Invariant cache hit.
[2023-03-21 22:58:10] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6714 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 123723 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&&G(p2))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 316 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-21 22:58:11] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-21 22:58:12] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-21 22:58:12] [INFO ] Invariant cache hit.
[2023-03-21 22:58:15] [INFO ] Implicit Places using invariants and state equation in 3396 ms returned []
Implicit Place search using SMT with State Equation took 4419 ms to find 0 implicit places.
[2023-03-21 22:58:15] [INFO ] Invariant cache hit.
[2023-03-21 22:58:19] [INFO ] Dead Transitions using invariants and state equation in 4117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8872 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s503 0), p2:(EQ s216 0), p1:(EQ s1478 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 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-01 finished in 9281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 480 rules applied. Total rules applied 959 place count 1892 transition count 1691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 960 place count 1891 transition count 1691
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 960 place count 1891 transition count 1378
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1586 place count 1578 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1592 place count 1572 transition count 1372
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1366
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1610 place count 1566 transition count 1366
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 3 with 1362 rules applied. Total rules applied 2972 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 885 transition count 684
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 2975 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 3177 place count 783 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
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 3213 place count 765 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3215 place count 763 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3217 place count 761 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3217 place count 761 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3219 place count 760 transition count 758
Applied a total of 3219 rules in 608 ms. Remains 760 /2372 variables (removed 1612) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-21 22:58:20] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:58:22] [INFO ] Implicit Places using invariants in 1334 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1338 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2372 places, 758/2172 transitions.
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 2 place count 758 transition count 757
Applied a total of 2 rules in 24 ms. Remains 758 /759 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 758 cols
[2023-03-21 22:58:22] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:58:22] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-21 22:58:22] [INFO ] Invariant cache hit.
[2023-03-21 22:58:23] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3529 ms. Remains : 758/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s150 1) (EQ s403 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-02 finished in 3610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 290 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 22:58:24] [INFO ] Computed 361 place invariants in 10 ms
[2023-03-21 22:58:25] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2023-03-21 22:58:25] [INFO ] Invariant cache hit.
[2023-03-21 22:58:28] [INFO ] Implicit Places using invariants and state equation in 3133 ms returned []
Implicit Place search using SMT with State Equation took 4223 ms to find 0 implicit places.
[2023-03-21 22:58:28] [INFO ] Invariant cache hit.
[2023-03-21 22:58:30] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6255 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2233 1), p1:(NEQ s726 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-03 finished in 6450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1892 transition count 1379
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1591 place count 1572 transition count 1372
Iterating global reduction 2 with 7 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1365
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1612 place count 1565 transition count 1365
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 0 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 2976 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2977 place count 883 transition count 682
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 2979 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3181 place count 781 transition count 748
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3215 place count 764 transition count 759
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3217 place count 762 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3219 place count 760 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3219 place count 760 transition count 756
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 3221 place count 759 transition count 756
Applied a total of 3221 rules in 428 ms. Remains 759 /2372 variables (removed 1613) and now considering 756/2172 (removed 1416) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 22:58:30] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 22:58:31] [INFO ] Implicit Places using invariants in 566 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2372 places, 756/2172 transitions.
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 2 place count 757 transition count 755
Applied a total of 2 rules in 26 ms. Remains 757 /758 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-21 22:58:31] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:58:31] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-21 22:58:31] [INFO ] Invariant cache hit.
[2023-03-21 22:58:33] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2372 places, 755/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2713 ms. Remains : 757/2372 places, 755/2172 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 651 ms.
Product exploration explored 100000 steps with 1 reset in 825 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264913 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264913 steps, saw 166893 distinct states, run finished after 3013 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:58:38] [INFO ] Invariant cache hit.
[2023-03-21 22:58:38] [INFO ] [Real]Absence check using 358 positive place invariants in 90 ms returned sat
[2023-03-21 22:58:39] [INFO ] After 722ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:58:39] [INFO ] After 771ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-21 22:58:39] [INFO ] After 1091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 755/755 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 757 transition count 754
Applied a total of 1 rules in 14 ms. Remains 757 /757 variables (removed 0) and now considering 754/755 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 757/757 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 262342 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262342 steps, saw 166784 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-21 22:58:42] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-21 22:58:42] [INFO ] [Real]Absence check using 358 positive place invariants in 75 ms returned sat
[2023-03-21 22:58:43] [INFO ] After 975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:58:43] [INFO ] [Nat]Absence check using 358 positive place invariants in 374 ms returned sat
[2023-03-21 22:58:44] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:58:44] [INFO ] After 641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-21 22:58:44] [INFO ] After 1321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 14 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 65 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-21 22:58:44] [INFO ] Invariant cache hit.
[2023-03-21 22:58:45] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-21 22:58:45] [INFO ] Invariant cache hit.
[2023-03-21 22:58:46] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-21 22:58:46] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:58:46] [INFO ] Invariant cache hit.
[2023-03-21 22:58:46] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2059 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 23 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-21 22:58:46] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:58:46] [INFO ] [Real]Absence check using 358 positive place invariants in 114 ms returned sat
[2023-03-21 22:58:47] [INFO ] After 469ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:58:47] [INFO ] After 558ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-21 22:58:47] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-21 22:58:47] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:58:48] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-21 22:58:48] [INFO ] Invariant cache hit.
[2023-03-21 22:58:49] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-21 22:58:49] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:58:49] [INFO ] Invariant cache hit.
[2023-03-21 22:58:50] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2377 ms. Remains : 757/757 places, 755/755 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 271678 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271678 steps, saw 171479 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:58:53] [INFO ] Invariant cache hit.
[2023-03-21 22:58:53] [INFO ] [Real]Absence check using 358 positive place invariants in 158 ms returned sat
[2023-03-21 22:58:54] [INFO ] After 537ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:58:54] [INFO ] After 606ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-21 22:58:54] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 755/755 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 757 transition count 754
Applied a total of 1 rules in 31 ms. Remains 757 /757 variables (removed 0) and now considering 754/755 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 757/757 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 277913 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277913 steps, saw 176214 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-21 22:58:57] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:58:58] [INFO ] [Real]Absence check using 358 positive place invariants in 236 ms returned sat
[2023-03-21 22:58:58] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:58:58] [INFO ] [Nat]Absence check using 358 positive place invariants in 89 ms returned sat
[2023-03-21 22:58:59] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:58:59] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-21 22:58:59] [INFO ] After 776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 14 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 14 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-21 22:58:59] [INFO ] Invariant cache hit.
[2023-03-21 22:59:00] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-21 22:59:00] [INFO ] Invariant cache hit.
[2023-03-21 22:59:00] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2023-03-21 22:59:00] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:59:00] [INFO ] Invariant cache hit.
[2023-03-21 22:59:01] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2057 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 23 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-21 22:59:01] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:59:01] [INFO ] [Real]Absence check using 358 positive place invariants in 123 ms returned sat
[2023-03-21 22:59:02] [INFO ] After 509ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:59:02] [INFO ] After 559ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-21 22:59:02] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 642 ms.
Product exploration explored 100000 steps with 0 reset in 817 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-21 22:59:04] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:59:04] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-21 22:59:04] [INFO ] Invariant cache hit.
[2023-03-21 22:59:05] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2023-03-21 22:59:05] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-21 22:59:05] [INFO ] Invariant cache hit.
[2023-03-21 22:59:06] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2388 ms. Remains : 757/757 places, 755/755 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-04 finished in 36446 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((G((X(p0) U p1))||(p0 U p2)))||F(G(p0)))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 319 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-21 22:59:07] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-21 22:59:08] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2023-03-21 22:59:08] [INFO ] Invariant cache hit.
[2023-03-21 22:59:13] [INFO ] Implicit Places using invariants and state equation in 4996 ms returned []
Implicit Place search using SMT with State Equation took 6108 ms to find 0 implicit places.
[2023-03-21 22:59:13] [INFO ] Invariant cache hit.
[2023-03-21 22:59:14] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8150 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s2158 1) (EQ s2207 1)), p0:(EQ s1844 1), p1:(EQ s784 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 49 reset in 767 ms.
Stack based approach found an accepted trace after 1800 steps with 0 reset with depth 1801 and stack size 1801 in 16 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-05 finished in 9140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 958 place count 1892 transition count 1378
Deduced a syphon composed of 314 places in 3 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1586 place count 1578 transition count 1378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1593 place count 1571 transition count 1371
Iterating global reduction 2 with 7 rules applied. Total rules applied 1600 place count 1571 transition count 1371
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1600 place count 1571 transition count 1364
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1614 place count 1564 transition count 1364
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 2974 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2975 place count 884 transition count 683
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 2977 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3179 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
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 3215 place count 764 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3217 place count 762 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3219 place count 760 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3219 place count 760 transition count 758
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 3221 place count 759 transition count 758
Applied a total of 3221 rules in 461 ms. Remains 759 /2372 variables (removed 1613) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-21 22:59:16] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:59:17] [INFO ] Implicit Places using invariants in 702 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 720 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2372 places, 758/2172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 757 transition count 757
Applied a total of 2 rules in 27 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2023-03-21 22:59:17] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:59:17] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-21 22:59:17] [INFO ] Invariant cache hit.
[2023-03-21 22:59:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 22:59:18] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3003 ms. Remains : 757/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-06 finished in 3065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&X(F(p1))))))))'
Support contains 1 out of 2372 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 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2371 transition count 1694
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1894 transition count 1694
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 954 place count 1894 transition count 1379
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1590 place count 1573 transition count 1373
Iterating global reduction 2 with 6 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1367
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1608 place count 1567 transition count 1367
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 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3175 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
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 3211 place count 766 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3213 place count 764 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3215 place count 762 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3215 place count 762 transition count 760
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3217 place count 761 transition count 760
Applied a total of 3217 rules in 389 ms. Remains 761 /2372 variables (removed 1611) and now considering 760/2172 (removed 1412) transitions.
// Phase 1: matrix 760 rows 761 cols
[2023-03-21 22:59:19] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-21 22:59:20] [INFO ] Implicit Places using invariants in 629 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 630 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2372 places, 760/2172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 759
Applied a total of 2 rules in 25 ms. Remains 759 /760 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 759 cols
[2023-03-21 22:59:20] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:59:20] [INFO ] Implicit Places using invariants in 756 ms returned []
[2023-03-21 22:59:20] [INFO ] Invariant cache hit.
[2023-03-21 22:59:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 22:59:23] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3421 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2372 places, 759/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4465 ms. Remains : 759/2372 places, 759/2172 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s398 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-07 finished in 4527 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)&&(p1||G(p2)))))'
Support contains 5 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 958 place count 1892 transition count 1380
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1582 place count 1580 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1589 place count 1573 transition count 1373
Iterating global reduction 2 with 7 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1610 place count 1566 transition count 1366
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 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3175 place count 784 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3209 place count 767 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3211 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3213 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3213 place count 763 transition count 759
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 3215 place count 762 transition count 759
Applied a total of 3215 rules in 547 ms. Remains 762 /2372 variables (removed 1610) and now considering 759/2172 (removed 1413) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-21 22:59:24] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:59:24] [INFO ] Implicit Places using invariants in 488 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 492 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2372 places, 759/2172 transitions.
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 2 place count 760 transition count 758
Applied a total of 2 rules in 51 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-21 22:59:24] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:59:25] [INFO ] Implicit Places using invariants in 723 ms returned []
[2023-03-21 22:59:25] [INFO ] Invariant cache hit.
[2023-03-21 22:59:26] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2372 places, 758/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2889 ms. Remains : 760/2372 places, 758/2172 transitions.
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s240 1) (EQ s247 1) (EQ s250 1)), p1:(EQ s646 1), p2:(EQ s563 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-08 finished in 3300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((X(G(p1))&&(G(p0)||G(p2)))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 353 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-21 22:59:27] [INFO ] Computed 361 place invariants in 27 ms
[2023-03-21 22:59:28] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2023-03-21 22:59:28] [INFO ] Invariant cache hit.
[2023-03-21 22:59:31] [INFO ] Implicit Places using invariants and state equation in 3439 ms returned []
Implicit Place search using SMT with State Equation took 4566 ms to find 0 implicit places.
[2023-03-21 22:59:31] [INFO ] Invariant cache hit.
[2023-03-21 22:59:33] [INFO ] Dead Transitions using invariants and state equation in 1631 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6563 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=3 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={1, 2} source=4 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=5 dest: 7}], [{ cond=(OR p0 p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0, 2} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=8 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=9 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=9 dest: 7}, { cond=(AND p2 p1), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s1296 1), p2:(EQ s1247 1), p1:(EQ s665 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-09 finished in 7067 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((p0||X((X(p1) U (p0&&X(p1)))))))))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 319 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 22:59:34] [INFO ] Computed 361 place invariants in 12 ms
[2023-03-21 22:59:35] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-21 22:59:35] [INFO ] Invariant cache hit.
[2023-03-21 22:59:37] [INFO ] Implicit Places using invariants and state equation in 2604 ms returned []
Implicit Place search using SMT with State Equation took 3671 ms to find 0 implicit places.
[2023-03-21 22:59:37] [INFO ] Invariant cache hit.
[2023-03-21 22:59:39] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5396 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1179 1), p1:(OR (EQ s1179 1) (NEQ s1532 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14272 reset in 763 ms.
Product exploration explored 100000 steps with 14296 reset in 644 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 125405 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125405 steps, saw 81458 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 22:59:44] [INFO ] Invariant cache hit.
[2023-03-21 22:59:45] [INFO ] [Real]Absence check using 361 positive place invariants in 123 ms returned sat
[2023-03-21 22:59:46] [INFO ] After 1900ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 22:59:47] [INFO ] [Nat]Absence check using 361 positive place invariants in 343 ms returned sat
[2023-03-21 22:59:49] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 22:59:50] [INFO ] Deduced a trap composed of 19 places in 730 ms of which 1 ms to minimize.
[2023-03-21 22:59:50] [INFO ] Deduced a trap composed of 25 places in 547 ms of which 2 ms to minimize.
[2023-03-21 22:59:51] [INFO ] Deduced a trap composed of 16 places in 611 ms of which 1 ms to minimize.
[2023-03-21 22:59:52] [INFO ] Deduced a trap composed of 27 places in 874 ms of which 3 ms to minimize.
[2023-03-21 22:59:53] [INFO ] Deduced a trap composed of 27 places in 618 ms of which 2 ms to minimize.
[2023-03-21 22:59:53] [INFO ] Deduced a trap composed of 20 places in 479 ms of which 1 ms to minimize.
[2023-03-21 22:59:54] [INFO ] Deduced a trap composed of 20 places in 504 ms of which 1 ms to minimize.
[2023-03-21 22:59:54] [INFO ] Deduced a trap composed of 21 places in 480 ms of which 1 ms to minimize.
[2023-03-21 22:59:55] [INFO ] Deduced a trap composed of 28 places in 577 ms of which 1 ms to minimize.
[2023-03-21 22:59:56] [INFO ] Deduced a trap composed of 29 places in 576 ms of which 1 ms to minimize.
[2023-03-21 22:59:56] [INFO ] Deduced a trap composed of 31 places in 471 ms of which 1 ms to minimize.
[2023-03-21 22:59:57] [INFO ] Deduced a trap composed of 23 places in 508 ms of which 2 ms to minimize.
[2023-03-21 22:59:57] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 1 ms to minimize.
[2023-03-21 22:59:58] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 1 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 30 places in 499 ms of which 1 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 22 places in 547 ms of which 1 ms to minimize.
[2023-03-21 23:00:00] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 1 ms to minimize.
[2023-03-21 23:00:00] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 1 ms to minimize.
[2023-03-21 23:00:01] [INFO ] Deduced a trap composed of 18 places in 413 ms of which 1 ms to minimize.
[2023-03-21 23:00:01] [INFO ] Deduced a trap composed of 32 places in 397 ms of which 1 ms to minimize.
[2023-03-21 23:00:02] [INFO ] Deduced a trap composed of 26 places in 647 ms of which 2 ms to minimize.
[2023-03-21 23:00:02] [INFO ] Deduced a trap composed of 29 places in 517 ms of which 1 ms to minimize.
[2023-03-21 23:00:03] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 1 ms to minimize.
[2023-03-21 23:00:03] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 2 ms to minimize.
[2023-03-21 23:00:04] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2023-03-21 23:00:04] [INFO ] Deduced a trap composed of 28 places in 357 ms of which 1 ms to minimize.
[2023-03-21 23:00:05] [INFO ] Deduced a trap composed of 36 places in 358 ms of which 1 ms to minimize.
[2023-03-21 23:00:05] [INFO ] Deduced a trap composed of 34 places in 376 ms of which 1 ms to minimize.
[2023-03-21 23:00:06] [INFO ] Deduced a trap composed of 44 places in 380 ms of which 2 ms to minimize.
[2023-03-21 23:00:06] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 0 ms to minimize.
[2023-03-21 23:00:07] [INFO ] Deduced a trap composed of 39 places in 656 ms of which 1 ms to minimize.
[2023-03-21 23:00:07] [INFO ] Deduced a trap composed of 37 places in 368 ms of which 1 ms to minimize.
[2023-03-21 23:00:08] [INFO ] Deduced a trap composed of 38 places in 719 ms of which 1 ms to minimize.
[2023-03-21 23:00:09] [INFO ] Deduced a trap composed of 39 places in 424 ms of which 1 ms to minimize.
[2023-03-21 23:00:09] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 0 ms to minimize.
[2023-03-21 23:00:10] [INFO ] Deduced a trap composed of 39 places in 336 ms of which 1 ms to minimize.
[2023-03-21 23:00:10] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 1 ms to minimize.
[2023-03-21 23:00:10] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 1 ms to minimize.
[2023-03-21 23:00:11] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 1 ms to minimize.
[2023-03-21 23:00:11] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 1 ms to minimize.
[2023-03-21 23:00:12] [INFO ] Deduced a trap composed of 36 places in 334 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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:00:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:00:12] [INFO ] After 25282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2362 transition count 1683
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2956 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 884 transition count 683
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 2959 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3161 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
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 3197 place count 764 transition count 761
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 764 transition count 760
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 764 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 763 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 763 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 762 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 760 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 760 transition count 757
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 759 transition count 757
Applied a total of 3245 rules in 295 ms. Remains 759 /2362 variables (removed 1603) and now considering 757/2162 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 759/2362 places, 757/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 759 cols
[2023-03-21 23:00:12] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 23:00:12] [INFO ] [Real]Absence check using 359 positive place invariants in 91 ms returned sat
[2023-03-21 23:00:13] [INFO ] After 468ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 23:00:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:00:13] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-21 23:00:13] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-21 23:00:13] [INFO ] After 919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 756
Applied a total of 2 rules in 36 ms. Remains 758 /759 variables (removed 1) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 758/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246016 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 246016 steps, saw 157024 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 758 cols
[2023-03-21 23:00:16] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-21 23:00:16] [INFO ] [Real]Absence check using 359 positive place invariants in 65 ms returned sat
[2023-03-21 23:00:17] [INFO ] After 375ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 23:00:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:00:17] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-21 23:00:17] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-21 23:00:17] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 756/756 transitions.
Applied a total of 0 rules in 27 ms. Remains 758 /758 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 758/758 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 756/756 transitions.
Applied a total of 0 rules in 19 ms. Remains 758 /758 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-21 23:00:17] [INFO ] Invariant cache hit.
[2023-03-21 23:00:18] [INFO ] Implicit Places using invariants in 564 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 757/758 places, 756/756 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 756 transition count 755
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 756 transition count 755
Applied a total of 2 rules in 21 ms. Remains 756 /757 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 756 cols
[2023-03-21 23:00:18] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 23:00:18] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-21 23:00:18] [INFO ] Invariant cache hit.
[2023-03-21 23:00:20] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 756/758 places, 755/756 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2720 ms. Remains : 756/758 places, 755/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266058 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266058 steps, saw 170082 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:00:23] [INFO ] Invariant cache hit.
[2023-03-21 23:00:23] [INFO ] [Real]Absence check using 358 positive place invariants in 42 ms returned sat
[2023-03-21 23:00:24] [INFO ] After 416ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 23:00:24] [INFO ] After 537ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-21 23:00:24] [INFO ] After 894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 756 /756 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 756/756 places, 755/755 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 755/755 transitions.
Applied a total of 0 rules in 13 ms. Remains 756 /756 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2023-03-21 23:00:24] [INFO ] Invariant cache hit.
[2023-03-21 23:00:24] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-21 23:00:24] [INFO ] Invariant cache hit.
[2023-03-21 23:00:26] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2023-03-21 23:00:26] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-21 23:00:26] [INFO ] Invariant cache hit.
[2023-03-21 23:00:26] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2158 ms. Remains : 756/756 places, 755/755 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 756 transition count 755
Applied a total of 80 rules in 48 ms. Remains 756 /756 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 756 cols
[2023-03-21 23:00:26] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 23:00:26] [INFO ] [Real]Absence check using 358 positive place invariants in 58 ms returned sat
[2023-03-21 23:00:27] [INFO ] After 544ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 23:00:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-21 23:00:27] [INFO ] After 98ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:00:27] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:00:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 81 ms returned sat
[2023-03-21 23:00:28] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:28] [INFO ] After 80ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:28] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-21 23:00:28] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 23:00:29] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-21 23:00:31] [INFO ] [Real]Absence check using 361 positive place invariants in 475 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-10 finished in 57339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2371 transition count 1694
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1894 transition count 1693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1893 transition count 1693
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 956 place count 1893 transition count 1379
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1591 place count 1572 transition count 1372
Iterating global reduction 3 with 7 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1365
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1612 place count 1565 transition count 1365
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3175 place count 784 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3209 place count 767 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 765 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3213 place count 763 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3213 place count 763 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3215 place count 762 transition count 758
Applied a total of 3215 rules in 533 ms. Remains 762 /2372 variables (removed 1610) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 762 cols
[2023-03-21 23:00:31] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 23:00:32] [INFO ] Implicit Places using invariants in 576 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2372 places, 758/2172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 757
Applied a total of 2 rules in 26 ms. Remains 760 /761 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 760 cols
[2023-03-21 23:00:32] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 23:00:33] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-21 23:00:33] [INFO ] Invariant cache hit.
[2023-03-21 23:00:34] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3269 ms. Remains : 760/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s734 1) (EQ s756 1))) (NEQ s746 1)), p0:(NEQ s746 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-11 finished in 3421 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) U p1)))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 296 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-21 23:00:34] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-21 23:00:35] [INFO ] Implicit Places using invariants in 985 ms returned []
[2023-03-21 23:00:35] [INFO ] Invariant cache hit.
[2023-03-21 23:00:38] [INFO ] Implicit Places using invariants and state equation in 2856 ms returned []
Implicit Place search using SMT with State Equation took 3879 ms to find 0 implicit places.
[2023-03-21 23:00:38] [INFO ] Invariant cache hit.
[2023-03-21 23:00:40] [INFO ] Dead Transitions using invariants and state equation in 2093 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6269 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s287 1), p0:(EQ s35 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-12 finished in 6494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0)&&F(!p1))||(p2 U (p2&&(p1||G(p2))))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 318 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
[2023-03-21 23:00:41] [INFO ] Invariant cache hit.
[2023-03-21 23:00:42] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-21 23:00:42] [INFO ] Invariant cache hit.
[2023-03-21 23:00:44] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3365 ms to find 0 implicit places.
[2023-03-21 23:00:44] [INFO ] Invariant cache hit.
[2023-03-21 23:00:46] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5521 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1142 1), p1:(NEQ s1538 1), p2:(NEQ s2061 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1971 ms.
Product exploration explored 100000 steps with 50000 reset in 1880 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 12 factoid took 545 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-13 finished in 10274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((F(p1)||G(p2)))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 325 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-21 23:00:51] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-21 23:00:52] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-21 23:00:52] [INFO ] Invariant cache hit.
[2023-03-21 23:00:55] [INFO ] Implicit Places using invariants and state equation in 2906 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
[2023-03-21 23:00:55] [INFO ] Invariant cache hit.
[2023-03-21 23:00:57] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6326 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1760 1), p1:(EQ s2073 1), p2:(EQ s1724 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 73 reset in 630 ms.
Stack based approach found an accepted trace after 1716 steps with 0 reset with depth 1717 and stack size 1717 in 13 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-14 finished in 7116 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))||F(p2))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 339 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 23:00:58] [INFO ] Computed 361 place invariants in 10 ms
[2023-03-21 23:01:00] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2023-03-21 23:01:00] [INFO ] Invariant cache hit.
[2023-03-21 23:01:03] [INFO ] Implicit Places using invariants and state equation in 3609 ms returned []
Implicit Place search using SMT with State Equation took 4910 ms to find 0 implicit places.
[2023-03-21 23:01:03] [INFO ] Invariant cache hit.
[2023-03-21 23:01:05] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7031 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s209 0), p0:(AND (EQ s31 1) (EQ s1139 1)), p1:(EQ s2303 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1955 ms.
Product exploration explored 100000 steps with 50000 reset in 1879 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/2362 stabilizing places and 638/2162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-15 finished in 11408 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((G(p1)||p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040B-LTLFireability-00
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2371 transition count 1693
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1893 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 958 place count 1892 transition count 1380
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1582 place count 1580 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1589 place count 1573 transition count 1373
Iterating global reduction 3 with 7 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1610 place count 1566 transition count 1366
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 3 with 1362 rules applied. Total rules applied 2972 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 885 transition count 684
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 2975 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3177 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
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 3211 place count 766 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3213 place count 764 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3215 place count 762 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3215 place count 762 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3217 place count 761 transition count 758
Applied a total of 3217 rules in 466 ms. Remains 761 /2372 variables (removed 1611) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 761 cols
[2023-03-21 23:01:10] [INFO ] Computed 359 place invariants in 16 ms
[2023-03-21 23:01:11] [INFO ] Implicit Places using invariants in 705 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 708 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 760/2372 places, 758/2172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 757
Applied a total of 2 rules in 69 ms. Remains 759 /760 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 759 cols
[2023-03-21 23:01:11] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 23:01:12] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-21 23:01:12] [INFO ] Invariant cache hit.
[2023-03-21 23:01:13] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 759/2372 places, 757/2172 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3004 ms. Remains : 759/2372 places, 757/2172 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s96 0), p0:(OR (EQ s318 0) (EQ s325 0) (EQ s328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 613 ms.
Product exploration explored 100000 steps with 0 reset in 799 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 138222 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138222 steps, saw 83978 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 23:01:18] [INFO ] Invariant cache hit.
[2023-03-21 23:01:19] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:01:19] [INFO ] [Nat]Absence check using 358 positive place invariants in 66 ms returned sat
[2023-03-21 23:01:19] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:01:20] [INFO ] After 776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-21 23:01:20] [INFO ] After 1335ms 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 100 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 756
Applied a total of 1 rules in 17 ms. Remains 759 /759 variables (removed 0) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 759/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 131882 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131882 steps, saw 83104 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 23:01:24] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 23:01:24] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:01:24] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2023-03-21 23:01:24] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:01:25] [INFO ] After 755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-21 23:01:25] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 20 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 14 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-21 23:01:25] [INFO ] Invariant cache hit.
[2023-03-21 23:01:26] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-21 23:01:26] [INFO ] Invariant cache hit.
[2023-03-21 23:01:27] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2023-03-21 23:01:27] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-21 23:01:27] [INFO ] Invariant cache hit.
[2023-03-21 23:01:27] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2080 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 32 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 23:01:27] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 23:01:27] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:01:28] [INFO ] [Nat]Absence check using 358 positive place invariants in 69 ms returned sat
[2023-03-21 23:01:28] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:01:29] [INFO ] After 821ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-21 23:01:29] [INFO ] After 1413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
// Phase 1: matrix 757 rows 759 cols
[2023-03-21 23:01:30] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 23:01:30] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-21 23:01:30] [INFO ] Invariant cache hit.
[2023-03-21 23:01:31] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2023-03-21 23:01:31] [INFO ] Invariant cache hit.
[2023-03-21 23:01:32] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2197 ms. Remains : 759/759 places, 757/757 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92351 steps, run timeout after 3002 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92351 steps, saw 56519 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 23:01:36] [INFO ] Invariant cache hit.
[2023-03-21 23:01:36] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:01:36] [INFO ] [Nat]Absence check using 358 positive place invariants in 64 ms returned sat
[2023-03-21 23:01:37] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:01:37] [INFO ] After 626ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-21 23:01:37] [INFO ] After 1282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 756
Applied a total of 1 rules in 32 ms. Remains 759 /759 variables (removed 0) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 759/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 118530 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118530 steps, saw 75167 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 23:01:41] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 23:01:41] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:01:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 96 ms returned sat
[2023-03-21 23:01:42] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:01:43] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-21 23:01:43] [INFO ] After 1461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 16 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 13 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-21 23:01:43] [INFO ] Invariant cache hit.
[2023-03-21 23:01:43] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-21 23:01:43] [INFO ] Invariant cache hit.
[2023-03-21 23:01:44] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2023-03-21 23:01:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 23:01:44] [INFO ] Invariant cache hit.
[2023-03-21 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2068 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 26 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-21 23:01:45] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 23:01:45] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:01:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2023-03-21 23:01:46] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:01:46] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-21 23:01:47] [INFO ] After 1329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 652 ms.
Product exploration explored 100000 steps with 0 reset in 880 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 34 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-21 23:01:50] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 757 rows 759 cols
[2023-03-21 23:01:50] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 23:01:50] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 697 ms. Remains : 759/759 places, 757/757 transitions.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 9 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-21 23:01:50] [INFO ] Invariant cache hit.
[2023-03-21 23:01:51] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-21 23:01:51] [INFO ] Invariant cache hit.
[2023-03-21 23:01:52] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2023-03-21 23:01:52] [INFO ] Invariant cache hit.
[2023-03-21 23:01:53] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2329 ms. Remains : 759/759 places, 757/757 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 43150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2023-03-21 23:01:53] [INFO ] Flatten gal took : 110 ms
[2023-03-21 23:01:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 23:01:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2372 places, 2172 transitions and 5624 arcs took 30 ms.
Total runtime 444018 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2405/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2405/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-040B-LTLFireability-00
Could not compute solution for formula : ShieldIIPt-PT-040B-LTLFireability-04

BK_STOP 1679439715893

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-040B-LTLFireability-00
ltl formula formula --ltl=/tmp/2405/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2372 places, 2172 transitions and 5624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.140 user 0.210 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2405/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldIIPt-PT-040B-LTLFireability-04
ltl formula formula --ltl=/tmp/2405/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2372 places, 2172 transitions and 5624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.110 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2405/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x556168ee93f4]
1: pnml2lts-mc(+0xa2496) [0x556168ee9496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f497d70e140]
3: pnml2lts-mc(+0x405be5) [0x55616924cbe5]
4: pnml2lts-mc(+0x16b3f9) [0x556168fb23f9]
5: pnml2lts-mc(+0x164ac4) [0x556168fabac4]
6: pnml2lts-mc(+0x272e0a) [0x5561690b9e0a]
7: pnml2lts-mc(+0xb61f0) [0x556168efd1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f497d5614d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f497d56167a]
10: pnml2lts-mc(+0xa1581) [0x556168ee8581]
11: pnml2lts-mc(+0xa1910) [0x556168ee8910]
12: pnml2lts-mc(+0xa32a2) [0x556168eea2a2]
13: pnml2lts-mc(+0xa50f4) [0x556168eec0f4]
14: pnml2lts-mc(+0xa516b) [0x556168eec16b]
15: pnml2lts-mc(+0x3f34b3) [0x55616923a4b3]
16: pnml2lts-mc(+0x7c63d) [0x556168ec363d]
17: pnml2lts-mc(+0x67d86) [0x556168eaed86]
18: pnml2lts-mc(+0x60a8a) [0x556168ea7a8a]
19: pnml2lts-mc(+0x5eb15) [0x556168ea5b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f497d549d0a]
21: pnml2lts-mc(+0x6075e) [0x556168ea775e]

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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-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 r393-oct2-167903716900316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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