Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975100347.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975100347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 23:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 ShieldRVt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679175958761

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 21:46:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:46:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:46:00] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-18 21:46:00] [INFO ] Transformed 5003 places.
[2023-03-18 21:46:00] [INFO ] Transformed 5003 transitions.
[2023-03-18 21:46:00] [INFO ] Found NUPN structural information;
[2023-03-18 21:46:00] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-100B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1088 places :
Symmetric choice reduction at 0 with 1088 rule applications. Total rules 1088 place count 3915 transition count 3915
Iterating global reduction 0 with 1088 rules applied. Total rules applied 2176 place count 3915 transition count 3915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2177 place count 3914 transition count 3914
Iterating global reduction 0 with 1 rules applied. Total rules applied 2178 place count 3914 transition count 3914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2179 place count 3913 transition count 3913
Iterating global reduction 0 with 1 rules applied. Total rules applied 2180 place count 3913 transition count 3913
Applied a total of 2180 rules in 1822 ms. Remains 3913 /5003 variables (removed 1090) and now considering 3913/5003 (removed 1090) transitions.
// Phase 1: matrix 3913 rows 3913 cols
[2023-03-18 21:46:03] [INFO ] Computed 401 place invariants in 35 ms
[2023-03-18 21:46:04] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2023-03-18 21:46:04] [INFO ] Invariant cache hit.
[2023-03-18 21:46:05] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
[2023-03-18 21:46:05] [INFO ] Invariant cache hit.
[2023-03-18 21:46:07] [INFO ] Dead Transitions using invariants and state equation in 2426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3913/5003 places, 3913/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6157 ms. Remains : 3913/5003 places, 3913/5003 transitions.
Support contains 26 out of 3913 places after structural reductions.
[2023-03-18 21:46:07] [INFO ] Flatten gal took : 181 ms
[2023-03-18 21:46:07] [INFO ] Flatten gal took : 112 ms
[2023-03-18 21:46:08] [INFO ] Input system was already deterministic with 3913 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-18 21:46:09] [INFO ] Invariant cache hit.
[2023-03-18 21:46:10] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 21:46:11] [INFO ] [Nat]Absence check using 401 positive place invariants in 258 ms returned sat
[2023-03-18 21:46:17] [INFO ] After 4442ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-18 21:46:18] [INFO ] Deduced a trap composed of 43 places in 1501 ms of which 7 ms to minimize.
[2023-03-18 21:46:20] [INFO ] Deduced a trap composed of 39 places in 1230 ms of which 2 ms to minimize.
[2023-03-18 21:46:21] [INFO ] Deduced a trap composed of 48 places in 1214 ms of which 12 ms to minimize.
[2023-03-18 21:46:22] [INFO ] Deduced a trap composed of 23 places in 1031 ms of which 2 ms to minimize.
[2023-03-18 21:46:23] [INFO ] Deduced a trap composed of 28 places in 988 ms of which 2 ms to minimize.
[2023-03-18 21:46:25] [INFO ] Deduced a trap composed of 24 places in 1170 ms of which 2 ms to minimize.
[2023-03-18 21:46:26] [INFO ] Deduced a trap composed of 31 places in 1062 ms of which 3 ms to minimize.
[2023-03-18 21:46:27] [INFO ] Deduced a trap composed of 29 places in 1188 ms of which 3 ms to minimize.
[2023-03-18 21:46:28] [INFO ] Deduced a trap composed of 32 places in 1074 ms of which 2 ms to minimize.
[2023-03-18 21:46:29] [INFO ] Deduced a trap composed of 22 places in 890 ms of which 1 ms to minimize.
[2023-03-18 21:46:31] [INFO ] Deduced a trap composed of 28 places in 1207 ms of which 2 ms to minimize.
[2023-03-18 21:46:32] [INFO ] Deduced a trap composed of 38 places in 1193 ms of which 2 ms to minimize.
[2023-03-18 21:46:33] [INFO ] Deduced a trap composed of 32 places in 817 ms of which 1 ms to minimize.
[2023-03-18 21:46:34] [INFO ] Deduced a trap composed of 37 places in 1085 ms of which 2 ms to minimize.
[2023-03-18 21:46:35] [INFO ] Deduced a trap composed of 38 places in 839 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:46:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:46:35] [INFO ] After 25418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1501 ms.
Support contains 19 out of 3913 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Drop transitions removed 1086 transitions
Trivial Post-agglo rules discarded 1086 transitions
Performed 1086 trivial Post agglomeration. Transition count delta: 1086
Iterating post reduction 0 with 1086 rules applied. Total rules applied 1086 place count 3913 transition count 2827
Reduce places removed 1086 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1091 rules applied. Total rules applied 2177 place count 2827 transition count 2822
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2182 place count 2822 transition count 2822
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 790 Pre rules applied. Total rules applied 2182 place count 2822 transition count 2032
Deduced a syphon composed of 790 places in 5 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 3 with 1580 rules applied. Total rules applied 3762 place count 2032 transition count 2032
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3764 place count 2030 transition count 2030
Iterating global reduction 3 with 2 rules applied. Total rules applied 3766 place count 2030 transition count 2030
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3766 place count 2030 transition count 2028
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3770 place count 2028 transition count 2028
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 1 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 3 with 1806 rules applied. Total rules applied 5576 place count 1125 transition count 1125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5577 place count 1125 transition count 1124
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5579 place count 1124 transition count 1123
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5781 place count 1023 transition count 1218
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5983 place count 922 transition count 1316
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 6169 place count 829 transition count 1408
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6170 place count 829 transition count 1407
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6171 place count 829 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6172 place count 828 transition count 1406
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6173 place count 828 transition count 1405
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6174 place count 828 transition count 1405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6175 place count 827 transition count 1404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6176 place count 826 transition count 1404
Applied a total of 6176 rules in 854 ms. Remains 826 /3913 variables (removed 3087) and now considering 1404/3913 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 854 ms. Remains : 826/3913 places, 1404/3913 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 75448 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75448 steps, saw 50147 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1404 rows 826 cols
[2023-03-18 21:46:42] [INFO ] Computed 400 place invariants in 10 ms
[2023-03-18 21:46:42] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:46:42] [INFO ] [Nat]Absence check using 400 positive place invariants in 65 ms returned sat
[2023-03-18 21:46:43] [INFO ] After 813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:46:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 21:46:44] [INFO ] After 553ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-18 21:46:45] [INFO ] After 1577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 495 ms.
[2023-03-18 21:46:45] [INFO ] After 3330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 997 ms.
Support contains 19 out of 826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 1404/1404 transitions.
Applied a total of 0 rules in 27 ms. Remains 826 /826 variables (removed 0) and now considering 1404/1404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 826/826 places, 1404/1404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 1404/1404 transitions.
Applied a total of 0 rules in 26 ms. Remains 826 /826 variables (removed 0) and now considering 1404/1404 (removed 0) transitions.
[2023-03-18 21:46:46] [INFO ] Invariant cache hit.
[2023-03-18 21:46:47] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-18 21:46:47] [INFO ] Invariant cache hit.
[2023-03-18 21:46:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 21:46:48] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2023-03-18 21:46:48] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-18 21:46:48] [INFO ] Invariant cache hit.
[2023-03-18 21:46:49] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2211 ms. Remains : 826/826 places, 1404/1404 transitions.
Graph (trivial) has 380 edges and 826 vertex of which 4 / 826 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2824 edges and 824 vertex of which 822 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 377 edges and 820 vertex of which 4 / 820 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 818 transition count 1395
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 376 edges and 816 vertex of which 6 / 816 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 813 transition count 1386
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 374 edges and 810 vertex of which 8 / 810 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 806 transition count 1375
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 802 vertex of which 8 / 802 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 798 transition count 1361
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 366 edges and 794 vertex of which 8 / 794 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 790 transition count 1347
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 362 edges and 786 vertex of which 6 / 786 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 783 transition count 1333
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 359 edges and 780 vertex of which 4 / 780 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 6 with 16 rules applied. Total rules applied 108 place count 778 transition count 1321
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 357 edges and 776 vertex of which 4 / 776 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 10 rules applied. Total rules applied 118 place count 774 transition count 1314
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 355 edges and 772 vertex of which 4 / 772 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 9 rules applied. Total rules applied 127 place count 770 transition count 1308
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 136 place count 768 transition count 1301
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 136 place count 768 transition count 1299
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 141 place count 765 transition count 1299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 144 place count 763 transition count 1298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 147 place count 763 transition count 1295
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 157 place count 763 transition count 1285
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 160 place count 763 transition count 1285
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 162 place count 763 transition count 1283
Applied a total of 162 rules in 181 ms. Remains 763 /826 variables (removed 63) and now considering 1283/1404 (removed 121) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 1283 rows 763 cols
[2023-03-18 21:46:49] [INFO ] Computed 369 place invariants in 4 ms
[2023-03-18 21:46:49] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:46:49] [INFO ] [Nat]Absence check using 369 positive place invariants in 40 ms returned sat
[2023-03-18 21:46:50] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:46:50] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-18 21:46:51] [INFO ] After 1848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA ShieldRVt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 610 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:46:52] [INFO ] Computed 401 place invariants in 33 ms
[2023-03-18 21:46:53] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2023-03-18 21:46:53] [INFO ] Invariant cache hit.
[2023-03-18 21:46:57] [INFO ] Implicit Places using invariants and state equation in 4113 ms returned []
Implicit Place search using SMT with State Equation took 5173 ms to find 0 implicit places.
[2023-03-18 21:46:57] [INFO ] Invariant cache hit.
[2023-03-18 21:46:59] [INFO ] Dead Transitions using invariants and state equation in 2307 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8096 ms. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (NEQ s1536 0) (NEQ s221 1)), p0:(OR (EQ s1364 0) (EQ s1162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 934 ms.
Product exploration explored 100000 steps with 0 reset in 1116 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213318 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213318 steps, saw 185886 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:47:05] [INFO ] Invariant cache hit.
[2023-03-18 21:47:06] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:47:06] [INFO ] [Nat]Absence check using 401 positive place invariants in 253 ms returned sat
[2023-03-18 21:47:08] [INFO ] After 1928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:47:09] [INFO ] Deduced a trap composed of 33 places in 1032 ms of which 2 ms to minimize.
[2023-03-18 21:47:10] [INFO ] Deduced a trap composed of 24 places in 892 ms of which 1 ms to minimize.
[2023-03-18 21:47:12] [INFO ] Deduced a trap composed of 25 places in 1052 ms of which 2 ms to minimize.
[2023-03-18 21:47:13] [INFO ] Deduced a trap composed of 27 places in 1062 ms of which 1 ms to minimize.
[2023-03-18 21:47:14] [INFO ] Deduced a trap composed of 41 places in 874 ms of which 2 ms to minimize.
[2023-03-18 21:47:15] [INFO ] Deduced a trap composed of 27 places in 1076 ms of which 2 ms to minimize.
[2023-03-18 21:47:16] [INFO ] Deduced a trap composed of 30 places in 1049 ms of which 2 ms to minimize.
[2023-03-18 21:47:17] [INFO ] Deduced a trap composed of 32 places in 817 ms of which 2 ms to minimize.
[2023-03-18 21:47:18] [INFO ] Deduced a trap composed of 34 places in 737 ms of which 2 ms to minimize.
[2023-03-18 21:47:19] [INFO ] Deduced a trap composed of 35 places in 981 ms of which 2 ms to minimize.
[2023-03-18 21:47:20] [INFO ] Deduced a trap composed of 39 places in 747 ms of which 2 ms to minimize.
[2023-03-18 21:47:21] [INFO ] Deduced a trap composed of 42 places in 954 ms of which 1 ms to minimize.
[2023-03-18 21:47:22] [INFO ] Deduced a trap composed of 25 places in 793 ms of which 2 ms to minimize.
[2023-03-18 21:47:23] [INFO ] Deduced a trap composed of 34 places in 765 ms of which 2 ms to minimize.
[2023-03-18 21:47:24] [INFO ] Deduced a trap composed of 38 places in 959 ms of which 2 ms to minimize.
[2023-03-18 21:47:25] [INFO ] Deduced a trap composed of 55 places in 765 ms of which 2 ms to minimize.
[2023-03-18 21:47:26] [INFO ] Deduced a trap composed of 30 places in 960 ms of which 5 ms to minimize.
[2023-03-18 21:47:27] [INFO ] Deduced a trap composed of 43 places in 931 ms of which 1 ms to minimize.
[2023-03-18 21:47:29] [INFO ] Deduced a trap composed of 50 places in 950 ms of which 2 ms to minimize.
[2023-03-18 21:47:29] [INFO ] Deduced a trap composed of 44 places in 695 ms of which 1 ms to minimize.
[2023-03-18 21:47:30] [INFO ] Deduced a trap composed of 27 places in 695 ms of which 2 ms to minimize.
[2023-03-18 21:47:31] [INFO ] Deduced a trap composed of 62 places in 832 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-18 21:47:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:47:31] [INFO ] After 25785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 9 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6197 place count 804 transition count 1400
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 803 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 802 transition count 1398
Applied a total of 6200 rules in 621 ms. Remains 802 /3902 variables (removed 3100) and now considering 1398/3902 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 802/3902 places, 1398/3902 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207907 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207907 steps, saw 129900 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 802 cols
[2023-03-18 21:47:35] [INFO ] Computed 400 place invariants in 14 ms
[2023-03-18 21:47:35] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:47:35] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-18 21:47:36] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:47:36] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-18 21:47:36] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 137 ms.
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1398/1398 transitions.
Applied a total of 0 rules in 22 ms. Remains 802 /802 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 802/802 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1398/1398 transitions.
Applied a total of 0 rules in 22 ms. Remains 802 /802 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-18 21:47:36] [INFO ] Invariant cache hit.
[2023-03-18 21:47:37] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-18 21:47:37] [INFO ] Invariant cache hit.
[2023-03-18 21:47:38] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-18 21:47:38] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-18 21:47:38] [INFO ] Invariant cache hit.
[2023-03-18 21:47:38] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2211 ms. Remains : 802/802 places, 1398/1398 transitions.
Graph (trivial) has 399 edges and 802 vertex of which 4 / 802 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2781 edges and 800 vertex of which 798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 796 vertex of which 4 / 796 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 794 transition count 1389
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 792 vertex of which 6 / 792 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 789 transition count 1380
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 786 vertex of which 8 / 786 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 782 transition count 1369
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 778 vertex of which 8 / 778 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 774 transition count 1355
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 770 vertex of which 8 / 770 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 766 transition count 1341
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 762 vertex of which 8 / 762 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 758 transition count 1327
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 750 transition count 1313
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 746 vertex of which 8 / 746 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 742 transition count 1299
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 738 vertex of which 8 / 738 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 734 transition count 1285
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 730 vertex of which 8 / 730 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 726 transition count 1271
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 722 vertex of which 8 / 722 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 718 transition count 1257
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 714 vertex of which 8 / 714 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 710 transition count 1243
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 706 vertex of which 8 / 706 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 702 transition count 1229
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 698 vertex of which 8 / 698 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 694 transition count 1215
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 690 vertex of which 8 / 690 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 686 transition count 1201
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 682 vertex of which 8 / 682 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 678 transition count 1187
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 674 vertex of which 8 / 674 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 670 transition count 1173
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 666 vertex of which 8 / 666 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 662 transition count 1159
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 658 vertex of which 8 / 658 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 654 transition count 1145
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 650 vertex of which 8 / 650 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 646 transition count 1131
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 642 vertex of which 8 / 642 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 638 transition count 1117
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 634 vertex of which 8 / 634 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 630 transition count 1103
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 626 vertex of which 8 / 626 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 622 transition count 1089
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 618 vertex of which 8 / 618 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 614 transition count 1075
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 610 vertex of which 8 / 610 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 606 transition count 1061
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 602 vertex of which 8 / 602 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 598 transition count 1047
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 594 vertex of which 8 / 594 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 590 transition count 1033
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 586 vertex of which 8 / 586 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 582 transition count 1019
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 578 vertex of which 8 / 578 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 574 transition count 1005
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 570 vertex of which 8 / 570 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 566 transition count 991
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 281 edges and 562 vertex of which 8 / 562 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 977
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 550 transition count 963
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 273 edges and 546 vertex of which 8 / 546 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 542 transition count 949
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 269 edges and 538 vertex of which 8 / 538 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 534 transition count 935
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 265 edges and 530 vertex of which 8 / 530 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 526 transition count 921
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 261 edges and 522 vertex of which 8 / 522 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 518 transition count 907
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 257 edges and 514 vertex of which 8 / 514 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 510 transition count 893
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 253 edges and 506 vertex of which 8 / 506 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 502 transition count 879
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 249 edges and 498 vertex of which 8 / 498 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 494 transition count 865
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 245 edges and 490 vertex of which 8 / 490 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 486 transition count 851
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 241 edges and 482 vertex of which 8 / 482 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 478 transition count 837
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 237 edges and 474 vertex of which 8 / 474 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 470 transition count 823
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 233 edges and 466 vertex of which 8 / 466 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 462 transition count 809
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 229 edges and 458 vertex of which 8 / 458 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 454 transition count 795
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 225 edges and 450 vertex of which 8 / 450 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 446 transition count 781
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 221 edges and 442 vertex of which 8 / 442 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 438 transition count 767
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 217 edges and 434 vertex of which 8 / 434 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 871 place count 430 transition count 753
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 213 edges and 426 vertex of which 8 / 426 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 890 place count 422 transition count 739
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 209 edges and 418 vertex of which 8 / 418 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 909 place count 414 transition count 725
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 205 edges and 410 vertex of which 8 / 410 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 928 place count 406 transition count 711
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 201 edges and 402 vertex of which 8 / 402 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 947 place count 398 transition count 697
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 197 edges and 394 vertex of which 8 / 394 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 966 place count 390 transition count 683
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 193 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 985 place count 382 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 189 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1004 place count 374 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 185 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1023 place count 366 transition count 641
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1042 place count 358 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1061 place count 350 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1080 place count 342 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1099 place count 334 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1118 place count 326 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1137 place count 318 transition count 557
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1156 place count 310 transition count 543
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1175 place count 302 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1194 place count 294 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1213 place count 286 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1232 place count 278 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1251 place count 270 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 6 / 266 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1270 place count 263 transition count 459
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 131 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 15 rules applied. Total rules applied 1285 place count 256 transition count 448
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 127 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 20 rules applied. Total rules applied 1305 place count 248 transition count 433
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 240 transition count 419
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 236 vertex of which 6 / 236 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 233 transition count 405
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 116 edges and 230 vertex of which 6 / 230 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 72 with 14 rules applied. Total rules applied 1357 place count 227 transition count 395
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 113 edges and 224 vertex of which 6 / 224 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 73 with 16 rules applied. Total rules applied 1373 place count 221 transition count 383
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 111 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 15 rules applied. Total rules applied 1388 place count 214 transition count 372
Discarding 200 places :
Also discarding 350 output transitions
Drop transitions removed 350 transitions
Remove reverse transitions (loop back) rule discarded transition t222.t219.t220 and 200 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 5 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 75 with 12 rules applied. Total rules applied 1400 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 76 with 5 rules applied. Total rules applied 1405 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 77 with 2 Pre rules applied. Total rules applied 1405 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 77 with 4 rules applied. Total rules applied 1409 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 77 with 3 rules applied. Total rules applied 1412 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 77 with 1 rules applied. Total rules applied 1413 place count 4 transition count 4
Applied a total of 1413 rules in 217 ms. Remains 4 /802 variables (removed 798) and now considering 4/1398 (removed 1394) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 21:47:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 21:47:39] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:47:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:47:39] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:47:39] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 21:47:39] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 3902 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3901 transition count 2806
Reduce places removed 1095 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2192 place count 2806 transition count 2804
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2194 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2194 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 7 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 3792 place count 2005 transition count 2005
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 0 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 5586 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5587 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5589 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5791 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5993 place count 905 transition count 1306
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 6185 place count 809 transition count 1402
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6187 place count 807 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6188 place count 806 transition count 1400
Applied a total of 6188 rules in 532 ms. Remains 806 /3902 variables (removed 3096) and now considering 1400/3902 (removed 2502) transitions.
// Phase 1: matrix 1400 rows 806 cols
[2023-03-18 21:47:39] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-18 21:47:40] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-18 21:47:40] [INFO ] Invariant cache hit.
[2023-03-18 21:47:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:47:41] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2023-03-18 21:47:41] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:47:41] [INFO ] Invariant cache hit.
[2023-03-18 21:47:41] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 806/3902 places, 1400/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2483 ms. Remains : 806/3902 places, 1400/3902 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Finished probabilistic random walk after 47150 steps, run visited all 1 properties in 926 ms. (steps per millisecond=50 )
Probabilistic random walk after 47150 steps, saw 30186 distinct states, run finished after 926 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 28 reset in 953 ms.
Product exploration explored 100000 steps with 26 reset in 877 ms.
Built C files in :
/tmp/ltsmin1219175510072197805
[2023-03-18 21:47:45] [INFO ] Computing symmetric may disable matrix : 1400 transitions.
[2023-03-18 21:47:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:47:45] [INFO ] Computing symmetric may enable matrix : 1400 transitions.
[2023-03-18 21:47:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:47:45] [INFO ] Computing Do-Not-Accords matrix : 1400 transitions.
[2023-03-18 21:47:45] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:47:45] [INFO ] Built C files in 309ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1219175510072197805
Running compilation step : cd /tmp/ltsmin1219175510072197805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1219175510072197805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1219175510072197805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 805 transition count 1398
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 804 transition count 1398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 803 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 802 transition count 1399
Applied a total of 5 rules in 123 ms. Remains 802 /806 variables (removed 4) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-18 21:47:48] [INFO ] Computed 400 place invariants in 7 ms
[2023-03-18 21:47:49] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-18 21:47:49] [INFO ] Invariant cache hit.
[2023-03-18 21:47:50] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2023-03-18 21:47:50] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:47:50] [INFO ] Invariant cache hit.
[2023-03-18 21:47:51] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/806 places, 1399/1400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2527 ms. Remains : 802/806 places, 1399/1400 transitions.
Built C files in :
/tmp/ltsmin3261247729177139334
[2023-03-18 21:47:51] [INFO ] Computing symmetric may disable matrix : 1399 transitions.
[2023-03-18 21:47:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:47:51] [INFO ] Computing symmetric may enable matrix : 1399 transitions.
[2023-03-18 21:47:51] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:47:51] [INFO ] Computing Do-Not-Accords matrix : 1399 transitions.
[2023-03-18 21:47:51] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:47:51] [INFO ] Built C files in 361ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3261247729177139334
Running compilation step : cd /tmp/ltsmin3261247729177139334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3261247729177139334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3261247729177139334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:47:54] [INFO ] Flatten gal took : 70 ms
[2023-03-18 21:47:54] [INFO ] Flatten gal took : 68 ms
[2023-03-18 21:47:54] [INFO ] Time to serialize gal into /tmp/LTL2135260904962879577.gal : 11 ms
[2023-03-18 21:47:54] [INFO ] Time to serialize properties into /tmp/LTL13790706162909728113.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2135260904962879577.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17200428485796057821.hoa' '-atoms' '/tmp/LTL13790706162909728113.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13790706162909728113.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17200428485796057821.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:48:10] [INFO ] Flatten gal took : 70 ms
[2023-03-18 21:48:10] [INFO ] Flatten gal took : 66 ms
[2023-03-18 21:48:10] [INFO ] Time to serialize gal into /tmp/LTL507393935154070499.gal : 11 ms
[2023-03-18 21:48:10] [INFO ] Time to serialize properties into /tmp/LTL15510832640511939322.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL507393935154070499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15510832640511939322.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p1727==0)||(p1468==1))")))||(G("((p1948!=0)&&(p254!=1))")))))
Formula 0 simplified : X(GF!"((p1727==0)||(p1468==1))" & F!"((p1948!=0)&&(p254!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:48:25] [INFO ] Flatten gal took : 102 ms
[2023-03-18 21:48:25] [INFO ] Applying decomposition
[2023-03-18 21:48:25] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8682936850840469694.txt' '-o' '/tmp/graph8682936850840469694.bin' '-w' '/tmp/graph8682936850840469694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8682936850840469694.bin' '-l' '-1' '-v' '-w' '/tmp/graph8682936850840469694.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:48:25] [INFO ] Decomposing Gal with order
[2023-03-18 21:48:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:48:26] [INFO ] Removed a total of 2771 redundant transitions.
[2023-03-18 21:48:26] [INFO ] Flatten gal took : 159 ms
[2023-03-18 21:48:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1642 labels/synchronizations in 68 ms.
[2023-03-18 21:48:26] [INFO ] Time to serialize gal into /tmp/LTL9121897123141529115.gal : 17 ms
[2023-03-18 21:48:26] [INFO ] Time to serialize properties into /tmp/LTL17693697079020406488.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9121897123141529115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17693697079020406488.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i6.i0.i0.u133.p1727==0)||(i4.i1.i1.u112.p1468==1))")))||(G("((i6.i1.i1.u150.p1948!=0)&&(i0.i1.i0.u13.p254!=1))")))))
Formula 0 simplified : X(GF!"((i6.i0.i0.u133.p1727==0)||(i4.i1.i1.u112.p1468==1))" & F!"((i6.i1.i1.u150.p1948!=0)&&(i0.i1.i0.u13.p254!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14434881148989496395
[2023-03-18 21:48:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14434881148989496395
Running compilation step : cd /tmp/ltsmin14434881148989496395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2759 ms.
Running link step : cd /tmp/ltsmin14434881148989496395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin14434881148989496395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 1268 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-100B-LTLCardinality-00 finished in 113907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3912 transition count 2817
Reduce places removed 1095 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2192 place count 2817 transition count 2815
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2194 place count 2815 transition count 2815
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2194 place count 2815 transition count 2020
Deduced a syphon composed of 795 places in 7 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 3784 place count 2020 transition count 2020
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 3793 place count 2011 transition count 2011
Iterating global reduction 3 with 9 rules applied. Total rules applied 3802 place count 2011 transition count 2011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 3802 place count 2011 transition count 2004
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 3816 place count 2004 transition count 2004
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 0 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 5610 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5611 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5613 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5815 place count 1005 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6017 place count 904 transition count 1304
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 6209 place count 808 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6211 place count 806 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6212 place count 805 transition count 1398
Applied a total of 6212 rules in 581 ms. Remains 805 /3913 variables (removed 3108) and now considering 1398/3913 (removed 2515) transitions.
// Phase 1: matrix 1398 rows 805 cols
[2023-03-18 21:48:45] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-18 21:48:46] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-18 21:48:46] [INFO ] Invariant cache hit.
[2023-03-18 21:48:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 21:48:47] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2023-03-18 21:48:47] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 21:48:47] [INFO ] Invariant cache hit.
[2023-03-18 21:48:48] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 805/3913 places, 1398/3913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2729 ms. Remains : 805/3913 places, 1398/3913 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s546 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 29 reset in 675 ms.
Product exploration explored 100000 steps with 23 reset in 879 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Finished probabilistic random walk after 49594 steps, run visited all 1 properties in 788 ms. (steps per millisecond=62 )
Probabilistic random walk after 49594 steps, saw 28886 distinct states, run finished after 790 ms. (steps per millisecond=62 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 805/805 places, 1398/1398 transitions.
Applied a total of 0 rules in 37 ms. Remains 805 /805 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-18 21:48:51] [INFO ] Invariant cache hit.
[2023-03-18 21:48:51] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-18 21:48:51] [INFO ] Invariant cache hit.
[2023-03-18 21:48:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 21:48:52] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2023-03-18 21:48:52] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:48:52] [INFO ] Invariant cache hit.
[2023-03-18 21:48:53] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2208 ms. Remains : 805/805 places, 1398/1398 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Finished probabilistic random walk after 49594 steps, run visited all 1 properties in 776 ms. (steps per millisecond=63 )
Probabilistic random walk after 49594 steps, saw 28886 distinct states, run finished after 777 ms. (steps per millisecond=63 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 766 ms.
Product exploration explored 100000 steps with 25 reset in 904 ms.
Built C files in :
/tmp/ltsmin15629357305452564315
[2023-03-18 21:48:56] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-18 21:48:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:56] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-18 21:48:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:57] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-18 21:48:57] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:48:57] [INFO ] Built C files in 382ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15629357305452564315
Running compilation step : cd /tmp/ltsmin15629357305452564315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15629357305452564315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15629357305452564315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 805/805 places, 1398/1398 transitions.
Applied a total of 0 rules in 25 ms. Remains 805 /805 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-18 21:49:00] [INFO ] Invariant cache hit.
[2023-03-18 21:49:00] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-18 21:49:00] [INFO ] Invariant cache hit.
[2023-03-18 21:49:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 21:49:01] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2023-03-18 21:49:01] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 21:49:01] [INFO ] Invariant cache hit.
[2023-03-18 21:49:02] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2081 ms. Remains : 805/805 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin11019303504802811165
[2023-03-18 21:49:02] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2023-03-18 21:49:02] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:49:02] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2023-03-18 21:49:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:49:02] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2023-03-18 21:49:02] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:49:02] [INFO ] Built C files in 442ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11019303504802811165
Running compilation step : cd /tmp/ltsmin11019303504802811165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11019303504802811165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11019303504802811165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:49:05] [INFO ] Flatten gal took : 62 ms
[2023-03-18 21:49:05] [INFO ] Flatten gal took : 55 ms
[2023-03-18 21:49:05] [INFO ] Time to serialize gal into /tmp/LTL9324332672957663365.gal : 12 ms
[2023-03-18 21:49:05] [INFO ] Time to serialize properties into /tmp/LTL14864534213170736522.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9324332672957663365.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16015454490766882514.hoa' '-atoms' '/tmp/LTL14864534213170736522.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14864534213170736522.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16015454490766882514.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t900, t902, t904, t906, t908, t910, t912, t914, t916, t918, t920, t923, t925, t927, t...3747
Computing Next relation with stutter on 4.28324e+77 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1091 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.1522,265092,1,0,2354,1.95758e+06,2825,681,40963,716862,2821
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-100B-LTLCardinality-02 finished in 33442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3912 transition count 2816
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2816 transition count 2816
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2192 place count 2816 transition count 2020
Deduced a syphon composed of 796 places in 6 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 3784 place count 2020 transition count 2020
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3793 place count 2011 transition count 2011
Iterating global reduction 2 with 9 rules applied. Total rules applied 3802 place count 2011 transition count 2011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3802 place count 2011 transition count 2004
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 3816 place count 2004 transition count 2004
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5614 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5615 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5617 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5819 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6021 place count 902 transition count 1304
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6215 place count 805 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6217 place count 803 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6218 place count 802 transition count 1399
Applied a total of 6218 rules in 698 ms. Remains 802 /3913 variables (removed 3111) and now considering 1399/3913 (removed 2514) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-18 21:49:19] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:49:20] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-18 21:49:20] [INFO ] Invariant cache hit.
[2023-03-18 21:49:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:49:20] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2023-03-18 21:49:21] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:49:21] [INFO ] Invariant cache hit.
[2023-03-18 21:49:21] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3913 places, 1399/3913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2864 ms. Remains : 802/3913 places, 1399/3913 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s653 0)], 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 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-03 finished in 2932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3902 transition count 3902
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3902 transition count 3902
Applied a total of 22 rules in 655 ms. Remains 3902 /3913 variables (removed 11) and now considering 3902/3913 (removed 11) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:49:22] [INFO ] Computed 401 place invariants in 25 ms
[2023-03-18 21:49:23] [INFO ] Implicit Places using invariants in 936 ms returned []
[2023-03-18 21:49:23] [INFO ] Invariant cache hit.
[2023-03-18 21:49:24] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 2519 ms to find 0 implicit places.
[2023-03-18 21:49:24] [INFO ] Invariant cache hit.
[2023-03-18 21:49:27] [INFO ] Dead Transitions using invariants and state equation in 2792 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3913 places, 3902/3913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5970 ms. Remains : 3902/3913 places, 3902/3913 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 69605 steps with 0 reset in 590 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-08 finished in 6699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((F(p1)&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))))'
Support contains 5 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 3904 transition count 3904
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 3904 transition count 3904
Applied a total of 18 rules in 772 ms. Remains 3904 /3913 variables (removed 9) and now considering 3904/3913 (removed 9) transitions.
// Phase 1: matrix 3904 rows 3904 cols
[2023-03-18 21:49:29] [INFO ] Computed 401 place invariants in 12 ms
[2023-03-18 21:49:30] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-18 21:49:30] [INFO ] Invariant cache hit.
[2023-03-18 21:49:31] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
[2023-03-18 21:49:31] [INFO ] Invariant cache hit.
[2023-03-18 21:49:33] [INFO ] Dead Transitions using invariants and state equation in 2537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3904/3913 places, 3904/3913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5206 ms. Remains : 3904/3913 places, 3904/3913 transitions.
Stuttering acceptance computed with spot in 490 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2), false]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(AND p0 p2), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}]], initial=0, aps=[p0:(OR (EQ s3692 1) (EQ s2178 0) (EQ s1885 1)), p1:(AND (EQ s482 0) (EQ s1033 1)), p2:(OR (EQ s1033 0) (EQ s482 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1032 ms.
Product exploration explored 100000 steps with 7 reset in 1014 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1083 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 105973 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105973 steps, saw 98876 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 21:49:41] [INFO ] Invariant cache hit.
[2023-03-18 21:49:42] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 21:49:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 283 ms returned sat
[2023-03-18 21:49:50] [INFO ] After 5197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 21:49:51] [INFO ] Deduced a trap composed of 22 places in 1189 ms of which 2 ms to minimize.
[2023-03-18 21:49:52] [INFO ] Deduced a trap composed of 19 places in 1015 ms of which 2 ms to minimize.
[2023-03-18 21:49:53] [INFO ] Deduced a trap composed of 23 places in 1060 ms of which 2 ms to minimize.
[2023-03-18 21:49:55] [INFO ] Deduced a trap composed of 21 places in 1091 ms of which 3 ms to minimize.
[2023-03-18 21:49:56] [INFO ] Deduced a trap composed of 33 places in 905 ms of which 1 ms to minimize.
[2023-03-18 21:49:57] [INFO ] Deduced a trap composed of 20 places in 855 ms of which 2 ms to minimize.
[2023-03-18 21:49:58] [INFO ] Deduced a trap composed of 29 places in 864 ms of which 4 ms to minimize.
[2023-03-18 21:49:59] [INFO ] Deduced a trap composed of 26 places in 1017 ms of which 1 ms to minimize.
[2023-03-18 21:50:00] [INFO ] Deduced a trap composed of 33 places in 858 ms of which 1 ms to minimize.
[2023-03-18 21:50:01] [INFO ] Deduced a trap composed of 41 places in 1020 ms of which 2 ms to minimize.
[2023-03-18 21:50:02] [INFO ] Deduced a trap composed of 27 places in 839 ms of which 2 ms to minimize.
[2023-03-18 21:50:03] [INFO ] Deduced a trap composed of 42 places in 966 ms of which 2 ms to minimize.
[2023-03-18 21:50:04] [INFO ] Deduced a trap composed of 43 places in 945 ms of which 1 ms to minimize.
[2023-03-18 21:50:05] [INFO ] Deduced a trap composed of 42 places in 833 ms of which 6 ms to minimize.
[2023-03-18 21:50:06] [INFO ] Deduced a trap composed of 29 places in 755 ms of which 1 ms to minimize.
[2023-03-18 21:50:07] [INFO ] Deduced a trap composed of 44 places in 773 ms of which 1 ms to minimize.
[2023-03-18 21:50:08] [INFO ] Deduced a trap composed of 40 places in 963 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-18 21:50:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:50:08] [INFO ] After 25669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 3495 ms.
Support contains 5 out of 3904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3904/3904 places, 3904/3904 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3904 transition count 2809
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2809 transition count 2808
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2808 transition count 2808
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2192 place count 2808 transition count 2010
Deduced a syphon composed of 798 places in 7 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2010 transition count 2010
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 0 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 5592 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5593 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5595 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5797 place count 1006 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5999 place count 905 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6193 place count 808 transition count 1402
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 808 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 807 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 806 transition count 1400
Applied a total of 6196 rules in 638 ms. Remains 806 /3904 variables (removed 3098) and now considering 1400/3904 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 806/3904 places, 1400/3904 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 148466 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 148466 steps, saw 91098 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :10
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 806 cols
[2023-03-18 21:50:16] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-18 21:50:16] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:50:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2023-03-18 21:50:17] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:50:17] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-18 21:50:17] [INFO ] After 727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 108 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 24 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 806/806 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223671 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223671 steps, saw 137427 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:50:20] [INFO ] Invariant cache hit.
[2023-03-18 21:50:21] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:50:21] [INFO ] [Nat]Absence check using 400 positive place invariants in 47 ms returned sat
[2023-03-18 21:50:21] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:50:21] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-18 21:50:21] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 157 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 55 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 806/806 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 37 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-18 21:50:21] [INFO ] Invariant cache hit.
[2023-03-18 21:50:22] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-18 21:50:22] [INFO ] Invariant cache hit.
[2023-03-18 21:50:23] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
[2023-03-18 21:50:23] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:50:23] [INFO ] Invariant cache hit.
[2023-03-18 21:50:24] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2203 ms. Remains : 806/806 places, 1400/1400 transitions.
Graph (trivial) has 396 edges and 806 vertex of which 4 / 806 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 804 vertex of which 802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 800 vertex of which 4 / 800 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 798 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 796 vertex of which 6 / 796 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 793 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 790 vertex of which 8 / 790 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 786 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 782 vertex of which 8 / 782 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 778 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 774 vertex of which 8 / 774 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 770 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 766 vertex of which 6 / 766 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1329
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 375 edges and 760 vertex of which 6 / 760 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 16 rules applied. Total rules applied 108 place count 757 transition count 1317
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 373 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 15 rules applied. Total rules applied 123 place count 750 transition count 1306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 746 vertex of which 10 / 746 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 142 place count 741 transition count 1292
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 364 edges and 736 vertex of which 8 / 736 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 23 rules applied. Total rules applied 165 place count 732 transition count 1275
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 728 vertex of which 8 / 728 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 184 place count 724 transition count 1261
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 720 vertex of which 8 / 720 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 203 place count 716 transition count 1247
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 712 vertex of which 8 / 712 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 222 place count 708 transition count 1233
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 704 vertex of which 8 / 704 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 241 place count 700 transition count 1219
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 696 vertex of which 8 / 696 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 260 place count 692 transition count 1205
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 688 vertex of which 8 / 688 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 279 place count 684 transition count 1191
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 680 vertex of which 8 / 680 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 298 place count 676 transition count 1177
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 672 vertex of which 8 / 672 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 317 place count 668 transition count 1163
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 664 vertex of which 8 / 664 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 336 place count 660 transition count 1149
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 656 vertex of which 8 / 656 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 355 place count 652 transition count 1135
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 648 vertex of which 8 / 648 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 374 place count 644 transition count 1121
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 640 vertex of which 8 / 640 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 393 place count 636 transition count 1107
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 632 vertex of which 8 / 632 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 628 transition count 1093
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 624 vertex of which 8 / 624 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 620 transition count 1079
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 616 vertex of which 8 / 616 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 450 place count 612 transition count 1065
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 608 vertex of which 8 / 608 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 469 place count 604 transition count 1051
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 600 vertex of which 8 / 600 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 596 transition count 1037
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 592 vertex of which 8 / 592 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 588 transition count 1023
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 584 vertex of which 8 / 584 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 580 transition count 1009
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 576 vertex of which 8 / 576 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 572 transition count 995
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 568 vertex of which 8 / 568 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 564 transition count 981
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 276 edges and 560 vertex of which 8 / 560 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 583 place count 556 transition count 967
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 272 edges and 552 vertex of which 8 / 552 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 602 place count 548 transition count 953
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 268 edges and 544 vertex of which 8 / 544 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 621 place count 540 transition count 939
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 264 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 640 place count 532 transition count 925
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 260 edges and 528 vertex of which 8 / 528 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 659 place count 524 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 256 edges and 520 vertex of which 8 / 520 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 516 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 252 edges and 512 vertex of which 8 / 512 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 508 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 248 edges and 504 vertex of which 8 / 504 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 500 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 244 edges and 496 vertex of which 8 / 496 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 492 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 240 edges and 488 vertex of which 8 / 488 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 484 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 236 edges and 480 vertex of which 8 / 480 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 476 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 232 edges and 472 vertex of which 8 / 472 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 468 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 228 edges and 464 vertex of which 8 / 464 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 460 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 224 edges and 456 vertex of which 8 / 456 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 452 transition count 785
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 218 edges and 449 vertex of which 2 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 847 place count 448 transition count 772
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 851 place count 447 transition count 769
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 851 place count 447 transition count 767
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 47 with 5 rules applied. Total rules applied 856 place count 444 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 859 place count 442 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 861 place count 442 transition count 764
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 48 with 3 rules applied. Total rules applied 864 place count 440 transition count 763
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 868 place count 440 transition count 759
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 49 with 2 rules applied. Total rules applied 870 place count 440 transition count 757
Applied a total of 870 rules in 149 ms. Remains 440 /806 variables (removed 366) and now considering 757/1400 (removed 643) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 440 cols
[2023-03-18 21:50:24] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-18 21:50:24] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:50:24] [INFO ] [Nat]Absence check using 218 positive place invariants in 19 ms returned sat
[2023-03-18 21:50:24] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:50:24] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 21:50:24] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1175 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Support contains 5 out of 3904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3904/3904 places, 3904/3904 transitions.
Applied a total of 0 rules in 402 ms. Remains 3904 /3904 variables (removed 0) and now considering 3904/3904 (removed 0) transitions.
// Phase 1: matrix 3904 rows 3904 cols
[2023-03-18 21:50:26] [INFO ] Computed 401 place invariants in 21 ms
[2023-03-18 21:50:27] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2023-03-18 21:50:27] [INFO ] Invariant cache hit.
[2023-03-18 21:50:31] [INFO ] Implicit Places using invariants and state equation in 4152 ms returned []
Implicit Place search using SMT with State Equation took 5178 ms to find 0 implicit places.
[2023-03-18 21:50:31] [INFO ] Invariant cache hit.
[2023-03-18 21:50:34] [INFO ] Dead Transitions using invariants and state equation in 2428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8011 ms. Remains : 3904/3904 places, 3904/3904 transitions.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 951 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 110710 steps, run timeout after 3004 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110710 steps, saw 101440 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 21:50:39] [INFO ] Invariant cache hit.
[2023-03-18 21:50:40] [INFO ] After 771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 21:50:41] [INFO ] [Nat]Absence check using 401 positive place invariants in 254 ms returned sat
[2023-03-18 21:50:47] [INFO ] After 4949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 21:50:49] [INFO ] Deduced a trap composed of 22 places in 1086 ms of which 2 ms to minimize.
[2023-03-18 21:50:50] [INFO ] Deduced a trap composed of 19 places in 1028 ms of which 1 ms to minimize.
[2023-03-18 21:50:51] [INFO ] Deduced a trap composed of 23 places in 1007 ms of which 2 ms to minimize.
[2023-03-18 21:50:52] [INFO ] Deduced a trap composed of 21 places in 876 ms of which 2 ms to minimize.
[2023-03-18 21:50:53] [INFO ] Deduced a trap composed of 33 places in 992 ms of which 1 ms to minimize.
[2023-03-18 21:50:54] [INFO ] Deduced a trap composed of 20 places in 923 ms of which 2 ms to minimize.
[2023-03-18 21:50:55] [INFO ] Deduced a trap composed of 29 places in 1043 ms of which 2 ms to minimize.
[2023-03-18 21:50:56] [INFO ] Deduced a trap composed of 26 places in 803 ms of which 1 ms to minimize.
[2023-03-18 21:50:57] [INFO ] Deduced a trap composed of 33 places in 726 ms of which 2 ms to minimize.
[2023-03-18 21:50:58] [INFO ] Deduced a trap composed of 41 places in 853 ms of which 1 ms to minimize.
[2023-03-18 21:50:59] [INFO ] Deduced a trap composed of 27 places in 935 ms of which 1 ms to minimize.
[2023-03-18 21:51:00] [INFO ] Deduced a trap composed of 42 places in 779 ms of which 2 ms to minimize.
[2023-03-18 21:51:01] [INFO ] Deduced a trap composed of 43 places in 977 ms of which 2 ms to minimize.
[2023-03-18 21:51:02] [INFO ] Deduced a trap composed of 42 places in 810 ms of which 1 ms to minimize.
[2023-03-18 21:51:03] [INFO ] Deduced a trap composed of 29 places in 788 ms of which 1 ms to minimize.
[2023-03-18 21:51:04] [INFO ] Deduced a trap composed of 44 places in 694 ms of which 1 ms to minimize.
[2023-03-18 21:51:05] [INFO ] Deduced a trap composed of 40 places in 909 ms of which 2 ms to minimize.
[2023-03-18 21:51:05] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 17790 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-18 21:51:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:51:05] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 2571 ms.
Support contains 5 out of 3904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3904/3904 places, 3904/3904 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3904 transition count 2809
Reduce places removed 1095 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2191 place count 2809 transition count 2808
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2808 transition count 2808
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2192 place count 2808 transition count 2010
Deduced a syphon composed of 798 places in 7 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2010 transition count 2010
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 0 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 5592 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5593 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5595 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5797 place count 1006 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5999 place count 905 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6193 place count 808 transition count 1402
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 808 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 807 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 806 transition count 1400
Applied a total of 6196 rules in 411 ms. Remains 806 /3904 variables (removed 3098) and now considering 1400/3904 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 806/3904 places, 1400/3904 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 172718 steps, run timeout after 3036 ms. (steps per millisecond=56 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 172718 steps, saw 105685 distinct states, run finished after 3036 ms. (steps per millisecond=56 ) properties seen :10
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 806 cols
[2023-03-18 21:51:12] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:51:12] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:51:13] [INFO ] [Nat]Absence check using 400 positive place invariants in 74 ms returned sat
[2023-03-18 21:51:13] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:51:13] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-18 21:51:13] [INFO ] After 757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 152 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 29 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 806/806 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193876 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193876 steps, saw 118861 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:51:17] [INFO ] Invariant cache hit.
[2023-03-18 21:51:17] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:51:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 55 ms returned sat
[2023-03-18 21:51:17] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:51:17] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-18 21:51:17] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 100 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 19 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 806/806 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 19 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-18 21:51:18] [INFO ] Invariant cache hit.
[2023-03-18 21:51:18] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-18 21:51:18] [INFO ] Invariant cache hit.
[2023-03-18 21:51:19] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2023-03-18 21:51:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 21:51:19] [INFO ] Invariant cache hit.
[2023-03-18 21:51:19] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2013 ms. Remains : 806/806 places, 1400/1400 transitions.
Graph (trivial) has 396 edges and 806 vertex of which 4 / 806 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 804 vertex of which 802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 800 vertex of which 4 / 800 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 798 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 796 vertex of which 6 / 796 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 793 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 790 vertex of which 8 / 790 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 786 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 782 vertex of which 8 / 782 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 778 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 774 vertex of which 8 / 774 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 770 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 766 vertex of which 6 / 766 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1329
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 375 edges and 760 vertex of which 6 / 760 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 16 rules applied. Total rules applied 108 place count 757 transition count 1317
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 373 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 15 rules applied. Total rules applied 123 place count 750 transition count 1306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 746 vertex of which 10 / 746 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 142 place count 741 transition count 1292
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 364 edges and 736 vertex of which 8 / 736 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 23 rules applied. Total rules applied 165 place count 732 transition count 1275
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 728 vertex of which 8 / 728 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 184 place count 724 transition count 1261
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 720 vertex of which 8 / 720 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 203 place count 716 transition count 1247
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 712 vertex of which 8 / 712 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 222 place count 708 transition count 1233
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 704 vertex of which 8 / 704 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 241 place count 700 transition count 1219
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 696 vertex of which 8 / 696 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 260 place count 692 transition count 1205
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 688 vertex of which 8 / 688 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 279 place count 684 transition count 1191
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 680 vertex of which 8 / 680 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 298 place count 676 transition count 1177
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 672 vertex of which 8 / 672 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 317 place count 668 transition count 1163
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 664 vertex of which 8 / 664 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 336 place count 660 transition count 1149
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 656 vertex of which 8 / 656 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 355 place count 652 transition count 1135
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 648 vertex of which 8 / 648 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 374 place count 644 transition count 1121
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 640 vertex of which 8 / 640 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 393 place count 636 transition count 1107
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 632 vertex of which 8 / 632 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 628 transition count 1093
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 624 vertex of which 8 / 624 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 620 transition count 1079
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 616 vertex of which 8 / 616 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 450 place count 612 transition count 1065
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 608 vertex of which 8 / 608 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 469 place count 604 transition count 1051
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 600 vertex of which 8 / 600 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 596 transition count 1037
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 592 vertex of which 8 / 592 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 588 transition count 1023
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 584 vertex of which 8 / 584 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 580 transition count 1009
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 576 vertex of which 8 / 576 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 572 transition count 995
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 568 vertex of which 8 / 568 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 564 transition count 981
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 276 edges and 560 vertex of which 8 / 560 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 583 place count 556 transition count 967
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 272 edges and 552 vertex of which 8 / 552 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 602 place count 548 transition count 953
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 268 edges and 544 vertex of which 8 / 544 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 621 place count 540 transition count 939
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 264 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 640 place count 532 transition count 925
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 260 edges and 528 vertex of which 8 / 528 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 659 place count 524 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 256 edges and 520 vertex of which 8 / 520 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 516 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 252 edges and 512 vertex of which 8 / 512 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 508 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 248 edges and 504 vertex of which 8 / 504 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 500 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 244 edges and 496 vertex of which 8 / 496 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 492 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 240 edges and 488 vertex of which 8 / 488 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 484 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 236 edges and 480 vertex of which 8 / 480 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 476 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 232 edges and 472 vertex of which 8 / 472 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 468 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 228 edges and 464 vertex of which 8 / 464 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 460 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 224 edges and 456 vertex of which 8 / 456 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 452 transition count 785
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 218 edges and 449 vertex of which 2 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 847 place count 448 transition count 772
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 851 place count 447 transition count 769
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 851 place count 447 transition count 767
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 47 with 5 rules applied. Total rules applied 856 place count 444 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 859 place count 442 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 861 place count 442 transition count 764
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 48 with 3 rules applied. Total rules applied 864 place count 440 transition count 763
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 868 place count 440 transition count 759
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 49 with 2 rules applied. Total rules applied 870 place count 440 transition count 757
Applied a total of 870 rules in 151 ms. Remains 440 /806 variables (removed 366) and now considering 757/1400 (removed 643) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 440 cols
[2023-03-18 21:51:20] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-18 21:51:20] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:51:20] [INFO ] [Nat]Absence check using 218 positive place invariants in 20 ms returned sat
[2023-03-18 21:51:20] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:51:20] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 21:51:20] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 789 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Product exploration explored 100000 steps with 3 reset in 1012 ms.
Product exploration explored 100000 steps with 3 reset in 1390 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Support contains 5 out of 3904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3904/3904 places, 3904/3904 transitions.
Performed 1096 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3904 transition count 3904
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1096 place count 3904 transition count 4305
Deduced a syphon composed of 1496 places in 17 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1496 place count 3904 transition count 4305
Performed 1202 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2698 places in 10 ms
Iterating global reduction 1 with 1202 rules applied. Total rules applied 2698 place count 3904 transition count 4306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2699 place count 3904 transition count 4305
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 3499 place count 3104 transition count 3504
Deduced a syphon composed of 1898 places in 10 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 4299 place count 3104 transition count 3504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1899 places in 10 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4300 place count 3104 transition count 3504
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4302 place count 3102 transition count 3502
Deduced a syphon composed of 1897 places in 10 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4304 place count 3102 transition count 3502
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -729
Deduced a syphon composed of 1998 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4405 place count 3102 transition count 4231
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 4507 place count 3000 transition count 4027
Deduced a syphon composed of 1896 places in 10 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 4609 place count 3000 transition count 4027
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -736
Deduced a syphon composed of 1997 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4710 place count 3000 transition count 4763
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4811 place count 2899 transition count 4561
Deduced a syphon composed of 1896 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4912 place count 2899 transition count 4561
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1997 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5013 place count 2899 transition count 5288
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 5115 place count 2797 transition count 5084
Deduced a syphon composed of 1895 places in 5 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 5217 place count 2797 transition count 5084
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -681
Deduced a syphon composed of 1989 places in 2 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 5311 place count 2797 transition count 5765
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 5405 place count 2703 transition count 5577
Deduced a syphon composed of 1895 places in 1 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 5499 place count 2703 transition count 5577
Deduced a syphon composed of 1895 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5502 place count 2703 transition count 5574
Deduced a syphon composed of 1895 places in 2 ms
Applied a total of 5502 rules in 4451 ms. Remains 2703 /3904 variables (removed 1201) and now considering 5574/3904 (removed -1670) transitions.
[2023-03-18 21:51:29] [INFO ] Redundant transitions in 270 ms returned []
// Phase 1: matrix 5574 rows 2703 cols
[2023-03-18 21:51:30] [INFO ] Computed 401 place invariants in 113 ms
[2023-03-18 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 3190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2703/3904 places, 5574/3904 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7931 ms. Remains : 2703/3904 places, 5574/3904 transitions.
Built C files in :
/tmp/ltsmin9769762474226796343
[2023-03-18 21:51:33] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9769762474226796343
Running compilation step : cd /tmp/ltsmin9769762474226796343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9769762474226796343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9769762474226796343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 3904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3904/3904 places, 3904/3904 transitions.
Applied a total of 0 rules in 373 ms. Remains 3904 /3904 variables (removed 0) and now considering 3904/3904 (removed 0) transitions.
// Phase 1: matrix 3904 rows 3904 cols
[2023-03-18 21:51:36] [INFO ] Computed 401 place invariants in 21 ms
[2023-03-18 21:51:37] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2023-03-18 21:51:37] [INFO ] Invariant cache hit.
[2023-03-18 21:51:38] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2023-03-18 21:51:38] [INFO ] Invariant cache hit.
[2023-03-18 21:51:40] [INFO ] Dead Transitions using invariants and state equation in 2329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4731 ms. Remains : 3904/3904 places, 3904/3904 transitions.
Built C files in :
/tmp/ltsmin5793876624749894926
[2023-03-18 21:51:41] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5793876624749894926
Running compilation step : cd /tmp/ltsmin5793876624749894926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5793876624749894926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5793876624749894926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:51:44] [INFO ] Flatten gal took : 95 ms
[2023-03-18 21:51:44] [INFO ] Flatten gal took : 81 ms
[2023-03-18 21:51:44] [INFO ] Time to serialize gal into /tmp/LTL4572016372032347144.gal : 22 ms
[2023-03-18 21:51:44] [INFO ] Time to serialize properties into /tmp/LTL3085758733790230257.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4572016372032347144.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13707812234921761876.hoa' '-atoms' '/tmp/LTL3085758733790230257.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3085758733790230257.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13707812234921761876.hoa
Detected timeout of ITS tools.
[2023-03-18 21:51:59] [INFO ] Flatten gal took : 91 ms
[2023-03-18 21:51:59] [INFO ] Flatten gal took : 85 ms
[2023-03-18 21:51:59] [INFO ] Time to serialize gal into /tmp/LTL4587552550238377114.gal : 26 ms
[2023-03-18 21:51:59] [INFO ] Time to serialize properties into /tmp/LTL16083470556726164310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4587552550238377114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16083470556726164310.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((p4727==1)||(p2776==0))||(p2399==1))"))||(X(F((F("((p590==0)&&(p1300==1))"))&&((X(!("((p1300==0)||(p590==1))")))U((X(G(!("((p...256
Formula 0 simplified : F!"(((p4727==1)||(p2776==0))||(p2399==1))" & XG(G!"((p590==0)&&(p1300==1))" | (X"((p1300==0)||(p590==1))" R (XF"((p1300==0)||(p590==...221
Detected timeout of ITS tools.
[2023-03-18 21:52:14] [INFO ] Flatten gal took : 62 ms
[2023-03-18 21:52:14] [INFO ] Applying decomposition
[2023-03-18 21:52:14] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2039112357002814244.txt' '-o' '/tmp/graph2039112357002814244.bin' '-w' '/tmp/graph2039112357002814244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2039112357002814244.bin' '-l' '-1' '-v' '-w' '/tmp/graph2039112357002814244.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:52:15] [INFO ] Decomposing Gal with order
[2023-03-18 21:52:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:52:16] [INFO ] Removed a total of 989 redundant transitions.
[2023-03-18 21:52:16] [INFO ] Flatten gal took : 199 ms
[2023-03-18 21:52:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2023-03-18 21:52:16] [INFO ] Time to serialize gal into /tmp/LTL3578674488842310834.gal : 53 ms
[2023-03-18 21:52:16] [INFO ] Time to serialize properties into /tmp/LTL6352914633599448465.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3578674488842310834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6352914633599448465.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(((i52.u1456.p4727==1)||(i36.i0.i3.u865.p2776==0))||(i33.i0.i4.u747.p2399==1))"))||(X(F((F("((i15.i1.i4.u192.p590==0)&&(i13.i1....446
Formula 0 simplified : F!"(((i52.u1456.p4727==1)||(i36.i0.i3.u865.p2776==0))||(i33.i0.i4.u747.p2399==1))" & XG(G!"((i15.i1.i4.u192.p590==0)&&(i13.i1.i3.u41...411
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6640021133648147758
[2023-03-18 21:52:31] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6640021133648147758
Running compilation step : cd /tmp/ltsmin6640021133648147758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6640021133648147758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6640021133648147758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-100B-LTLCardinality-09 finished in 186376 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 4 out of 3913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3912 transition count 2816
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2816 transition count 2816
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2192 place count 2816 transition count 2023
Deduced a syphon composed of 793 places in 7 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3778 place count 2023 transition count 2023
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3787 place count 2014 transition count 2014
Iterating global reduction 2 with 9 rules applied. Total rules applied 3796 place count 2014 transition count 2014
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3796 place count 2014 transition count 2007
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 3810 place count 2007 transition count 2007
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 1 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5608 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5609 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5611 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5813 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6015 place count 905 transition count 1306
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6207 place count 809 transition count 1401
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6208 place count 809 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6210 place count 807 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6211 place count 806 transition count 1399
Applied a total of 6211 rules in 950 ms. Remains 806 /3913 variables (removed 3107) and now considering 1399/3913 (removed 2514) transitions.
// Phase 1: matrix 1399 rows 806 cols
[2023-03-18 21:52:35] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:52:36] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-18 21:52:36] [INFO ] Invariant cache hit.
[2023-03-18 21:52:37] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-03-18 21:52:37] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:52:37] [INFO ] Invariant cache hit.
[2023-03-18 21:52:37] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 806/3913 places, 1399/3913 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3026 ms. Remains : 806/3913 places, 1399/3913 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-10 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 s728 0) (EQ s274 1) (OR (EQ s743 0) (EQ s703 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 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-10 finished in 3079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3901 transition count 3901
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3901 transition count 3901
Applied a total of 24 rules in 705 ms. Remains 3901 /3913 variables (removed 12) and now considering 3901/3913 (removed 12) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2023-03-18 21:52:38] [INFO ] Computed 401 place invariants in 20 ms
[2023-03-18 21:52:39] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-18 21:52:39] [INFO ] Invariant cache hit.
[2023-03-18 21:52:40] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-03-18 21:52:40] [INFO ] Invariant cache hit.
[2023-03-18 21:52:43] [INFO ] Dead Transitions using invariants and state equation in 2557 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3913 places, 3901/3913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5157 ms. Remains : 3901/3913 places, 3901/3913 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s487 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 56 reset in 620 ms.
Product exploration explored 100000 steps with 56 reset in 742 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Detected a total of 1198/3901 stabilizing places and 1198/3901 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 1729 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=101 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-18 21:52:45] [INFO ] Invariant cache hit.
[2023-03-18 21:52:48] [INFO ] [Real]Absence check using 401 positive place invariants in 868 ms returned sat
[2023-03-18 21:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:53:00] [INFO ] [Real]Absence check using state equation in 12154 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3900 transition count 2802
Reduce places removed 1098 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2197 place count 2802 transition count 2801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2198 place count 2801 transition count 2801
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2198 place count 2801 transition count 2001
Deduced a syphon composed of 800 places in 7 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3798 place count 2001 transition count 2001
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 0 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 3 with 1792 rules applied. Total rules applied 5590 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5591 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5593 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5795 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5997 place count 902 transition count 1304
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6191 place count 805 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6193 place count 803 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 802 transition count 1399
Applied a total of 6194 rules in 699 ms. Remains 802 /3901 variables (removed 3099) and now considering 1399/3901 (removed 2502) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-18 21:53:00] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-18 21:53:01] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-18 21:53:01] [INFO ] Invariant cache hit.
[2023-03-18 21:53:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:53:02] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
[2023-03-18 21:53:02] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-18 21:53:02] [INFO ] Invariant cache hit.
[2023-03-18 21:53:03] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3901 places, 1399/3901 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2978 ms. Remains : 802/3901 places, 1399/3901 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/802 stabilizing places and 2/1399 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-18 21:53:03] [INFO ] Invariant cache hit.
[2023-03-18 21:53:04] [INFO ] [Real]Absence check using 400 positive place invariants in 160 ms returned sat
[2023-03-18 21:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:53:05] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2023-03-18 21:53:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:53:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 143 ms returned sat
[2023-03-18 21:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:53:08] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2023-03-18 21:53:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:53:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 7 ms returned sat
[2023-03-18 21:53:08] [INFO ] Computed and/alt/rep : 1394/4411/1394 causal constraints (skipped 0 transitions) in 104 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:53:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-11 finished in 43061 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 (p1||G(p0)))&&F((G(p2)||(p2&&F((!p2&&G(p3)))))))))'
Support contains 4 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3903 transition count 3903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3903 transition count 3903
Applied a total of 20 rules in 898 ms. Remains 3903 /3913 variables (removed 10) and now considering 3903/3913 (removed 10) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2023-03-18 21:53:21] [INFO ] Computed 401 place invariants in 21 ms
[2023-03-18 21:53:22] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-18 21:53:22] [INFO ] Invariant cache hit.
[2023-03-18 21:53:27] [INFO ] Implicit Places using invariants and state equation in 4136 ms returned []
Implicit Place search using SMT with State Equation took 5138 ms to find 0 implicit places.
[2023-03-18 21:53:27] [INFO ] Invariant cache hit.
[2023-03-18 21:53:29] [INFO ] Dead Transitions using invariants and state equation in 2684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3903/3913 places, 3903/3913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8723 ms. Remains : 3903/3913 places, 3903/3913 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={0} source=5 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p2 p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NEQ s2187 1) (NEQ s527 1)), p0:(NEQ s527 1), p2:(OR (EQ s816 0) (EQ s2034 1)), p3:(NEQ s2187 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 721 ms.
Product exploration explored 100000 steps with 1 reset in 1040 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 479 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:53:32] [INFO ] Invariant cache hit.
[2023-03-18 21:53:33] [INFO ] [Real]Absence check using 401 positive place invariants in 279 ms returned sat
[2023-03-18 21:53:35] [INFO ] After 3137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:53:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 259 ms returned sat
[2023-03-18 21:53:40] [INFO ] After 3448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:53:41] [INFO ] Deduced a trap composed of 21 places in 1097 ms of which 1 ms to minimize.
[2023-03-18 21:53:42] [INFO ] Deduced a trap composed of 25 places in 1040 ms of which 2 ms to minimize.
[2023-03-18 21:53:44] [INFO ] Deduced a trap composed of 37 places in 1108 ms of which 4 ms to minimize.
[2023-03-18 21:53:45] [INFO ] Deduced a trap composed of 34 places in 1119 ms of which 2 ms to minimize.
[2023-03-18 21:53:46] [INFO ] Deduced a trap composed of 22 places in 765 ms of which 3 ms to minimize.
[2023-03-18 21:53:47] [INFO ] Deduced a trap composed of 26 places in 746 ms of which 1 ms to minimize.
[2023-03-18 21:53:48] [INFO ] Deduced a trap composed of 32 places in 1030 ms of which 2 ms to minimize.
[2023-03-18 21:53:49] [INFO ] Deduced a trap composed of 28 places in 1019 ms of which 1 ms to minimize.
[2023-03-18 21:53:50] [INFO ] Deduced a trap composed of 22 places in 1038 ms of which 1 ms to minimize.
[2023-03-18 21:53:51] [INFO ] Deduced a trap composed of 44 places in 941 ms of which 2 ms to minimize.
[2023-03-18 21:53:52] [INFO ] Deduced a trap composed of 30 places in 947 ms of which 1 ms to minimize.
[2023-03-18 21:53:53] [INFO ] Deduced a trap composed of 36 places in 746 ms of which 2 ms to minimize.
[2023-03-18 21:53:54] [INFO ] Deduced a trap composed of 26 places in 780 ms of which 1 ms to minimize.
[2023-03-18 21:53:55] [INFO ] Deduced a trap composed of 47 places in 748 ms of which 2 ms to minimize.
[2023-03-18 21:53:56] [INFO ] Deduced a trap composed of 40 places in 971 ms of which 2 ms to minimize.
[2023-03-18 21:53:57] [INFO ] Deduced a trap composed of 63 places in 759 ms of which 2 ms to minimize.
[2023-03-18 21:53:58] [INFO ] Deduced a trap composed of 80 places in 796 ms of which 1 ms to minimize.
[2023-03-18 21:53:59] [INFO ] Deduced a trap composed of 50 places in 684 ms of which 1 ms to minimize.
[2023-03-18 21:54:00] [INFO ] Deduced a trap composed of 39 places in 780 ms of which 1 ms to minimize.
[2023-03-18 21:54:01] [INFO ] Deduced a trap composed of 35 places in 905 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-18 21:54:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:54:01] [INFO ] After 25403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 190 ms.
Support contains 3 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3903 transition count 2805
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2805 transition count 2805
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2805 transition count 2006
Deduced a syphon composed of 799 places in 6 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2006 transition count 2006
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 0 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 5594 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5595 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5597 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5799 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6001 place count 903 transition count 1304
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6195 place count 806 transition count 1401
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6196 place count 806 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6197 place count 805 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1399
Applied a total of 6198 rules in 451 ms. Remains 804 /3903 variables (removed 3099) and now considering 1399/3903 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 804/3903 places, 1399/3903 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 190506 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190506 steps, saw 120969 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1399 rows 804 cols
[2023-03-18 21:54:05] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:54:05] [INFO ] [Real]Absence check using 400 positive place invariants in 46 ms returned sat
[2023-03-18 21:54:05] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:54:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 42 ms returned sat
[2023-03-18 21:54:06] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:54:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:06] [INFO ] After 81ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:54:06] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-18 21:54:06] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 175 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1399/1399 transitions.
Applied a total of 0 rules in 28 ms. Remains 804 /804 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 804/804 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1399/1399 transitions.
Applied a total of 0 rules in 51 ms. Remains 804 /804 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2023-03-18 21:54:06] [INFO ] Invariant cache hit.
[2023-03-18 21:54:07] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-18 21:54:07] [INFO ] Invariant cache hit.
[2023-03-18 21:54:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:08] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2023-03-18 21:54:08] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-18 21:54:08] [INFO ] Invariant cache hit.
[2023-03-18 21:54:09] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2447 ms. Remains : 804/804 places, 1399/1399 transitions.
Graph (trivial) has 398 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2793 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 395 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1390
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 394 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1381
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 392 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1370
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 388 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1356
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 384 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1342
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 380 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1328
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 376 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1314
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 372 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1300
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1286
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1272
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1258
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1244
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1230
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1216
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1202
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1188
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1174
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1160
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1146
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1132
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1118
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1104
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1090
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1076
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1062
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1048
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1034
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1020
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1006
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 572 vertex of which 8 / 572 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 568 transition count 992
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 564 vertex of which 8 / 564 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 560 transition count 978
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 276 edges and 556 vertex of which 8 / 556 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 552 transition count 964
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 272 edges and 548 vertex of which 8 / 548 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 544 transition count 950
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 268 edges and 540 vertex of which 8 / 540 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 536 transition count 936
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 264 edges and 532 vertex of which 8 / 532 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 528 transition count 922
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 260 edges and 524 vertex of which 8 / 524 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 520 transition count 908
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 256 edges and 516 vertex of which 8 / 516 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 512 transition count 894
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 252 edges and 508 vertex of which 8 / 508 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 504 transition count 880
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 248 edges and 500 vertex of which 8 / 500 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 496 transition count 866
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 244 edges and 492 vertex of which 8 / 492 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 488 transition count 852
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 240 edges and 484 vertex of which 8 / 484 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 480 transition count 838
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 236 edges and 476 vertex of which 8 / 476 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 472 transition count 824
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 232 edges and 468 vertex of which 8 / 468 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 464 transition count 810
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 228 edges and 460 vertex of which 8 / 460 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 456 transition count 796
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 224 edges and 452 vertex of which 8 / 452 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 448 transition count 782
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 219 edges and 445 vertex of which 6 / 445 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 850 place count 442 transition count 769
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 216 edges and 439 vertex of which 6 / 439 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 46 with 16 rules applied. Total rules applied 866 place count 436 transition count 757
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 214 edges and 433 vertex of which 6 / 433 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 47 with 15 rules applied. Total rules applied 881 place count 430 transition count 746
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 212 edges and 427 vertex of which 8 / 427 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 15 rules applied. Total rules applied 896 place count 423 transition count 735
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 205 edges and 421 vertex of which 2 / 421 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 49 with 14 rules applied. Total rules applied 910 place count 420 transition count 724
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 50 with 4 rules applied. Total rules applied 914 place count 419 transition count 721
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 51 with 1 Pre rules applied. Total rules applied 914 place count 419 transition count 720
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 51 with 3 rules applied. Total rules applied 917 place count 417 transition count 720
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 51 with 5 rules applied. Total rules applied 922 place count 414 transition count 718
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1425 edges and 414 vertex of which 410 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 51 with 3 rules applied. Total rules applied 925 place count 410 transition count 714
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 52 with 5 rules applied. Total rules applied 930 place count 410 transition count 709
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 53 with 7 rules applied. Total rules applied 937 place count 410 transition count 702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 53 with 2 rules applied. Total rules applied 939 place count 408 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 54 with 3 rules applied. Total rules applied 942 place count 406 transition count 701
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 54 with 4 rules applied. Total rules applied 946 place count 406 transition count 697
Applied a total of 946 rules in 182 ms. Remains 406 /804 variables (removed 398) and now considering 697/1399 (removed 702) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 697 rows 406 cols
[2023-03-18 21:54:09] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-18 21:54:09] [INFO ] [Real]Absence check using 202 positive place invariants in 20 ms returned sat
[2023-03-18 21:54:09] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:54:09] [INFO ] [Nat]Absence check using 202 positive place invariants in 38 ms returned sat
[2023-03-18 21:54:10] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:54:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 21:54:10] [INFO ] After 36ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:54:10] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-18 21:54:10] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 p0))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND p2 p3))), (F (NOT p2)), (F (AND (NOT p2) p3))]
Knowledge based reduction with 11 factoid took 473 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 3 out of 3903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1097 transitions
Trivial Post-agglo rules discarded 1097 transitions
Performed 1097 trivial Post agglomeration. Transition count delta: 1097
Iterating post reduction 0 with 1097 rules applied. Total rules applied 1097 place count 3902 transition count 2805
Reduce places removed 1097 places and 0 transitions.
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2194 place count 2805 transition count 2805
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2194 place count 2805 transition count 2006
Deduced a syphon composed of 799 places in 7 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 2 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 5588 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5589 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5591 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5793 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5995 place count 905 transition count 1305
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6187 place count 809 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6189 place count 807 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6190 place count 806 transition count 1399
Applied a total of 6190 rules in 658 ms. Remains 806 /3903 variables (removed 3097) and now considering 1399/3903 (removed 2504) transitions.
// Phase 1: matrix 1399 rows 806 cols
[2023-03-18 21:54:11] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-18 21:54:12] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-18 21:54:12] [INFO ] Invariant cache hit.
[2023-03-18 21:54:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:13] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2023-03-18 21:54:13] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 21:54:13] [INFO ] Invariant cache hit.
[2023-03-18 21:54:14] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 806/3903 places, 1399/3903 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2866 ms. Remains : 806/3903 places, 1399/3903 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 4 factoid took 337 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:54:14] [INFO ] Invariant cache hit.
[2023-03-18 21:54:14] [INFO ] [Real]Absence check using 400 positive place invariants in 49 ms returned sat
[2023-03-18 21:54:15] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:54:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-18 21:54:16] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:54:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:16] [INFO ] After 93ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:54:16] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-18 21:54:16] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 204 ms.
Support contains 3 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1399/1399 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 806 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 805 transition count 1397
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 804 transition count 1399
Applied a total of 5 rules in 50 ms. Remains 804 /806 variables (removed 2) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 804/806 places, 1399/1399 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189987 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{0=1}
Probabilistic random walk after 189987 steps, saw 118988 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1399 rows 804 cols
[2023-03-18 21:54:20] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:54:20] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2023-03-18 21:54:20] [INFO ] After 691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:54:20] [INFO ] [Nat]Absence check using 400 positive place invariants in 58 ms returned sat
[2023-03-18 21:54:21] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:54:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:21] [INFO ] After 38ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:54:21] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-18 21:54:21] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 63 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1399/1399 transitions.
Applied a total of 0 rules in 29 ms. Remains 804 /804 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 804/804 places, 1399/1399 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193033 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193033 steps, saw 121109 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:54:24] [INFO ] Invariant cache hit.
[2023-03-18 21:54:24] [INFO ] [Real]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-18 21:54:24] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:54:24] [INFO ] [Nat]Absence check using 400 positive place invariants in 47 ms returned sat
[2023-03-18 21:54:25] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:54:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:25] [INFO ] After 48ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:54:25] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-18 21:54:25] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 3 out of 804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1399/1399 transitions.
Applied a total of 0 rules in 34 ms. Remains 804 /804 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 804/804 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 804/804 places, 1399/1399 transitions.
Applied a total of 0 rules in 25 ms. Remains 804 /804 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2023-03-18 21:54:25] [INFO ] Invariant cache hit.
[2023-03-18 21:54:26] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-18 21:54:26] [INFO ] Invariant cache hit.
[2023-03-18 21:54:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:27] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2023-03-18 21:54:27] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 21:54:27] [INFO ] Invariant cache hit.
[2023-03-18 21:54:27] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2031 ms. Remains : 804/804 places, 1399/1399 transitions.
Graph (trivial) has 398 edges and 804 vertex of which 4 / 804 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2793 edges and 802 vertex of which 800 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 395 edges and 798 vertex of which 4 / 798 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 796 transition count 1390
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 394 edges and 794 vertex of which 6 / 794 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 791 transition count 1381
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 392 edges and 788 vertex of which 8 / 788 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 784 transition count 1370
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 388 edges and 780 vertex of which 8 / 780 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 776 transition count 1356
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 384 edges and 772 vertex of which 8 / 772 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 768 transition count 1342
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 380 edges and 764 vertex of which 8 / 764 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 760 transition count 1328
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 376 edges and 756 vertex of which 8 / 756 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 752 transition count 1314
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 372 edges and 748 vertex of which 8 / 748 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 744 transition count 1300
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 736 transition count 1286
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 732 vertex of which 8 / 732 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 728 transition count 1272
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 724 vertex of which 8 / 724 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 720 transition count 1258
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 716 vertex of which 8 / 716 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 712 transition count 1244
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 708 vertex of which 8 / 708 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 704 transition count 1230
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 700 vertex of which 8 / 700 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 696 transition count 1216
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 692 vertex of which 8 / 692 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 688 transition count 1202
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 684 vertex of which 8 / 684 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 680 transition count 1188
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 676 vertex of which 8 / 676 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 672 transition count 1174
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 668 vertex of which 8 / 668 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 664 transition count 1160
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 660 vertex of which 8 / 660 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 656 transition count 1146
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 652 vertex of which 8 / 652 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 648 transition count 1132
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 644 vertex of which 8 / 644 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 640 transition count 1118
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 636 vertex of which 8 / 636 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 632 transition count 1104
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 628 vertex of which 8 / 628 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 624 transition count 1090
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 620 vertex of which 8 / 620 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 616 transition count 1076
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 612 vertex of which 8 / 612 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 608 transition count 1062
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 604 vertex of which 8 / 604 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 600 transition count 1048
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 596 vertex of which 8 / 596 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 592 transition count 1034
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 588 vertex of which 8 / 588 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 584 transition count 1020
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 580 vertex of which 8 / 580 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 576 transition count 1006
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 572 vertex of which 8 / 572 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 568 transition count 992
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 564 vertex of which 8 / 564 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 560 transition count 978
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 276 edges and 556 vertex of which 8 / 556 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 552 transition count 964
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 272 edges and 548 vertex of which 8 / 548 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 544 transition count 950
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 268 edges and 540 vertex of which 8 / 540 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 536 transition count 936
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 264 edges and 532 vertex of which 8 / 532 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 528 transition count 922
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 260 edges and 524 vertex of which 8 / 524 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 520 transition count 908
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 256 edges and 516 vertex of which 8 / 516 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 512 transition count 894
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 252 edges and 508 vertex of which 8 / 508 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 504 transition count 880
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 248 edges and 500 vertex of which 8 / 500 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 496 transition count 866
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 244 edges and 492 vertex of which 8 / 492 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 488 transition count 852
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 240 edges and 484 vertex of which 8 / 484 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 480 transition count 838
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 236 edges and 476 vertex of which 8 / 476 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 472 transition count 824
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 232 edges and 468 vertex of which 8 / 468 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 464 transition count 810
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 228 edges and 460 vertex of which 8 / 460 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 456 transition count 796
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 224 edges and 452 vertex of which 8 / 452 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 448 transition count 782
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 219 edges and 445 vertex of which 6 / 445 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 850 place count 442 transition count 769
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 216 edges and 439 vertex of which 6 / 439 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 46 with 16 rules applied. Total rules applied 866 place count 436 transition count 757
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 214 edges and 433 vertex of which 6 / 433 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 47 with 15 rules applied. Total rules applied 881 place count 430 transition count 746
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 212 edges and 427 vertex of which 8 / 427 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 15 rules applied. Total rules applied 896 place count 423 transition count 735
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 205 edges and 421 vertex of which 2 / 421 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 49 with 14 rules applied. Total rules applied 910 place count 420 transition count 724
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 50 with 4 rules applied. Total rules applied 914 place count 419 transition count 721
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 51 with 1 Pre rules applied. Total rules applied 914 place count 419 transition count 720
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 51 with 3 rules applied. Total rules applied 917 place count 417 transition count 720
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 51 with 5 rules applied. Total rules applied 922 place count 414 transition count 718
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1425 edges and 414 vertex of which 410 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 51 with 3 rules applied. Total rules applied 925 place count 410 transition count 714
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 52 with 5 rules applied. Total rules applied 930 place count 410 transition count 709
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 53 with 7 rules applied. Total rules applied 937 place count 410 transition count 702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 53 with 2 rules applied. Total rules applied 939 place count 408 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 54 with 3 rules applied. Total rules applied 942 place count 406 transition count 701
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 54 with 4 rules applied. Total rules applied 946 place count 406 transition count 697
Applied a total of 946 rules in 177 ms. Remains 406 /804 variables (removed 398) and now considering 697/1399 (removed 702) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 697 rows 406 cols
[2023-03-18 21:54:27] [INFO ] Computed 202 place invariants in 2 ms
[2023-03-18 21:54:27] [INFO ] [Real]Absence check using 202 positive place invariants in 26 ms returned sat
[2023-03-18 21:54:28] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:54:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 22 ms returned sat
[2023-03-18 21:54:28] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:54:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 21:54:28] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:54:28] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 21:54:28] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND p2 p3))), (F (NOT p2)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 381 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 24 reset in 835 ms.
Product exploration explored 100000 steps with 14 reset in 1018 ms.
Built C files in :
/tmp/ltsmin9508112548696266342
[2023-03-18 21:54:31] [INFO ] Computing symmetric may disable matrix : 1399 transitions.
[2023-03-18 21:54:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:54:31] [INFO ] Computing symmetric may enable matrix : 1399 transitions.
[2023-03-18 21:54:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:54:31] [INFO ] Computing Do-Not-Accords matrix : 1399 transitions.
[2023-03-18 21:54:31] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:54:31] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9508112548696266342
Running compilation step : cd /tmp/ltsmin9508112548696266342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9508112548696266342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9508112548696266342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1399/1399 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 806 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 805 transition count 1398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 804 transition count 1400
Applied a total of 4 rules in 56 ms. Remains 804 /806 variables (removed 2) and now considering 1400/1399 (removed -1) transitions.
// Phase 1: matrix 1400 rows 804 cols
[2023-03-18 21:54:34] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-18 21:54:35] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-18 21:54:35] [INFO ] Invariant cache hit.
[2023-03-18 21:54:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:54:36] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2023-03-18 21:54:36] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:54:36] [INFO ] Invariant cache hit.
[2023-03-18 21:54:36] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/806 places, 1400/1399 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2086 ms. Remains : 804/806 places, 1400/1399 transitions.
Built C files in :
/tmp/ltsmin10146717875869463438
[2023-03-18 21:54:36] [INFO ] Computing symmetric may disable matrix : 1400 transitions.
[2023-03-18 21:54:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:54:36] [INFO ] Computing symmetric may enable matrix : 1400 transitions.
[2023-03-18 21:54:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:54:36] [INFO ] Computing Do-Not-Accords matrix : 1400 transitions.
[2023-03-18 21:54:36] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:54:36] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10146717875869463438
Running compilation step : cd /tmp/ltsmin10146717875869463438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10146717875869463438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10146717875869463438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:54:40] [INFO ] Flatten gal took : 75 ms
[2023-03-18 21:54:40] [INFO ] Flatten gal took : 56 ms
[2023-03-18 21:54:40] [INFO ] Time to serialize gal into /tmp/LTL17492372333792004423.gal : 9 ms
[2023-03-18 21:54:40] [INFO ] Time to serialize properties into /tmp/LTL10595999294529346459.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17492372333792004423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7508879759426495052.hoa' '-atoms' '/tmp/LTL10595999294529346459.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10595999294529346459.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7508879759426495052.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t902, t904, t906, t908, t910, t912, t914, t916, t918, t920, t922, t925, t927, t929, t931,...2875
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:54:55] [INFO ] Flatten gal took : 62 ms
[2023-03-18 21:54:55] [INFO ] Flatten gal took : 50 ms
[2023-03-18 21:54:55] [INFO ] Time to serialize gal into /tmp/LTL14372430063165454344.gal : 9 ms
[2023-03-18 21:54:55] [INFO ] Time to serialize properties into /tmp/LTL2124377967031335989.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14372430063165454344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2124377967031335989.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((("(p648!=1)")U(("((p2788!=1)&&(p648!=1))")||(G("(p648!=1)"))))&&(F((G("((p1020==0)||(p2591==1))"))||(("((p1020==0)||(p2591==1))"...216
Formula 0 simplified : X(G(F!"((p1020==0)||(p2591==1))" & (!"((p1020==0)||(p2591==1))" | G(!"((p1020!=0)&&(p2591!=1))" | F!"(p2788!=1)"))) | (!"(p648!=1)" ...185
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t902, t904, t906, t908, t910, t912, t914, t916, t918, t920, t922, t925, t927, t929, t...2841
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:55:10] [INFO ] Flatten gal took : 69 ms
[2023-03-18 21:55:10] [INFO ] Applying decomposition
[2023-03-18 21:55:10] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14345146937242567503.txt' '-o' '/tmp/graph14345146937242567503.bin' '-w' '/tmp/graph14345146937242567503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14345146937242567503.bin' '-l' '-1' '-v' '-w' '/tmp/graph14345146937242567503.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:55:10] [INFO ] Decomposing Gal with order
[2023-03-18 21:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:55:10] [INFO ] Removed a total of 2764 redundant transitions.
[2023-03-18 21:55:10] [INFO ] Flatten gal took : 82 ms
[2023-03-18 21:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1522 labels/synchronizations in 30 ms.
[2023-03-18 21:55:10] [INFO ] Time to serialize gal into /tmp/LTL15140795223855780302.gal : 9 ms
[2023-03-18 21:55:10] [INFO ] Time to serialize properties into /tmp/LTL1320604810333315801.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15140795223855780302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1320604810333315801.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((("(i2.u45.p648!=1)")U(("((i10.u219.p2788!=1)&&(i2.u45.p648!=1))")||(G("(i2.u45.p648!=1)"))))&&(F((G("((i3.u74.p1020==0)||(i9.i0....318
Formula 0 simplified : X(G(F!"((i3.u74.p1020==0)||(i9.i0.i1.u203.p2591==1))" & (!"((i3.u74.p1020==0)||(i9.i0.i1.u203.p2591==1))" | G(!"((i3.u74.p1020!=0)&&...280
Reverse transition relation is NOT exact ! Due to transitions t48_t43_t45, t57_t49_t54, t102_t97_t99, t137_t132_t135, t146_t139_t143, t173_t168_t170, t182_...3960
Computing Next relation with stutter on 4.28324e+77 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
55 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.684624,39624,1,0,47824,150,4657,103199,162,354,48295
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-100B-LTLCardinality-13 finished in 110696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((F(p1)&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))))'
Found a Shortening insensitive property : ShieldRVt-PT-100B-LTLCardinality-09
Stuttering acceptance computed with spot in 414 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2), false]
Support contains 5 out of 3913 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3913/3913 places, 3913/3913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3912 transition count 2816
Reduce places removed 1096 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2193 place count 2816 transition count 2815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2194 place count 2815 transition count 2815
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 793 Pre rules applied. Total rules applied 2194 place count 2815 transition count 2022
Deduced a syphon composed of 793 places in 7 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 3780 place count 2022 transition count 2022
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 3787 place count 2015 transition count 2015
Iterating global reduction 3 with 7 rules applied. Total rules applied 3794 place count 2015 transition count 2015
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3794 place count 2015 transition count 2009
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 3806 place count 2009 transition count 2009
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 1 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 3 with 1800 rules applied. Total rules applied 5606 place count 1109 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5607 place count 1109 transition count 1108
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5609 place count 1108 transition count 1107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5811 place count 1007 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6013 place count 906 transition count 1306
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 6207 place count 809 transition count 1403
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6209 place count 807 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6210 place count 806 transition count 1401
Applied a total of 6210 rules in 783 ms. Remains 806 /3913 variables (removed 3107) and now considering 1401/3913 (removed 2512) transitions.
// Phase 1: matrix 1401 rows 806 cols
[2023-03-18 21:55:13] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-18 21:55:13] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-18 21:55:13] [INFO ] Invariant cache hit.
[2023-03-18 21:55:14] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2023-03-18 21:55:14] [INFO ] Invariant cache hit.
[2023-03-18 21:55:15] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 806/3913 places, 1401/3913 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2862 ms. Remains : 806/3913 places, 1401/3913 transitions.
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(AND p0 p2), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 7}]], initial=0, aps=[p0:(OR (EQ s761 1) (EQ s442 0) (EQ s380 1)), p1:(AND (EQ s82 0) (EQ s199 1)), p2:(OR (EQ s199 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 44 reset in 697 ms.
Product exploration explored 100000 steps with 40 reset in 860 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 959 ms. Reduced automaton from 9 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 166341 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 166341 steps, saw 104026 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :10
Running SMT prover for 1 properties.
[2023-03-18 21:55:22] [INFO ] Invariant cache hit.
[2023-03-18 21:55:22] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:55:22] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2023-03-18 21:55:23] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:55:23] [INFO ] After 611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-18 21:55:23] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 177 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1401/1401 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 806 transition count 1400
Applied a total of 1 rules in 32 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1401 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 806/806 places, 1400/1401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 149667 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149667 steps, saw 94208 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 806 cols
[2023-03-18 21:55:26] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:55:26] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:55:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2023-03-18 21:55:27] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:55:27] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-18 21:55:27] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 174 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 24 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 806/806 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 22 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-18 21:55:27] [INFO ] Invariant cache hit.
[2023-03-18 21:55:28] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-18 21:55:28] [INFO ] Invariant cache hit.
[2023-03-18 21:55:29] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2023-03-18 21:55:29] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 21:55:29] [INFO ] Invariant cache hit.
[2023-03-18 21:55:30] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2127 ms. Remains : 806/806 places, 1400/1400 transitions.
Graph (trivial) has 396 edges and 806 vertex of which 4 / 806 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 804 vertex of which 802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 800 vertex of which 4 / 800 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 798 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 796 vertex of which 6 / 796 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 793 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 790 vertex of which 8 / 790 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 786 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 782 vertex of which 8 / 782 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 778 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 774 vertex of which 8 / 774 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 770 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 766 vertex of which 6 / 766 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1329
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 375 edges and 760 vertex of which 6 / 760 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 16 rules applied. Total rules applied 108 place count 757 transition count 1317
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 373 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 15 rules applied. Total rules applied 123 place count 750 transition count 1306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 746 vertex of which 10 / 746 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 142 place count 741 transition count 1292
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 364 edges and 736 vertex of which 8 / 736 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 23 rules applied. Total rules applied 165 place count 732 transition count 1275
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 728 vertex of which 8 / 728 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 184 place count 724 transition count 1261
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 720 vertex of which 8 / 720 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 203 place count 716 transition count 1247
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 712 vertex of which 8 / 712 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 222 place count 708 transition count 1233
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 704 vertex of which 8 / 704 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 241 place count 700 transition count 1219
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 696 vertex of which 8 / 696 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 260 place count 692 transition count 1205
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 688 vertex of which 8 / 688 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 279 place count 684 transition count 1191
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 680 vertex of which 8 / 680 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 298 place count 676 transition count 1177
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 672 vertex of which 8 / 672 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 317 place count 668 transition count 1163
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 664 vertex of which 8 / 664 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 336 place count 660 transition count 1149
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 656 vertex of which 8 / 656 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 355 place count 652 transition count 1135
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 648 vertex of which 8 / 648 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 374 place count 644 transition count 1121
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 640 vertex of which 8 / 640 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 393 place count 636 transition count 1107
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 632 vertex of which 8 / 632 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 628 transition count 1093
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 624 vertex of which 8 / 624 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 620 transition count 1079
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 616 vertex of which 8 / 616 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 450 place count 612 transition count 1065
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 608 vertex of which 8 / 608 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 469 place count 604 transition count 1051
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 600 vertex of which 8 / 600 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 596 transition count 1037
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 592 vertex of which 8 / 592 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 588 transition count 1023
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 584 vertex of which 8 / 584 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 580 transition count 1009
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 576 vertex of which 8 / 576 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 572 transition count 995
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 568 vertex of which 8 / 568 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 564 transition count 981
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 276 edges and 560 vertex of which 8 / 560 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 583 place count 556 transition count 967
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 272 edges and 552 vertex of which 8 / 552 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 602 place count 548 transition count 953
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 268 edges and 544 vertex of which 8 / 544 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 621 place count 540 transition count 939
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 264 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 640 place count 532 transition count 925
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 260 edges and 528 vertex of which 8 / 528 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 659 place count 524 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 256 edges and 520 vertex of which 8 / 520 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 516 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 252 edges and 512 vertex of which 8 / 512 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 508 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 248 edges and 504 vertex of which 8 / 504 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 500 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 244 edges and 496 vertex of which 8 / 496 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 492 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 240 edges and 488 vertex of which 8 / 488 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 484 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 236 edges and 480 vertex of which 8 / 480 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 476 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 232 edges and 472 vertex of which 8 / 472 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 468 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 228 edges and 464 vertex of which 8 / 464 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 460 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 224 edges and 456 vertex of which 8 / 456 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 452 transition count 785
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 218 edges and 449 vertex of which 2 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 847 place count 448 transition count 772
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 851 place count 447 transition count 769
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 851 place count 447 transition count 767
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 47 with 5 rules applied. Total rules applied 856 place count 444 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 859 place count 442 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 861 place count 442 transition count 764
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 48 with 3 rules applied. Total rules applied 864 place count 440 transition count 763
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 868 place count 440 transition count 759
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 49 with 2 rules applied. Total rules applied 870 place count 440 transition count 757
Applied a total of 870 rules in 189 ms. Remains 440 /806 variables (removed 366) and now considering 757/1400 (removed 643) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 440 cols
[2023-03-18 21:55:30] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-18 21:55:30] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:55:30] [INFO ] [Nat]Absence check using 218 positive place invariants in 21 ms returned sat
[2023-03-18 21:55:30] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:55:30] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 21:55:30] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1029 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 806/806 places, 1401/1401 transitions.
Applied a total of 0 rules in 22 ms. Remains 806 /806 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
// Phase 1: matrix 1401 rows 806 cols
[2023-03-18 21:55:32] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:55:32] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-18 21:55:32] [INFO ] Invariant cache hit.
[2023-03-18 21:55:33] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2023-03-18 21:55:33] [INFO ] Invariant cache hit.
[2023-03-18 21:55:34] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2067 ms. Remains : 806/806 places, 1401/1401 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 708 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 186353 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 186353 steps, saw 117344 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :10
Running SMT prover for 1 properties.
[2023-03-18 21:55:39] [INFO ] Invariant cache hit.
[2023-03-18 21:55:39] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:55:39] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2023-03-18 21:55:40] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:55:40] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-18 21:55:40] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 175 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1401/1401 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 806 transition count 1400
Applied a total of 1 rules in 32 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1401 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 806/806 places, 1400/1401 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199277 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199277 steps, saw 126867 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 806 cols
[2023-03-18 21:55:43] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:55:43] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:55:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2023-03-18 21:55:44] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:55:44] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-18 21:55:44] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 135 ms.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 29 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 806/806 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Applied a total of 0 rules in 28 ms. Remains 806 /806 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-18 21:55:44] [INFO ] Invariant cache hit.
[2023-03-18 21:55:45] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-18 21:55:45] [INFO ] Invariant cache hit.
[2023-03-18 21:55:46] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2023-03-18 21:55:46] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 21:55:46] [INFO ] Invariant cache hit.
[2023-03-18 21:55:47] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2155 ms. Remains : 806/806 places, 1400/1400 transitions.
Graph (trivial) has 396 edges and 806 vertex of which 4 / 806 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2790 edges and 804 vertex of which 802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 393 edges and 800 vertex of which 4 / 800 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 798 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 392 edges and 796 vertex of which 6 / 796 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 793 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 390 edges and 790 vertex of which 8 / 790 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 786 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 386 edges and 782 vertex of which 8 / 782 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 778 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 382 edges and 774 vertex of which 8 / 774 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 770 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 378 edges and 766 vertex of which 6 / 766 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 763 transition count 1329
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 375 edges and 760 vertex of which 6 / 760 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 16 rules applied. Total rules applied 108 place count 757 transition count 1317
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 373 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 15 rules applied. Total rules applied 123 place count 750 transition count 1306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 746 vertex of which 10 / 746 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 142 place count 741 transition count 1292
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 364 edges and 736 vertex of which 8 / 736 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 23 rules applied. Total rules applied 165 place count 732 transition count 1275
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 360 edges and 728 vertex of which 8 / 728 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 184 place count 724 transition count 1261
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 356 edges and 720 vertex of which 8 / 720 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 203 place count 716 transition count 1247
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 352 edges and 712 vertex of which 8 / 712 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 222 place count 708 transition count 1233
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 348 edges and 704 vertex of which 8 / 704 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 241 place count 700 transition count 1219
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 344 edges and 696 vertex of which 8 / 696 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 260 place count 692 transition count 1205
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 340 edges and 688 vertex of which 8 / 688 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 279 place count 684 transition count 1191
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 336 edges and 680 vertex of which 8 / 680 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 298 place count 676 transition count 1177
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 332 edges and 672 vertex of which 8 / 672 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 317 place count 668 transition count 1163
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 328 edges and 664 vertex of which 8 / 664 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 336 place count 660 transition count 1149
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 324 edges and 656 vertex of which 8 / 656 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 355 place count 652 transition count 1135
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 320 edges and 648 vertex of which 8 / 648 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 374 place count 644 transition count 1121
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 316 edges and 640 vertex of which 8 / 640 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 393 place count 636 transition count 1107
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 312 edges and 632 vertex of which 8 / 632 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 628 transition count 1093
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 308 edges and 624 vertex of which 8 / 624 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 620 transition count 1079
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 304 edges and 616 vertex of which 8 / 616 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 450 place count 612 transition count 1065
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 300 edges and 608 vertex of which 8 / 608 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 469 place count 604 transition count 1051
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 296 edges and 600 vertex of which 8 / 600 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 596 transition count 1037
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 292 edges and 592 vertex of which 8 / 592 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 588 transition count 1023
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 288 edges and 584 vertex of which 8 / 584 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 580 transition count 1009
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 284 edges and 576 vertex of which 8 / 576 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 572 transition count 995
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 280 edges and 568 vertex of which 8 / 568 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 564 transition count 981
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 276 edges and 560 vertex of which 8 / 560 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 583 place count 556 transition count 967
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 272 edges and 552 vertex of which 8 / 552 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 602 place count 548 transition count 953
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 268 edges and 544 vertex of which 8 / 544 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 621 place count 540 transition count 939
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 264 edges and 536 vertex of which 8 / 536 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 640 place count 532 transition count 925
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 260 edges and 528 vertex of which 8 / 528 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 659 place count 524 transition count 911
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 256 edges and 520 vertex of which 8 / 520 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 678 place count 516 transition count 897
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 252 edges and 512 vertex of which 8 / 512 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 697 place count 508 transition count 883
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 248 edges and 504 vertex of which 8 / 504 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 716 place count 500 transition count 869
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 244 edges and 496 vertex of which 8 / 496 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 735 place count 492 transition count 855
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 240 edges and 488 vertex of which 8 / 488 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 754 place count 484 transition count 841
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 236 edges and 480 vertex of which 8 / 480 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 773 place count 476 transition count 827
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 232 edges and 472 vertex of which 8 / 472 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 792 place count 468 transition count 813
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 228 edges and 464 vertex of which 8 / 464 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 811 place count 460 transition count 799
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 224 edges and 456 vertex of which 8 / 456 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 830 place count 452 transition count 785
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 218 edges and 449 vertex of which 2 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 45 with 17 rules applied. Total rules applied 847 place count 448 transition count 772
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 851 place count 447 transition count 769
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 851 place count 447 transition count 767
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 47 with 5 rules applied. Total rules applied 856 place count 444 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 859 place count 442 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 47 with 2 rules applied. Total rules applied 861 place count 442 transition count 764
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 48 with 3 rules applied. Total rules applied 864 place count 440 transition count 763
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 48 with 4 rules applied. Total rules applied 868 place count 440 transition count 759
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 49 with 2 rules applied. Total rules applied 870 place count 440 transition count 757
Applied a total of 870 rules in 153 ms. Remains 440 /806 variables (removed 366) and now considering 757/1400 (removed 643) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 440 cols
[2023-03-18 21:55:47] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-18 21:55:47] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:55:47] [INFO ] [Nat]Absence check using 218 positive place invariants in 29 ms returned sat
[2023-03-18 21:55:47] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:55:47] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 21:55:47] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p2)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1013 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Product exploration explored 100000 steps with 38 reset in 937 ms.
Product exploration explored 100000 steps with 52 reset in 830 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), p2, false, (AND (NOT p1) (NOT p0)), false]
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1401/1401 transitions.
Applied a total of 0 rules in 35 ms. Remains 806 /806 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
[2023-03-18 21:55:51] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1401 rows 806 cols
[2023-03-18 21:55:51] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:55:52] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 806/806 places, 1401/1401 transitions.
Built C files in :
/tmp/ltsmin7685928567140934935
[2023-03-18 21:55:52] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7685928567140934935
Running compilation step : cd /tmp/ltsmin7685928567140934935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2964 ms.
Running link step : cd /tmp/ltsmin7685928567140934935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin7685928567140934935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17959257161450515940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 806/806 places, 1401/1401 transitions.
Applied a total of 0 rules in 24 ms. Remains 806 /806 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
[2023-03-18 21:56:07] [INFO ] Invariant cache hit.
[2023-03-18 21:56:08] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-18 21:56:08] [INFO ] Invariant cache hit.
[2023-03-18 21:56:09] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
[2023-03-18 21:56:09] [INFO ] Invariant cache hit.
[2023-03-18 21:56:09] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1975 ms. Remains : 806/806 places, 1401/1401 transitions.
Built C files in :
/tmp/ltsmin10803340344647292042
[2023-03-18 21:56:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10803340344647292042
Running compilation step : cd /tmp/ltsmin10803340344647292042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2600 ms.
Running link step : cd /tmp/ltsmin10803340344647292042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin10803340344647292042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1201347405021952088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:56:24] [INFO ] Flatten gal took : 50 ms
[2023-03-18 21:56:24] [INFO ] Flatten gal took : 43 ms
[2023-03-18 21:56:24] [INFO ] Time to serialize gal into /tmp/LTL6342222116466795098.gal : 7 ms
[2023-03-18 21:56:24] [INFO ] Time to serialize properties into /tmp/LTL17127228139328027047.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6342222116466795098.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5835785109055978147.hoa' '-atoms' '/tmp/LTL17127228139328027047.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17127228139328027047.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5835785109055978147.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t5.t93, t5.t94, t1.t488, t1.t489, Intersection with reachable at each step enabled. (des...201
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:56:40] [INFO ] Flatten gal took : 57 ms
[2023-03-18 21:56:40] [INFO ] Flatten gal took : 53 ms
[2023-03-18 21:56:40] [INFO ] Time to serialize gal into /tmp/LTL17240081391170124933.gal : 8 ms
[2023-03-18 21:56:40] [INFO ] Time to serialize properties into /tmp/LTL9430936151364935445.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17240081391170124933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9430936151364935445.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((p4727==1)||(p2776==0))||(p2399==1))"))||(X(F((F("((p590==0)&&(p1300==1))"))&&((X(!("((p1300==0)||(p590==1))")))U((X(G(!("((p...256
Formula 0 simplified : F!"(((p4727==1)||(p2776==0))||(p2399==1))" & XG(G!"((p590==0)&&(p1300==1))" | (X"((p1300==0)||(p590==1))" R (XF"((p1300==0)||(p590==...221
Reverse transition relation is NOT exact ! Due to transitions t4, t5.t93, t5.t94, t1.t488, t1.t489, Intersection with reachable at each step enabled. (des...201
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:56:55] [INFO ] Flatten gal took : 77 ms
[2023-03-18 21:56:55] [INFO ] Applying decomposition
[2023-03-18 21:56:55] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18272442377953327430.txt' '-o' '/tmp/graph18272442377953327430.bin' '-w' '/tmp/graph18272442377953327430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18272442377953327430.bin' '-l' '-1' '-v' '-w' '/tmp/graph18272442377953327430.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:56:55] [INFO ] Decomposing Gal with order
[2023-03-18 21:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:56:55] [INFO ] Removed a total of 2767 redundant transitions.
[2023-03-18 21:56:55] [INFO ] Flatten gal took : 95 ms
[2023-03-18 21:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1462 labels/synchronizations in 21 ms.
[2023-03-18 21:56:55] [INFO ] Time to serialize gal into /tmp/LTL10699450113908748199.gal : 7 ms
[2023-03-18 21:56:55] [INFO ] Time to serialize properties into /tmp/LTL6318773967983256856.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10699450113908748199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6318773967983256856.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(((i15.u377.p4727==1)||(i10.i0.i1.u218.p2776==0))||(i8.i1.i1.u188.p2399==1))"))||(X(F((F("((i1.u40.p590==0)&&(i4.u98.p1300==1))...364
Formula 0 simplified : F!"(((i15.u377.p4727==1)||(i10.i0.i1.u218.p2776==0))||(i8.i1.i1.u188.p2399==1))" & XG(G!"((i1.u40.p590==0)&&(i4.u98.p1300==1))" | (X...329
Reverse transition relation is NOT exact ! Due to transitions i1.u40.t5.t93, i1.u40.t5.t94, i4.u98.t4, i10.i0.i1.u218.t1.t488, i10.i0.i1.u218.t1.t489, Int...250
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17965842593262277696
[2023-03-18 21:57:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17965842593262277696
Running compilation step : cd /tmp/ltsmin17965842593262277696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2932 ms.
Running link step : cd /tmp/ltsmin17965842593262277696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17965842593262277696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&(X(!(LTLAPp2==true)) U (X([](!(LTLAPp2==true)))||(!(LTLAPp2==true)&&X(!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-100B-LTLCardinality-09 finished in 134156 ms.
[2023-03-18 21:57:25] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2287801557009026843
[2023-03-18 21:57:26] [INFO ] Too many transitions (3913) to apply POR reductions. Disabling POR matrices.
[2023-03-18 21:57:26] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2287801557009026843
[2023-03-18 21:57:26] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin2287801557009026843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 21:57:26] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph455038373783158747.txt' '-o' '/tmp/graph455038373783158747.bin' '-w' '/tmp/graph455038373783158747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph455038373783158747.bin' '-l' '-1' '-v' '-w' '/tmp/graph455038373783158747.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:57:26] [INFO ] Decomposing Gal with order
[2023-03-18 21:57:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:57:26] [INFO ] Removed a total of 989 redundant transitions.
[2023-03-18 21:57:26] [INFO ] Flatten gal took : 120 ms
[2023-03-18 21:57:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-18 21:57:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality13492263995922662387.gal : 33 ms
[2023-03-18 21:57:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality4835898238533190607.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13492263995922662387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4835898238533190607.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(((i51.i1.i2.u1462.p4727==1)||(i33.u865.p2776==0))||(i30.i1.i4.u748.p2399==1))"))||(X(F((F("((i14.i1.i4.u192.p590==0)&&(i7.u410...411
Formula 0 simplified : F!"(((i51.i1.i2.u1462.p4727==1)||(i33.u865.p2776==0))||(i30.i1.i4.u748.p2399==1))" & XG(G!"((i14.i1.i4.u192.p590==0)&&(i7.u410.p1300...376
Compilation finished in 10805 ms.
Running link step : cd /tmp/ltsmin2287801557009026843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin2287801557009026843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&(X(!(LTLAPp2==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 22:21:15] [INFO ] Applying decomposition
[2023-03-18 22:21:15] [INFO ] Flatten gal took : 194 ms
[2023-03-18 22:21:16] [INFO ] Decomposing Gal with order
[2023-03-18 22:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:21:17] [INFO ] Removed a total of 295 redundant transitions.
[2023-03-18 22:21:18] [INFO ] Flatten gal took : 220 ms
[2023-03-18 22:21:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2023-03-18 22:21:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality10371821042447378770.gal : 43 ms
[2023-03-18 22:21:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality1024597996707473654.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10371821042447378770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1024597996707473654.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("(((i0.i0.i0.i0.i0.i1.i0.i0.u763.p4727==1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...3183
Formula 0 simplified : F!"(((i0.i0.i0.i0.i0.i1.i0.i0.u763.p4727==1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...3148
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.111: LTL layer: formula: ([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&(X(!(LTLAPp2==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))
pins2lts-mc-linux64( 3/ 8), 0.121: "([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&(X(!(LTLAPp2==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.136: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.152: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.165: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.166: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.179: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.882: DFS-FIFO for weak LTL, using special progress label 3917
pins2lts-mc-linux64( 0/ 8), 2.883: There are 3918 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.883: State length is 3914, there are 3954 groups
pins2lts-mc-linux64( 0/ 8), 2.883: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.883: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.883: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 2.883: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 3.392: ~1 levels ~960 states ~4920 transitions
pins2lts-mc-linux64( 1/ 8), 3.919: ~1 levels ~1920 states ~14016 transitions
pins2lts-mc-linux64( 1/ 8), 4.881: ~1 levels ~3840 states ~30184 transitions
pins2lts-mc-linux64( 0/ 8), 6.774: ~1 levels ~7680 states ~61968 transitions
pins2lts-mc-linux64( 5/ 8), 10.600: ~1 levels ~15360 states ~132200 transitions
pins2lts-mc-linux64( 5/ 8), 17.850: ~1 levels ~30720 states ~274920 transitions
pins2lts-mc-linux64( 1/ 8), 32.584: ~1 levels ~61440 states ~599464 transitions
pins2lts-mc-linux64( 1/ 8), 62.059: ~1 levels ~122880 states ~1262760 transitions
pins2lts-mc-linux64( 1/ 8), 121.339: ~1 levels ~245760 states ~2676648 transitions
pins2lts-mc-linux64( 1/ 8), 235.640: ~1 levels ~491520 states ~5531280 transitions
pins2lts-mc-linux64( 1/ 8), 452.095: ~1 levels ~983040 states ~11410144 transitions
pins2lts-mc-linux64( 1/ 8), 887.207: ~1 levels ~1966080 states ~23509896 transitions
pins2lts-mc-linux64( 1/ 8), 1786.095: ~1 levels ~3932160 states ~49106432 transitions
pins2lts-mc-linux64( 3/ 8), 2783.448: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2783.698:
pins2lts-mc-linux64( 0/ 8), 2783.698: mean standard work distribution: 5.6% (states) 6.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 2783.698:
pins2lts-mc-linux64( 0/ 8), 2783.698: Explored 5857623 states 72152045 transitions, fanout: 12.318
pins2lts-mc-linux64( 0/ 8), 2783.698: Total exploration time 2780.810 sec (2780.580 sec minimum, 2780.664 sec on average)
pins2lts-mc-linux64( 0/ 8), 2783.698: States per second: 2106, Transitions per second: 25946
pins2lts-mc-linux64( 0/ 8), 2783.698:
pins2lts-mc-linux64( 0/ 8), 2783.698: Progress states detected: 13899848
pins2lts-mc-linux64( 0/ 8), 2783.698: Redundant explorations: -57.8586
pins2lts-mc-linux64( 0/ 8), 2783.698:
pins2lts-mc-linux64( 0/ 8), 2783.698: Queue width: 8B, total height: 14175165, memory: 108.15MB
pins2lts-mc-linux64( 0/ 8), 2783.698: Tree memory: 362.0MB, 27.3 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 2783.698: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2783.698: Stored 4136 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2783.698: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2783.698: Est. total memory use: 470.2MB (~1132.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2287801557009026843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&(X(!(LTLAPp2==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2287801557009026843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(<>((<>((LTLAPp1==true))&&(X(!(LTLAPp2==true)) U ((!(LTLAPp2==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 22:45:07] [INFO ] Flatten gal took : 95 ms
[2023-03-18 22:45:07] [INFO ] Input system was already deterministic with 3913 transitions.
[2023-03-18 22:45:07] [INFO ] Transformed 3913 places.
[2023-03-18 22:45:07] [INFO ] Transformed 3913 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 22:45:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality8390424407513970578.gal : 17 ms
[2023-03-18 22:45:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality9362091272493286511.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8390424407513970578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9362091272493286511.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(((p4727==1)||(p2776==0))||(p2399==1))"))||(X(F((F("((p590==0)&&(p1300==1))"))&&((X(!("((p1300==0)||(p590==1))")))U(((!("((p130...256
Formula 0 simplified : F!"(((p4727==1)||(p2776==0))||(p2399==1))" & XG(G!"((p590==0)&&(p1300==1))" | (X"((p1300==0)||(p590==1))" R (XF"((p1300==0)||(p590==...221
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11130520 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16026876 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-100B, 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 r421-tajo-167905975100347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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