MCC'2023- Execution of r329-tall-167889201800251

About the Execution of LTSMin+red for RERS2020-PT-pb105

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
9828.004	2291221.00	2791298.00	5271.90	F?TTTFTTTTTTF?FF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r329-tall-167889201800251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RERS2020-PT-pb105, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889201800251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 87M
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 86M 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 RERS2020-PT-pb105-LTLCardinality-00
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-01
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-02
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-03
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-04
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-05
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-06
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-07
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-08
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-09
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-10
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-11
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-12
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-13
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-14
FORMULA_NAME RERS2020-PT-pb105-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679093497321

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb105
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 22:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 22:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 22:51:41] [INFO ] Load time of PNML (sax parser for PT used): 2361 ms
[2023-03-17 22:51:41] [INFO ] Transformed 1982 places.
[2023-03-17 22:51:41] [INFO ] Transformed 153412 transitions.
[2023-03-17 22:51:41] [INFO ] Found NUPN structural information;
[2023-03-17 22:51:41] [INFO ] Parsed PT model containing 1982 places and 153412 transitions and 610156 arcs in 2977 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RERS2020-PT-pb105-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Ensure Unique test removed 10 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1971 transition count 149639
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 1968 transition count 149588
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 1968 transition count 149588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1967 transition count 149583
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 1967 transition count 149582
Applied a total of 23 rules in 1820 ms. Remains 1967 /1982 variables (removed 15) and now considering 149582/149639 (removed 57) transitions.
[2023-03-17 22:51:44] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 22:51:45] [INFO ] Computed 10 place invariants in 620 ms
[2023-03-17 22:51:54] [INFO ] Implicit Places using invariants in 9662 ms returned []
Implicit Place search using SMT only with invariants took 9693 ms to find 0 implicit places.
[2023-03-17 22:51:54] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 22:51:54] [INFO ] Invariant cache hit.
[2023-03-17 22:52:24] [INFO ] Performed 82306/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:52:48] [INFO ] Dead Transitions using invariants and state equation in 54493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1982 places, 149582/149639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66030 ms. Remains : 1967/1982 places, 149582/149639 transitions.
Support contains 26 out of 1967 places after structural reductions.
[2023-03-17 22:52:53] [INFO ] Flatten gal took : 3879 ms
[2023-03-17 22:52:57] [INFO ] Flatten gal took : 3735 ms
[2023-03-17 22:53:04] [INFO ] Input system was already deterministic with 149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1244 ms. (steps per millisecond=8 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-17 22:53:08] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 22:53:08] [INFO ] Invariant cache hit.
[2023-03-17 22:53:08] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-17 22:53:08] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-17 22:53:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-17 22:53:33] [INFO ] After 24253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 22:53:35] [INFO ] State equation strengthened by 5248 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 22:53:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:53:35] [INFO ] After 26303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1639 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 25 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 4316 transitions.
Graph (complete) has 126269 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.109 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145260
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145257
Deduced a syphon composed of 3 places in 66 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145257
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145248
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1881 transition count 145241
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 45 place count 1876 transition count 145231
Iterating global reduction 3 with 5 rules applied. Total rules applied 50 place count 1876 transition count 145231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 55 place count 1876 transition count 145226
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 1873 transition count 145220
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 1873 transition count 145220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 1873 transition count 145217
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 69 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 114 place count 1848 transition count 145192
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 120 place count 1848 transition count 145186
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 69 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 176 place count 1820 transition count 145282
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 199 place count 1820 transition count 145259
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 224 place count 1820 transition count 145228
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 7 with 612 rules applied. Total rules applied 836 place count 1795 transition count 144641
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 838 place count 1795 transition count 144639
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 893 place count 1793 transition count 144586
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 896 place count 1793 transition count 144583
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 901 place count 1790 transition count 144581
Free-agglomeration rule (complex) applied 114 times with reduction of 2773 identical transitions.
Iterating global reduction 10 with 114 rules applied. Total rules applied 1015 place count 1790 transition count 170094
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 133 transitions
Ensure Unique test removed 5887 transitions
Reduce isomorphic transitions removed 6020 transitions.
Iterating post reduction 10 with 6134 rules applied. Total rules applied 7149 place count 1676 transition count 164074
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 7150 place count 1675 transition count 164073
Applied a total of 7150 rules in 11576 ms. Remains 1675 /1967 variables (removed 292) and now considering 164073/149582 (removed -14491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11583 ms. Remains : 1675/1967 places, 164073/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2069 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 11137 steps, run timeout after 9005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 11137 steps, saw 9065 distinct states, run finished after 9006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-17 22:54:00] [INFO ] Flow matrix only has 121281 transitions (discarded 42792 similar events)
// Phase 1: matrix 121281 rows 1675 cols
[2023-03-17 22:54:00] [INFO ] Computed 10 place invariants in 538 ms
[2023-03-17 22:54:01] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 22:54:01] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-17 22:54:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-17 22:54:26] [INFO ] After 24325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 22:54:27] [INFO ] State equation strengthened by 6034 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 22:54:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:54:27] [INFO ] After 26891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 21 out of 1675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1675/1675 places, 164073/164073 transitions.
Applied a total of 0 rules in 1024 ms. Remains 1675 /1675 variables (removed 0) and now considering 164073/164073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1024 ms. Remains : 1675/1675 places, 164073/164073 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1675/1675 places, 164073/164073 transitions.
Applied a total of 0 rules in 854 ms. Remains 1675 /1675 variables (removed 0) and now considering 164073/164073 (removed 0) transitions.
[2023-03-17 22:54:29] [INFO ] Flow matrix only has 121281 transitions (discarded 42792 similar events)
[2023-03-17 22:54:29] [INFO ] Invariant cache hit.
[2023-03-17 22:54:38] [INFO ] Implicit Places using invariants in 8934 ms returned []
Implicit Place search using SMT only with invariants took 8935 ms to find 0 implicit places.
[2023-03-17 22:54:38] [INFO ] Flow matrix only has 121281 transitions (discarded 42792 similar events)
[2023-03-17 22:54:38] [INFO ] Invariant cache hit.
[2023-03-17 22:55:09] [INFO ] Performed 85940/164073 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:55:38] [INFO ] Dead Transitions using invariants and state equation in 60096 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69918 ms. Remains : 1675/1675 places, 164073/164073 transitions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.545 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 220 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 22:55:39] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 22:55:40] [INFO ] Computed 10 place invariants in 432 ms
[2023-03-17 22:55:48] [INFO ] Implicit Places using invariants in 9013 ms returned []
Implicit Place search using SMT only with invariants took 9018 ms to find 0 implicit places.
[2023-03-17 22:55:49] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 22:55:49] [INFO ] Invariant cache hit.
[2023-03-17 22:56:19] [INFO ] Performed 86065/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:56:40] [INFO ] Dead Transitions using invariants and state equation in 52036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61280 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1475 0) (EQ s929 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 16 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-00 finished in 61801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 6 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.121 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 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 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 59 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 58 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 61 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5116 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 22:56:46] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 22:56:47] [INFO ] Computed 10 place invariants in 455 ms
[2023-03-17 22:56:55] [INFO ] Implicit Places using invariants in 9182 ms returned []
Implicit Place search using SMT only with invariants took 9183 ms to find 0 implicit places.
[2023-03-17 22:56:55] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 22:56:55] [INFO ] Invariant cache hit.
[2023-03-17 22:57:26] [INFO ] Performed 91330/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 22:57:44] [INFO ] Dead Transitions using invariants and state equation in 48856 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63163 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s39 0) (EQ s1028 1)), p1:(OR (EQ s1641 0) (EQ s1215 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 184 ms.
Product exploration explored 100000 steps with 0 reset in 8019 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 991 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4501 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4501 steps, saw 3369 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 22:57:58] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 22:57:58] [INFO ] Invariant cache hit.
[2023-03-17 22:57:58] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 22:57:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-17 22:58:23] [INFO ] After 24767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 22:58:24] [INFO ] State equation strengthened by 5200 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 22:58:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:58:24] [INFO ] After 25795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 60 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 7772 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7776 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3999 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3999 steps, saw 3327 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 22:58:37] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-17 22:58:37] [INFO ] Computed 10 place invariants in 798 ms
[2023-03-17 22:58:38] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 22:58:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-17 22:59:03] [INFO ] After 24770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 22:59:04] [INFO ] State equation strengthened by 6068 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 22:59:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 22:59:04] [INFO ] After 25975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 764 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 764 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 698 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-17 22:59:05] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 22:59:05] [INFO ] Invariant cache hit.
[2023-03-17 22:59:14] [INFO ] Implicit Places using invariants in 8771 ms returned []
Implicit Place search using SMT only with invariants took 8772 ms to find 0 implicit places.
[2023-03-17 22:59:14] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 22:59:14] [INFO ] Invariant cache hit.
[2023-03-17 22:59:44] [INFO ] Performed 92648/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:00:07] [INFO ] Dead Transitions using invariants and state equation in 52972 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62457 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 642 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-17 23:00:08] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:00:09] [INFO ] Computed 10 place invariants in 428 ms
[2023-03-17 23:00:17] [INFO ] Implicit Places using invariants in 8934 ms returned []
Implicit Place search using SMT only with invariants took 8935 ms to find 0 implicit places.
[2023-03-17 23:00:17] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:00:17] [INFO ] Invariant cache hit.
[2023-03-17 23:00:47] [INFO ] Performed 87043/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:01:08] [INFO ] Dead Transitions using invariants and state equation in 50859 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60442 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 895 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4902 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4902 steps, saw 3648 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:01:13] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:01:13] [INFO ] Invariant cache hit.
[2023-03-17 23:01:14] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:01:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-17 23:01:39] [INFO ] After 24738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 23:01:39] [INFO ] State equation strengthened by 5200 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 23:01:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:01:39] [INFO ] After 25795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 58 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 7412 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7418 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1113 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4568 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4568 steps, saw 3789 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:01:51] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-17 23:01:52] [INFO ] Computed 10 place invariants in 527 ms
[2023-03-17 23:01:52] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:01:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-17 23:02:17] [INFO ] After 24775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 23:02:19] [INFO ] State equation strengthened by 6068 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 23:02:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:02:19] [INFO ] After 26718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 1100 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 843 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-17 23:02:21] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:02:21] [INFO ] Invariant cache hit.
[2023-03-17 23:02:30] [INFO ] Implicit Places using invariants in 9325 ms returned []
Implicit Place search using SMT only with invariants took 9326 ms to find 0 implicit places.
[2023-03-17 23:02:30] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-17 23:02:30] [INFO ] Invariant cache hit.
[2023-03-17 23:03:00] [INFO ] Performed 87350/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:03:26] [INFO ] Dead Transitions using invariants and state equation in 56270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66458 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 8805 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 644 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-17 23:03:37] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:03:37] [INFO ] Computed 10 place invariants in 413 ms
[2023-03-17 23:03:46] [INFO ] Implicit Places using invariants in 9123 ms returned []
Implicit Place search using SMT only with invariants took 9124 ms to find 0 implicit places.
[2023-03-17 23:03:46] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:03:46] [INFO ] Invariant cache hit.
[2023-03-17 23:04:16] [INFO ] Performed 86640/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:04:38] [INFO ] Dead Transitions using invariants and state equation in 51678 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61450 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Treatment of property RERS2020-PT-pb105-LTLCardinality-01 finished in 482320 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||(p1&&F(p2)))))'
Support contains 3 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 336 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:04:44] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:04:44] [INFO ] Computed 10 place invariants in 470 ms
[2023-03-17 23:04:53] [INFO ] Implicit Places using invariants in 9148 ms returned []
Implicit Place search using SMT only with invariants took 9150 ms to find 0 implicit places.
[2023-03-17 23:04:53] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:04:53] [INFO ] Invariant cache hit.
[2023-03-17 23:05:23] [INFO ] Performed 86751/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:05:45] [INFO ] Dead Transitions using invariants and state equation in 52511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62002 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (EQ s1715 0) (EQ s1663 1)), p0:(EQ s1625 0), p1:(EQ s1625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 43320 steps with 21660 reset in 10002 ms.
Product exploration timeout after 45110 steps with 22555 reset in 10002 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.388 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLCardinality-03 finished in 83290 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)||G(p1)))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 216 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:06:07] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:06:07] [INFO ] Invariant cache hit.
[2023-03-17 23:06:16] [INFO ] Implicit Places using invariants in 8984 ms returned []
Implicit Place search using SMT only with invariants took 8985 ms to find 0 implicit places.
[2023-03-17 23:06:16] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:06:16] [INFO ] Invariant cache hit.
[2023-03-17 23:06:46] [INFO ] Performed 87496/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:07:07] [INFO ] Dead Transitions using invariants and state equation in 51068 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60274 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s1457 0) (EQ s213 1)), p1:(AND (NEQ s347 0) (NEQ s1701 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-05 finished in 60706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1668 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.83 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 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 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 58 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 58 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 97 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5094 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-17 23:07:12] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-17 23:07:13] [INFO ] Computed 10 place invariants in 417 ms
[2023-03-17 23:07:21] [INFO ] Implicit Places using invariants in 8979 ms returned []
Implicit Place search using SMT only with invariants took 8980 ms to find 0 implicit places.
[2023-03-17 23:07:21] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-17 23:07:21] [INFO ] Invariant cache hit.
[2023-03-17 23:07:52] [INFO ] Performed 90424/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:08:11] [INFO ] Dead Transitions using invariants and state equation in 49456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63534 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1667 0) (EQ s1457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 11 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-12 finished in 63798 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 U (G(p1)&&X(G((X((p0 U p3))||p2)))))))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 240 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:08:11] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:08:12] [INFO ] Computed 10 place invariants in 372 ms
[2023-03-17 23:08:21] [INFO ] Implicit Places using invariants in 9257 ms returned []
Implicit Place search using SMT only with invariants took 9258 ms to find 0 implicit places.
[2023-03-17 23:08:21] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:08:21] [INFO ] Invariant cache hit.
[2023-03-17 23:08:51] [INFO ] Performed 86481/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:09:13] [INFO ] Dead Transitions using invariants and state equation in 52807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62310 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 533 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 10}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={1} source=8 dest: 10}, { cond=(AND p1 p0 (NOT p3)), acceptance={0, 1} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=10 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={1} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1} source=11 dest: 10}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=11 dest: 11}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 11}]], initial=0, aps=[p1:(OR (EQ s1776 0) (EQ s797 1)), p0:(OR (EQ s1535 0) (EQ s1009 1)), p2:(OR (EQ s1731 0) (EQ s338 1) (EQ s457 0) (EQ s296 1)), p3:(AND (OR (EQ s1535 0) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7891 ms.
Product exploration explored 100000 steps with 1 reset in 8168 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.282 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1041 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1222 ms. (steps per millisecond=8 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:09:34] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:09:34] [INFO ] Invariant cache hit.
[2023-03-17 23:09:35] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:09:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-17 23:10:00] [INFO ] After 23769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:10:01] [INFO ] State equation strengthened by 5248 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 23:10:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:10:01] [INFO ] After 25799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 5 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 4316 transitions.
Graph (complete) has 126269 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.56 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145260
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145257
Deduced a syphon composed of 3 places in 66 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145257
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145248
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1881 transition count 145241
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1875 transition count 145229
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1875 transition count 145229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1875 transition count 145223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1872 transition count 145217
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1872 transition count 145217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1872 transition count 145214
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 129 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 117 place count 1847 transition count 145189
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 123 place count 1847 transition count 145183
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 69 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 179 place count 1819 transition count 145279
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 202 place count 1819 transition count 145256
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 227 place count 1819 transition count 145225
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 7 with 612 rules applied. Total rules applied 839 place count 1794 transition count 144638
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 842 place count 1794 transition count 144635
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 898 place count 1791 transition count 144582
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 901 place count 1791 transition count 144579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 907 place count 1788 transition count 144576
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 1788 transition count 144575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 909 place count 1787 transition count 144575
Free-agglomeration rule (complex) applied 117 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 117 rules applied. Total rules applied 1026 place count 1787 transition count 173023
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 139 transitions
Ensure Unique test removed 7637 transitions
Reduce isomorphic transitions removed 7776 transitions.
Iterating post reduction 11 with 7893 rules applied. Total rules applied 8919 place count 1670 transition count 165247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 8920 place count 1669 transition count 165246
Applied a total of 8920 rules in 11360 ms. Remains 1669 /1967 variables (removed 298) and now considering 165246/149582 (removed -15664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11365 ms. Remains : 1669/1967 places, 165246/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1349 ms. (steps per millisecond=7 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) seen :0
Interrupted probabilistic random walk after 4675 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4675 steps, saw 3879 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:10:17] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
// Phase 1: matrix 122302 rows 1669 cols
[2023-03-17 23:10:18] [INFO ] Computed 10 place invariants in 494 ms
[2023-03-17 23:10:18] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:10:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-17 23:10:43] [INFO ] After 23923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:10:45] [INFO ] State equation strengthened by 6071 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 23:10:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:10:45] [INFO ] After 27195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 739 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 740 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 836 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
[2023-03-17 23:10:47] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:10:47] [INFO ] Invariant cache hit.
[2023-03-17 23:10:56] [INFO ] Implicit Places using invariants in 8963 ms returned []
Implicit Place search using SMT only with invariants took 8964 ms to find 0 implicit places.
[2023-03-17 23:10:56] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:10:56] [INFO ] Invariant cache hit.
[2023-03-17 23:11:26] [INFO ] Performed 89705/165246 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:11:51] [INFO ] Dead Transitions using invariants and state equation in 54899 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64713 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 1097 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 233 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:11:53] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:11:54] [INFO ] Computed 10 place invariants in 422 ms
[2023-03-17 23:12:02] [INFO ] Implicit Places using invariants in 9088 ms returned []
Implicit Place search using SMT only with invariants took 9089 ms to find 0 implicit places.
[2023-03-17 23:12:03] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:12:03] [INFO ] Invariant cache hit.
[2023-03-17 23:12:33] [INFO ] Performed 89111/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:12:53] [INFO ] Dead Transitions using invariants and state equation in 50341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59669 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.271 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1057 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:12:57] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:12:57] [INFO ] Invariant cache hit.
[2023-03-17 23:12:58] [INFO ] After 764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:12:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-17 23:13:23] [INFO ] After 23731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:13:24] [INFO ] State equation strengthened by 5248 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 23:13:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:13:24] [INFO ] After 26752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 6 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 484 transitions
Reduce isomorphic transitions removed 4316 transitions.
Graph (complete) has 126269 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.56 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145260
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145257
Deduced a syphon composed of 3 places in 66 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145257
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145248
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 40 place count 1881 transition count 145241
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 1875 transition count 145229
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 1875 transition count 145229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 58 place count 1875 transition count 145223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 1872 transition count 145217
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 1872 transition count 145217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 1872 transition count 145214
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 66 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 117 place count 1847 transition count 145189
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 123 place count 1847 transition count 145183
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 65 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 179 place count 1819 transition count 145279
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 202 place count 1819 transition count 145256
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 25 rules applied. Total rules applied 227 place count 1819 transition count 145225
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 7 with 612 rules applied. Total rules applied 839 place count 1794 transition count 144638
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 842 place count 1794 transition count 144635
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 898 place count 1791 transition count 144582
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 901 place count 1791 transition count 144579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 907 place count 1788 transition count 144576
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 908 place count 1788 transition count 144575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 909 place count 1787 transition count 144575
Free-agglomeration rule (complex) applied 117 times with reduction of 3658 identical transitions.
Iterating global reduction 11 with 117 rules applied. Total rules applied 1026 place count 1787 transition count 173023
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 139 transitions
Ensure Unique test removed 7637 transitions
Reduce isomorphic transitions removed 7776 transitions.
Iterating post reduction 11 with 7893 rules applied. Total rules applied 8919 place count 1670 transition count 165247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 8920 place count 1669 transition count 165246
Applied a total of 8920 rules in 13037 ms. Remains 1669 /1967 variables (removed 298) and now considering 165246/149582 (removed -15664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13041 ms. Remains : 1669/1967 places, 165246/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1735 ms. (steps per millisecond=5 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 7509 steps, run timeout after 6003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 7509 steps, saw 6177 distinct states, run finished after 6003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:13:46] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
// Phase 1: matrix 122302 rows 1669 cols
[2023-03-17 23:13:46] [INFO ] Computed 10 place invariants in 499 ms
[2023-03-17 23:13:47] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:13:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-17 23:14:12] [INFO ] After 23942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:14:14] [INFO ] State equation strengthened by 6071 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-17 23:14:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:14:14] [INFO ] After 26889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 864 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 864 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 953 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
[2023-03-17 23:14:16] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:14:16] [INFO ] Invariant cache hit.
[2023-03-17 23:14:25] [INFO ] Implicit Places using invariants in 9394 ms returned []
Implicit Place search using SMT only with invariants took 9395 ms to find 0 implicit places.
[2023-03-17 23:14:25] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:14:25] [INFO ] Invariant cache hit.
[2023-03-17 23:14:55] [INFO ] Performed 91128/165246 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:15:19] [INFO ] Dead Transitions using invariants and state equation in 53329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63701 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 1070 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 8118 ms.
Product exploration explored 100000 steps with 2 reset in 8327 ms.
Applying partial POR strategy [false, false, true, true, false, false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 5 ms
Free SCC test removed 70 places
Ensure Unique test removed 566 transitions
Reduce isomorphic transitions removed 566 transitions.
Graph (complete) has 143632 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.99 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1896 transition count 149015
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 1890 transition count 149001
Deduced a syphon composed of 2 places in 66 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 1890 transition count 149001
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 1890 transition count 148995
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 1884 transition count 148983
Deduced a syphon composed of 2 places in 66 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 1884 transition count 148983
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 1884 transition count 148977
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 1881 transition count 148971
Deduced a syphon composed of 2 places in 65 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 1881 transition count 148971
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 1881 transition count 148968
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 22 places in 64 ms
Iterating global reduction 4 with 20 rules applied. Total rules applied 69 place count 1881 transition count 148977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 1881 transition count 148976
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 50 places in 65 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 98 place count 1881 transition count 149136
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 117 place count 1881 transition count 149117
Deduced a syphon composed of 50 places in 80 ms
Applied a total of 117 rules in 4223 ms. Remains 1881 /1967 variables (removed 86) and now considering 149117/149582 (removed 465) transitions.
[2023-03-17 23:15:43] [INFO ] Flow matrix only has 104819 transitions (discarded 44298 similar events)
// Phase 1: matrix 104819 rows 1881 cols
[2023-03-17 23:15:43] [INFO ] Computed 10 place invariants in 426 ms
[2023-03-17 23:16:13] [INFO ] Performed 87989/149117 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:16:34] [INFO ] Dead Transitions using invariants and state equation in 51289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1881/1967 places, 149117/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55517 ms. Remains : 1881/1967 places, 149117/149582 transitions.
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 378 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:16:34] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-17 23:16:35] [INFO ] Computed 10 place invariants in 415 ms
[2023-03-17 23:16:44] [INFO ] Implicit Places using invariants in 9281 ms returned []
Implicit Place search using SMT only with invariants took 9288 ms to find 0 implicit places.
[2023-03-17 23:16:44] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:16:44] [INFO ] Invariant cache hit.
[2023-03-17 23:17:14] [INFO ] Performed 83625/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:17:39] [INFO ] Dead Transitions using invariants and state equation in 55019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64690 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Treatment of property RERS2020-PT-pb105-LTLCardinality-13 finished in 572948 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(X((G(p1)&&p0)))))'
Support contains 3 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 265 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-17 23:17:44] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:17:44] [INFO ] Invariant cache hit.
[2023-03-17 23:17:53] [INFO ] Implicit Places using invariants in 9095 ms returned []
Implicit Place search using SMT only with invariants took 9098 ms to find 0 implicit places.
[2023-03-17 23:17:53] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-17 23:17:53] [INFO ] Invariant cache hit.
[2023-03-17 23:18:24] [INFO ] Performed 81139/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:18:49] [INFO ] Dead Transitions using invariants and state equation in 55486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64854 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(EQ s212 0), p0:(AND (EQ s1426 0) (EQ s148 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 4 ms.
FORMULA RERS2020-PT-pb105-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLCardinality-14 finished in 65306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
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 U (G(p1)&&X(G((X((p0 U p3))||p2)))))))'
Found a Lengthening insensitive property : RERS2020-PT-pb105-LTLCardinality-13
Stuttering acceptance computed with spot in 539 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1658 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 5 ms
Free SCC test removed 70 places
Ensure Unique test removed 566 transitions
Reduce isomorphic transitions removed 566 transitions.
Graph (complete) has 143632 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.93 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 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 4 place count 1895 transition count 149012
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149012
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149009
Deduced a syphon composed of 3 places in 72 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149009
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1884 transition count 148995
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1884 transition count 148995
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1884 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1878 transition count 148977
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1878 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1878 transition count 148971
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1875 transition count 148965
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1875 transition count 148965
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1875 transition count 148962
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 61 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1858 transition count 148945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1858 transition count 148944
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 72 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1830 transition count 149040
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1830 transition count 149021
Applied a total of 167 rules in 5892 ms. Remains 1830 /1967 variables (removed 137) and now considering 149021/149582 (removed 561) transitions.
[2023-03-17 23:18:56] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
// Phase 1: matrix 104723 rows 1830 cols
[2023-03-17 23:18:56] [INFO ] Computed 10 place invariants in 364 ms
[2023-03-17 23:19:05] [INFO ] Implicit Places using invariants in 9108 ms returned []
Implicit Place search using SMT only with invariants took 9117 ms to find 0 implicit places.
[2023-03-17 23:19:05] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
[2023-03-17 23:19:05] [INFO ] Invariant cache hit.
[2023-03-17 23:19:35] [INFO ] Performed 81829/149021 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:19:59] [INFO ] Dead Transitions using invariants and state equation in 54134 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1830/1967 places, 149021/149582 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 69151 ms. Remains : 1830/1967 places, 149021/149582 transitions.
Running random walk in product with property : RERS2020-PT-pb105-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 10}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={1} source=8 dest: 10}, { cond=(AND p1 p0 (NOT p3)), acceptance={0, 1} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=10 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={1} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={1} source=11 dest: 10}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=11 dest: 11}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 11}]], initial=0, aps=[p1:(OR (EQ s1652 0) (EQ s731 1)), p0:(OR (EQ s1422 0) (EQ s934 1)), p2:(OR (EQ s1608 0) (EQ s306 1) (EQ s414 0) (EQ s268 1)), p3:(AND (OR (EQ s1422 0) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 2264 ms.
Product exploration explored 100000 steps with 0 reset in 9408 ms.
Computed a total of 220 stabilizing places and 33785 stable transitions
Computed a total of 220 stabilizing places and 33785 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 971 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1208 ms. (steps per millisecond=8 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:20:15] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
[2023-03-17 23:20:15] [INFO ] Invariant cache hit.
[2023-03-17 23:20:16] [INFO ] After 738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:20:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-17 23:20:41] [INFO ] After 23796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:20:42] [INFO ] State equation strengthened by 5203 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-17 23:20:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:20:42] [INFO ] After 26201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1830/1830 places, 149021/149021 transitions.
Drop transitions removed 3750 transitions
Reduce isomorphic transitions removed 3750 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3753 rules applied. Total rules applied 3753 place count 1830 transition count 145268
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3756 place count 1827 transition count 145268
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 65 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 3774 place count 1818 transition count 145259
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 3778 place count 1818 transition count 145255
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3803 place count 1818 transition count 145224
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 3 with 612 rules applied. Total rules applied 4415 place count 1793 transition count 144637
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4418 place count 1793 transition count 144634
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4474 place count 1790 transition count 144581
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4477 place count 1790 transition count 144578
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4483 place count 1787 transition count 144575
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4484 place count 1787 transition count 144574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4485 place count 1786 transition count 144574
Free-agglomeration rule (complex) applied 117 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 117 rules applied. Total rules applied 4602 place count 1786 transition count 173022
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 139 transitions
Ensure Unique test removed 7637 transitions
Reduce isomorphic transitions removed 7776 transitions.
Iterating post reduction 7 with 7893 rules applied. Total rules applied 12495 place count 1669 transition count 165246
Applied a total of 12495 rules in 11359 ms. Remains 1669 /1830 variables (removed 161) and now considering 165246/149021 (removed -16225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11365 ms. Remains : 1669/1830 places, 165246/149021 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2019 ms. (steps per millisecond=4 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 6092 steps, run timeout after 6001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 6092 steps, saw 5024 distinct states, run finished after 6001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:21:02] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
// Phase 1: matrix 122302 rows 1669 cols
[2023-03-17 23:21:03] [INFO ] Computed 10 place invariants in 576 ms
[2023-03-17 23:21:04] [INFO ] After 684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:21:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-17 23:21:29] [INFO ] After 23923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:21:31] [INFO ] State equation strengthened by 6071 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-17 23:21:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:21:31] [INFO ] After 27321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 1002 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1002 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 833 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
[2023-03-17 23:21:33] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:21:33] [INFO ] Invariant cache hit.
[2023-03-17 23:21:42] [INFO ] Implicit Places using invariants in 9202 ms returned []
Implicit Place search using SMT only with invariants took 9205 ms to find 0 implicit places.
[2023-03-17 23:21:42] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:21:42] [INFO ] Invariant cache hit.
[2023-03-17 23:22:12] [INFO ] Performed 90846/165246 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:22:36] [INFO ] Dead Transitions using invariants and state equation in 53643 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63698 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 1184 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 633 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1830/1830 places, 149021/149021 transitions.
Applied a total of 0 rules in 220 ms. Remains 1830 /1830 variables (removed 0) and now considering 149021/149021 (removed 0) transitions.
[2023-03-17 23:22:38] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
// Phase 1: matrix 104723 rows 1830 cols
[2023-03-17 23:22:39] [INFO ] Computed 10 place invariants in 441 ms
[2023-03-17 23:22:48] [INFO ] Implicit Places using invariants in 9356 ms returned []
Implicit Place search using SMT only with invariants took 9357 ms to find 0 implicit places.
[2023-03-17 23:22:48] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
[2023-03-17 23:22:48] [INFO ] Invariant cache hit.
[2023-03-17 23:23:18] [INFO ] Performed 89707/149021 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:23:38] [INFO ] Dead Transitions using invariants and state equation in 50076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59659 ms. Remains : 1830/1830 places, 149021/149021 transitions.
Computed a total of 220 stabilizing places and 33785 stable transitions
Computed a total of 220 stabilizing places and 33785 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 996 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=6 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:23:42] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
[2023-03-17 23:23:42] [INFO ] Invariant cache hit.
[2023-03-17 23:23:43] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:23:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-17 23:24:08] [INFO ] After 23778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-17 23:24:09] [INFO ] State equation strengthened by 5203 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-17 23:24:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:24:09] [INFO ] After 26406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1830/1830 places, 149021/149021 transitions.
Drop transitions removed 3750 transitions
Reduce isomorphic transitions removed 3750 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3753 rules applied. Total rules applied 3753 place count 1830 transition count 145268
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3756 place count 1827 transition count 145268
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 58 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 3774 place count 1818 transition count 145259
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 3778 place count 1818 transition count 145255
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3803 place count 1818 transition count 145224
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 587 transitions.
Iterating post reduction 3 with 612 rules applied. Total rules applied 4415 place count 1793 transition count 144637
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4418 place count 1793 transition count 144634
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4474 place count 1790 transition count 144581
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4477 place count 1790 transition count 144578
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4483 place count 1787 transition count 144575
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4484 place count 1787 transition count 144574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4485 place count 1786 transition count 144574
Free-agglomeration rule (complex) applied 117 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 117 rules applied. Total rules applied 4602 place count 1786 transition count 173022
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 139 transitions
Ensure Unique test removed 7637 transitions
Reduce isomorphic transitions removed 7776 transitions.
Iterating post reduction 7 with 7893 rules applied. Total rules applied 12495 place count 1669 transition count 165246
Applied a total of 12495 rules in 9267 ms. Remains 1669 /1830 variables (removed 161) and now considering 165246/149021 (removed -16225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9276 ms. Remains : 1669/1830 places, 165246/149021 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1855 ms. (steps per millisecond=5 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 9731 steps, run timeout after 6005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 9731 steps, saw 7956 distinct states, run finished after 6007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 20 properties.
[2023-03-17 23:24:27] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
// Phase 1: matrix 122302 rows 1669 cols
[2023-03-17 23:24:28] [INFO ] Computed 10 place invariants in 476 ms
[2023-03-17 23:24:29] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 23:24:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-17 23:24:54] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 733 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 165246/165246 transitions.
Applied a total of 0 rules in 707 ms. Remains 1669 /1669 variables (removed 0) and now considering 165246/165246 (removed 0) transitions.
[2023-03-17 23:24:55] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:24:55] [INFO ] Invariant cache hit.
[2023-03-17 23:25:04] [INFO ] Implicit Places using invariants in 8783 ms returned []
Implicit Place search using SMT only with invariants took 8785 ms to find 0 implicit places.
[2023-03-17 23:25:04] [INFO ] Flow matrix only has 122302 transitions (discarded 42944 similar events)
[2023-03-17 23:25:04] [INFO ] Invariant cache hit.
[2023-03-17 23:25:34] [INFO ] Performed 89119/165246 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:25:59] [INFO ] Dead Transitions using invariants and state equation in 55405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64914 ms. Remains : 1669/1669 places, 165246/165246 transitions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p3))), (F (AND p0 p1 (NOT p3))), (F (AND p0 p2 (NOT p3)))]
Knowledge based reduction with 17 factoid took 1210 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 608 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 9679 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Applying partial POR strategy [false, false, true, true, false, false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 477 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 1830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1830/1830 places, 149021/149021 transitions.
Applied a total of 0 rules in 628 ms. Remains 1830 /1830 variables (removed 0) and now considering 149021/149021 (removed 0) transitions.
[2023-03-17 23:26:13] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
// Phase 1: matrix 104723 rows 1830 cols
[2023-03-17 23:26:14] [INFO ] Computed 10 place invariants in 401 ms
[2023-03-17 23:26:44] [INFO ] Performed 90958/149021 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:27:03] [INFO ] Dead Transitions using invariants and state equation in 50268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50898 ms. Remains : 1830/1830 places, 149021/149021 transitions.
Support contains 8 out of 1830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1830/1830 places, 149021/149021 transitions.
Applied a total of 0 rules in 312 ms. Remains 1830 /1830 variables (removed 0) and now considering 149021/149021 (removed 0) transitions.
[2023-03-17 23:27:04] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
[2023-03-17 23:27:04] [INFO ] Invariant cache hit.
[2023-03-17 23:27:12] [INFO ] Implicit Places using invariants in 8130 ms returned []
Implicit Place search using SMT only with invariants took 8134 ms to find 0 implicit places.
[2023-03-17 23:27:12] [INFO ] Flow matrix only has 104723 transitions (discarded 44298 similar events)
[2023-03-17 23:27:12] [INFO ] Invariant cache hit.
[2023-03-17 23:27:42] [INFO ] Performed 89395/149021 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 23:28:03] [INFO ] Dead Transitions using invariants and state equation in 50608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59060 ms. Remains : 1830/1830 places, 149021/149021 transitions.
Treatment of property RERS2020-PT-pb105-LTLCardinality-13 finished in 558233 ms.
[2023-03-17 23:28:11] [INFO ] Flatten gal took : 3423 ms
[2023-03-17 23:28:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 23:28:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1967 places, 149582 transitions and 594939 arcs took 288 ms.
Total runtime 2193266 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2391/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2391/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS2020-PT-pb105-LTLCardinality-01
Could not compute solution for formula : RERS2020-PT-pb105-LTLCardinality-13

BK_STOP 1679095788542

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS2020-PT-pb105-LTLCardinality-01
ltl formula formula --ltl=/tmp/2391/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 1967 places, 149582 transitions and 594939 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2391/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2391/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 27.730 real 5.100 user 5.620 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2391/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2391/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
malloc_consolidate(): invalid chunk size
ltl formula name RERS2020-PT-pb105-LTLCardinality-13
ltl formula formula --ltl=/tmp/2391/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 1967 places, 149582 transitions and 594939 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 14.150 real 5.080 user 4.230 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2391/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2391/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2391/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2391/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 13 states
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:
malloc_consolidate(): invalid chunk size

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="RERS2020-PT-pb105"
export BK_EXAMINATION="LTLCardinality"
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 RERS2020-PT-pb105, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201800251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb105.tgz
mv RERS2020-PT-pb105 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;