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-167905975100348.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975100348
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679176085189

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 21:48:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:48:08] [INFO ] Load time of PNML (sax parser for PT used): 272 ms
[2023-03-18 21:48:08] [INFO ] Transformed 5003 places.
[2023-03-18 21:48:08] [INFO ] Transformed 5003 transitions.
[2023-03-18 21:48:08] [INFO ] Found NUPN structural information;
[2023-03-18 21:48:08] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-100B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1084 places :
Symmetric choice reduction at 0 with 1084 rule applications. Total rules 1084 place count 3919 transition count 3919
Iterating global reduction 0 with 1084 rules applied. Total rules applied 2168 place count 3919 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2169 place count 3918 transition count 3918
Iterating global reduction 0 with 1 rules applied. Total rules applied 2170 place count 3918 transition count 3918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2171 place count 3917 transition count 3917
Iterating global reduction 0 with 1 rules applied. Total rules applied 2172 place count 3917 transition count 3917
Applied a total of 2172 rules in 2425 ms. Remains 3917 /5003 variables (removed 1086) and now considering 3917/5003 (removed 1086) transitions.
// Phase 1: matrix 3917 rows 3917 cols
[2023-03-18 21:48:11] [INFO ] Computed 401 place invariants in 54 ms
[2023-03-18 21:48:12] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2023-03-18 21:48:12] [INFO ] Invariant cache hit.
[2023-03-18 21:48:13] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2023-03-18 21:48:13] [INFO ] Invariant cache hit.
[2023-03-18 21:48:15] [INFO ] Dead Transitions using invariants and state equation in 2373 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3917/5003 places, 3917/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7216 ms. Remains : 3917/5003 places, 3917/5003 transitions.
Support contains 38 out of 3917 places after structural reductions.
[2023-03-18 21:48:16] [INFO ] Flatten gal took : 201 ms
[2023-03-18 21:48:16] [INFO ] Flatten gal took : 122 ms
[2023-03-18 21:48:16] [INFO ] Input system was already deterministic with 3917 transitions.
Support contains 36 out of 3917 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=14 ) properties (out of 29) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-18 21:48:17] [INFO ] Invariant cache hit.
[2023-03-18 21:48:19] [INFO ] After 1516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-18 21:48:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 261 ms returned sat
[2023-03-18 21:48:29] [INFO ] After 7306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-18 21:48:31] [INFO ] Deduced a trap composed of 20 places in 1167 ms of which 5 ms to minimize.
[2023-03-18 21:48:33] [INFO ] Deduced a trap composed of 22 places in 1310 ms of which 2 ms to minimize.
[2023-03-18 21:48:35] [INFO ] Deduced a trap composed of 29 places in 1288 ms of which 2 ms to minimize.
[2023-03-18 21:48:36] [INFO ] Deduced a trap composed of 41 places in 1443 ms of which 3 ms to minimize.
[2023-03-18 21:48:38] [INFO ] Deduced a trap composed of 22 places in 1302 ms of which 3 ms to minimize.
[2023-03-18 21:48:39] [INFO ] Deduced a trap composed of 23 places in 1045 ms of which 2 ms to minimize.
[2023-03-18 21:48:40] [INFO ] Deduced a trap composed of 32 places in 985 ms of which 3 ms to minimize.
[2023-03-18 21:48:41] [INFO ] Deduced a trap composed of 33 places in 1114 ms of which 6 ms to minimize.
[2023-03-18 21:48:42] [INFO ] Deduced a trap composed of 39 places in 854 ms of which 1 ms to minimize.
[2023-03-18 21:48:43] [INFO ] Deduced a trap composed of 38 places in 951 ms of which 2 ms to minimize.
[2023-03-18 21:48:44] [INFO ] Deduced a trap composed of 23 places in 1006 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:48:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:48:44] [INFO ] After 25653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 3437 ms.
Support contains 27 out of 3917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Drop transitions removed 1078 transitions
Trivial Post-agglo rules discarded 1078 transitions
Performed 1078 trivial Post agglomeration. Transition count delta: 1078
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 3917 transition count 2839
Reduce places removed 1078 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1082 rules applied. Total rules applied 2160 place count 2839 transition count 2835
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2164 place count 2835 transition count 2835
Performed 787 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 787 Pre rules applied. Total rules applied 2164 place count 2835 transition count 2048
Deduced a syphon composed of 787 places in 7 ms
Reduce places removed 787 places and 0 transitions.
Iterating global reduction 3 with 1574 rules applied. Total rules applied 3738 place count 2048 transition count 2048
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3743 place count 2043 transition count 2043
Iterating global reduction 3 with 5 rules applied. Total rules applied 3748 place count 2043 transition count 2043
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3748 place count 2043 transition count 2040
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3754 place count 2040 transition count 2040
Performed 908 Post agglomeration using F-continuation condition.Transition count delta: 908
Deduced a syphon composed of 908 places in 1 ms
Reduce places removed 908 places and 0 transitions.
Iterating global reduction 3 with 1816 rules applied. Total rules applied 5570 place count 1132 transition count 1132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5571 place count 1132 transition count 1131
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5573 place count 1131 transition count 1130
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5775 place count 1030 transition count 1224
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
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 5977 place count 929 transition count 1321
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 6151 place count 842 transition count 1404
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6152 place count 842 transition count 1403
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 6154 place count 842 transition count 1401
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 6156 place count 840 transition count 1401
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 6158 place count 840 transition count 1399
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6159 place count 840 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6160 place count 839 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6161 place count 838 transition count 1398
Applied a total of 6161 rules in 982 ms. Remains 838 /3917 variables (removed 3079) and now considering 1398/3917 (removed 2519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 838/3917 places, 1398/3917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 85897 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85897 steps, saw 61425 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 1398 rows 838 cols
[2023-03-18 21:48:52] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:48:53] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-18 21:48:53] [INFO ] [Nat]Absence check using 400 positive place invariants in 82 ms returned sat
[2023-03-18 21:48:54] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-18 21:48:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-18 21:48:55] [INFO ] After 698ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-18 21:48:56] [INFO ] After 1929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-18 21:48:57] [INFO ] After 4302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 1418 ms.
Support contains 25 out of 838 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 838/838 places, 1398/1398 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 838 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 837 transition count 1397
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 835 transition count 1399
Applied a total of 6 rules in 47 ms. Remains 835 /838 variables (removed 3) and now considering 1399/1398 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 835/838 places, 1399/1398 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 88960 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88960 steps, saw 63803 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 1399 rows 835 cols
[2023-03-18 21:49:02] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:49:02] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-18 21:49:02] [INFO ] [Nat]Absence check using 400 positive place invariants in 47 ms returned sat
[2023-03-18 21:49:04] [INFO ] After 1102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-18 21:49:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-18 21:49:04] [INFO ] After 761ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-18 21:49:06] [INFO ] After 1979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 546 ms.
[2023-03-18 21:49:06] [INFO ] After 4071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1559 ms.
Support contains 25 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 1399/1399 transitions.
Applied a total of 0 rules in 24 ms. Remains 835 /835 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 835/835 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 1399/1399 transitions.
Applied a total of 0 rules in 23 ms. Remains 835 /835 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2023-03-18 21:49:08] [INFO ] Invariant cache hit.
[2023-03-18 21:49:08] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-18 21:49:08] [INFO ] Invariant cache hit.
[2023-03-18 21:49:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-18 21:49:09] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2023-03-18 21:49:09] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-18 21:49:09] [INFO ] Invariant cache hit.
[2023-03-18 21:49:10] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2313 ms. Remains : 835/835 places, 1399/1399 transitions.
Graph (trivial) has 373 edges and 835 vertex of which 4 / 835 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 2839 edges and 833 vertex of which 831 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 370 edges and 829 vertex of which 4 / 829 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 827 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 369 edges and 825 vertex of which 6 / 825 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 822 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 367 edges and 819 vertex of which 8 / 819 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 815 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 363 edges and 811 vertex of which 8 / 811 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 807 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 359 edges and 803 vertex of which 8 / 803 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 799 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 355 edges and 795 vertex of which 8 / 795 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 791 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 351 edges and 787 vertex of which 8 / 787 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 783 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 347 edges and 779 vertex of which 8 / 779 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 775 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 343 edges and 771 vertex of which 8 / 771 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 767 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 339 edges and 763 vertex of which 8 / 763 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 759 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 335 edges and 755 vertex of which 8 / 755 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 751 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 331 edges and 747 vertex of which 8 / 747 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 743 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 327 edges and 739 vertex of which 6 / 739 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 736 transition count 1230
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 324 edges and 733 vertex of which 6 / 733 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 239 place count 730 transition count 1220
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 321 edges and 727 vertex of which 6 / 727 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 16 rules applied. Total rules applied 255 place count 724 transition count 1208
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 319 edges and 721 vertex of which 8 / 721 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 270 place count 717 transition count 1197
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 316 edges and 713 vertex of which 10 / 713 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 16 with 20 rules applied. Total rules applied 290 place count 708 transition count 1182
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 310 edges and 703 vertex of which 8 / 703 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 24 rules applied. Total rules applied 314 place count 699 transition count 1164
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 695 vertex of which 8 / 695 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 333 place count 691 transition count 1150
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 687 vertex of which 8 / 687 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 352 place count 683 transition count 1136
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 679 vertex of which 8 / 679 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 371 place count 675 transition count 1122
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 671 vertex of which 8 / 671 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 390 place count 667 transition count 1108
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 663 vertex of which 8 / 663 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 409 place count 659 transition count 1094
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 655 vertex of which 8 / 655 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 428 place count 651 transition count 1080
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 647 vertex of which 8 / 647 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 447 place count 643 transition count 1066
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 639 vertex of which 8 / 639 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 466 place count 635 transition count 1052
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 631 vertex of which 6 / 631 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 485 place count 628 transition count 1038
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 270 edges and 625 vertex of which 4 / 625 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 14 rules applied. Total rules applied 499 place count 623 transition count 1028
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 267 edges and 621 vertex of which 2 / 621 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 28 with 9 rules applied. Total rules applied 508 place count 620 transition count 1022
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 29 with 5 rules applied. Total rules applied 513 place count 619 transition count 1018
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 2 Pre rules applied. Total rules applied 513 place count 619 transition count 1016
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 30 with 5 rules applied. Total rules applied 518 place count 616 transition count 1016
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 30 with 5 rules applied. Total rules applied 523 place count 613 transition count 1014
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 262 edges and 613 vertex of which 2 / 613 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 30 with 5 rules applied. Total rules applied 528 place count 612 transition count 1010
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 530 place count 612 transition count 1008
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 32 with 8 rules applied. Total rules applied 538 place count 612 transition count 1000
Applied a total of 538 rules in 285 ms. Remains 612 /835 variables (removed 223) and now considering 1000/1399 (removed 399) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 1000 rows 612 cols
[2023-03-18 21:49:10] [INFO ] Computed 290 place invariants in 2 ms
[2023-03-18 21:49:11] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-18 21:49:11] [INFO ] [Nat]Absence check using 290 positive place invariants in 30 ms returned sat
[2023-03-18 21:49:12] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-18 21:49:12] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 360 ms.
[2023-03-18 21:49:13] [INFO ] After 1887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Computed a total of 1199 stabilizing places and 1199 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((p0&&X(G((p1||X(p2)))))))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 782 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:49:14] [INFO ] Computed 401 place invariants in 46 ms
[2023-03-18 21:49:15] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2023-03-18 21:49:15] [INFO ] Invariant cache hit.
[2023-03-18 21:49:19] [INFO ] Implicit Places using invariants and state equation in 3575 ms returned []
Implicit Place search using SMT with State Equation took 4740 ms to find 0 implicit places.
[2023-03-18 21:49:19] [INFO ] Invariant cache hit.
[2023-03-18 21:49:21] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8033 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s830 0), p2:(EQ s3571 0), p1:(EQ s3216 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 799 ms.
Product exploration explored 100000 steps with 3 reset in 1081 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 p2 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:49:24] [INFO ] Invariant cache hit.
[2023-03-18 21:49:25] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:49:25] [INFO ] [Nat]Absence check using 401 positive place invariants in 230 ms returned sat
[2023-03-18 21:49:28] [INFO ] After 2316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:49:29] [INFO ] Deduced a trap composed of 30 places in 1102 ms of which 2 ms to minimize.
[2023-03-18 21:49:30] [INFO ] Deduced a trap composed of 22 places in 1021 ms of which 2 ms to minimize.
[2023-03-18 21:49:31] [INFO ] Deduced a trap composed of 23 places in 1073 ms of which 3 ms to minimize.
[2023-03-18 21:49:32] [INFO ] Deduced a trap composed of 39 places in 986 ms of which 2 ms to minimize.
[2023-03-18 21:49:33] [INFO ] Deduced a trap composed of 26 places in 1040 ms of which 2 ms to minimize.
[2023-03-18 21:49:35] [INFO ] Deduced a trap composed of 37 places in 993 ms of which 1 ms to minimize.
[2023-03-18 21:49:36] [INFO ] Deduced a trap composed of 30 places in 917 ms of which 2 ms to minimize.
[2023-03-18 21:49:37] [INFO ] Deduced a trap composed of 22 places in 845 ms of which 14 ms to minimize.
[2023-03-18 21:49:38] [INFO ] Deduced a trap composed of 21 places in 840 ms of which 2 ms to minimize.
[2023-03-18 21:49:39] [INFO ] Deduced a trap composed of 32 places in 823 ms of which 2 ms to minimize.
[2023-03-18 21:49:40] [INFO ] Deduced a trap composed of 33 places in 869 ms of which 2 ms to minimize.
[2023-03-18 21:49:41] [INFO ] Deduced a trap composed of 28 places in 768 ms of which 2 ms to minimize.
[2023-03-18 21:49:41] [INFO ] Deduced a trap composed of 25 places in 718 ms of which 2 ms to minimize.
[2023-03-18 21:49:42] [INFO ] Deduced a trap composed of 47 places in 797 ms of which 1 ms to minimize.
[2023-03-18 21:49:43] [INFO ] Deduced a trap composed of 36 places in 1006 ms of which 2 ms to minimize.
[2023-03-18 21:49:45] [INFO ] Deduced a trap composed of 31 places in 1026 ms of which 2 ms to minimize.
[2023-03-18 21:49:46] [INFO ] Deduced a trap composed of 38 places in 863 ms of which 1 ms to minimize.
[2023-03-18 21:49:47] [INFO ] Deduced a trap composed of 25 places in 975 ms of which 2 ms to minimize.
[2023-03-18 21:49:48] [INFO ] Deduced a trap composed of 39 places in 920 ms of which 2 ms to minimize.
[2023-03-18 21:49:49] [INFO ] Deduced a trap composed of 51 places in 851 ms of which 4 ms to minimize.
[2023-03-18 21:49:50] [INFO ] Deduced a trap composed of 35 places in 953 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:49:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:49:50] [INFO ] After 25200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 77 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 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 3902 transition count 2807
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 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 5 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
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 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 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 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
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 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 754 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 755 ms. Remains : 804/3902 places, 1394/3902 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 176 ms. (steps per millisecond=56 ) 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 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Finished probabilistic random walk after 88314 steps, run visited all 2 properties in 1649 ms. (steps per millisecond=53 )
Probabilistic random walk after 88314 steps, saw 56621 distinct states, run finished after 1649 ms. (steps per millisecond=53 ) properties seen :2
Knowledge obtained : [(AND p0 p2 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 4 factoid took 257 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
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 LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 497 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
[2023-03-18 21:49:54] [INFO ] Invariant cache hit.
[2023-03-18 21:49:55] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-18 21:49:55] [INFO ] Invariant cache hit.
[2023-03-18 21:49:55] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2023-03-18 21:49:55] [INFO ] Invariant cache hit.
[2023-03-18 21:49:58] [INFO ] Dead Transitions using invariants and state equation in 2323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4544 ms. Remains : 3902/3902 places, 3902/3902 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 p2 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:49:58] [INFO ] Invariant cache hit.
[2023-03-18 21:49:59] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:50:00] [INFO ] [Nat]Absence check using 401 positive place invariants in 261 ms returned sat
[2023-03-18 21:50:02] [INFO ] After 2514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:50:04] [INFO ] Deduced a trap composed of 30 places in 1093 ms of which 1 ms to minimize.
[2023-03-18 21:50:05] [INFO ] Deduced a trap composed of 22 places in 1009 ms of which 2 ms to minimize.
[2023-03-18 21:50:06] [INFO ] Deduced a trap composed of 23 places in 828 ms of which 2 ms to minimize.
[2023-03-18 21:50:07] [INFO ] Deduced a trap composed of 39 places in 956 ms of which 2 ms to minimize.
[2023-03-18 21:50:08] [INFO ] Deduced a trap composed of 26 places in 1013 ms of which 2 ms to minimize.
[2023-03-18 21:50:09] [INFO ] Deduced a trap composed of 37 places in 1023 ms of which 2 ms to minimize.
[2023-03-18 21:50:10] [INFO ] Deduced a trap composed of 30 places in 1011 ms of which 2 ms to minimize.
[2023-03-18 21:50:11] [INFO ] Deduced a trap composed of 22 places in 838 ms of which 1 ms to minimize.
[2023-03-18 21:50:12] [INFO ] Deduced a trap composed of 21 places in 993 ms of which 1 ms to minimize.
[2023-03-18 21:50:13] [INFO ] Deduced a trap composed of 32 places in 827 ms of which 1 ms to minimize.
[2023-03-18 21:50:14] [INFO ] Deduced a trap composed of 33 places in 871 ms of which 2 ms to minimize.
[2023-03-18 21:50:16] [INFO ] Deduced a trap composed of 28 places in 1075 ms of which 2 ms to minimize.
[2023-03-18 21:50:17] [INFO ] Deduced a trap composed of 25 places in 967 ms of which 1 ms to minimize.
[2023-03-18 21:50:18] [INFO ] Deduced a trap composed of 47 places in 719 ms of which 2 ms to minimize.
[2023-03-18 21:50:19] [INFO ] Deduced a trap composed of 36 places in 973 ms of which 1 ms to minimize.
[2023-03-18 21:50:20] [INFO ] Deduced a trap composed of 31 places in 1009 ms of which 4 ms to minimize.
[2023-03-18 21:50:21] [INFO ] Deduced a trap composed of 38 places in 954 ms of which 2 ms to minimize.
[2023-03-18 21:50:22] [INFO ] Deduced a trap composed of 25 places in 896 ms of which 2 ms to minimize.
[2023-03-18 21:50:23] [INFO ] Deduced a trap composed of 39 places in 797 ms of which 2 ms to minimize.
[2023-03-18 21:50:24] [INFO ] Deduced a trap composed of 51 places in 1088 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: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:50:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:50:24] [INFO ] After 25088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 90 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 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 3902 transition count 2807
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 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2192 place count 2806 transition count 2006
Deduced a syphon composed of 800 places in 8 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3792 place count 2006 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3793 place count 2005 transition count 2005
Iterating global reduction 3 with 1 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3794 place count 2005 transition count 2004
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3796 place count 2004 transition count 2004
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 3 with 1800 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 3 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 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 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 4 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 4 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6193 place count 806 transition count 1396
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 806 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6195 place count 805 transition count 1394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6196 place count 804 transition count 1394
Applied a total of 6196 rules in 1103 ms. Remains 804 /3902 variables (removed 3098) and now considering 1394/3902 (removed 2508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1103 ms. Remains : 804/3902 places, 1394/3902 transitions.
Finished random walk after 1527 steps, including 0 resets, run visited all 2 properties in 53 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p2 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p1))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 2 factoid took 296 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 798 ms.
Product exploration explored 100000 steps with 4 reset in 1302 ms.
Built C files in :
/tmp/ltsmin7450996424615996744
[2023-03-18 21:50:28] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7450996424615996744
Running compilation step : cd /tmp/ltsmin7450996424615996744;'/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/ltsmin7450996424615996744;'/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/ltsmin7450996424615996744;'/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 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3901 transition count 3901
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3901 transition count 3901
Applied a total of 2 rules in 973 ms. Remains 3901 /3902 variables (removed 1) and now considering 3901/3902 (removed 1) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2023-03-18 21:50:32] [INFO ] Computed 401 place invariants in 13 ms
[2023-03-18 21:50:33] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-18 21:50:33] [INFO ] Invariant cache hit.
[2023-03-18 21:50:37] [INFO ] Implicit Places using invariants and state equation in 3730 ms returned []
Implicit Place search using SMT with State Equation took 4727 ms to find 0 implicit places.
[2023-03-18 21:50:37] [INFO ] Invariant cache hit.
[2023-03-18 21:50:39] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3902 places, 3901/3902 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7511 ms. Remains : 3901/3902 places, 3901/3902 transitions.
Built C files in :
/tmp/ltsmin9830117439167395654
[2023-03-18 21:50:39] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9830117439167395654
Running compilation step : cd /tmp/ltsmin9830117439167395654;'/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/ltsmin9830117439167395654;'/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/ltsmin9830117439167395654;'/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:50:42] [INFO ] Flatten gal took : 127 ms
[2023-03-18 21:50:43] [INFO ] Flatten gal took : 129 ms
[2023-03-18 21:50:43] [INFO ] Time to serialize gal into /tmp/LTL14720491632853953200.gal : 31 ms
[2023-03-18 21:50:43] [INFO ] Time to serialize properties into /tmp/LTL429617848239199169.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/LTL14720491632853953200.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11388418495430044093.hoa' '-atoms' '/tmp/LTL429617848239199169.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/LTL429617848239199169.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11388418495430044093.hoa
Detected timeout of ITS tools.
[2023-03-18 21:50:58] [INFO ] Flatten gal took : 100 ms
[2023-03-18 21:50:58] [INFO ] Flatten gal took : 98 ms
[2023-03-18 21:50:58] [INFO ] Time to serialize gal into /tmp/LTL8502169915067345900.gal : 21 ms
[2023-03-18 21:50:58] [INFO ] Time to serialize properties into /tmp/LTL9598370619766784163.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/LTL8502169915067345900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9598370619766784163.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(("(p1039==0)")&&(X(G(("(p4115==0)")||(X("(p4572==0)"))))))))
Formula 0 simplified : X(!"(p1039==0)" | XF(!"(p4115==0)" & X!"(p4572==0)"))
Detected timeout of ITS tools.
[2023-03-18 21:51:13] [INFO ] Flatten gal took : 117 ms
[2023-03-18 21:51:13] [INFO ] Applying decomposition
[2023-03-18 21:51:13] [INFO ] Flatten gal took : 97 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/graph16815020521432072670.txt' '-o' '/tmp/graph16815020521432072670.bin' '-w' '/tmp/graph16815020521432072670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16815020521432072670.bin' '-l' '-1' '-v' '-w' '/tmp/graph16815020521432072670.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:51:14] [INFO ] Decomposing Gal with order
[2023-03-18 21:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:51:15] [INFO ] Removed a total of 998 redundant transitions.
[2023-03-18 21:51:15] [INFO ] Flatten gal took : 380 ms
[2023-03-18 21:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 48 ms.
[2023-03-18 21:51:15] [INFO ] Time to serialize gal into /tmp/LTL16319796723848857107.gal : 81 ms
[2023-03-18 21:51:15] [INFO ] Time to serialize properties into /tmp/LTL1432585791740750752.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/LTL16319796723848857107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1432585791740750752.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(("(i23.i0.i1.u334.p1039==0)")&&(X(G(("(i47.i0.i4.u1271.p4115==0)")||(X("(i51.i0.i1.u1409.p4572==0)"))))))))
Formula 0 simplified : X(!"(i23.i0.i1.u334.p1039==0)" | XF(!"(i47.i0.i4.u1271.p4115==0)" & X!"(i51.i0.i1.u1409.p4572==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11036401003360123149
[2023-03-18 21:51:30] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11036401003360123149
Running compilation step : cd /tmp/ltsmin11036401003360123149;'/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/ltsmin11036401003360123149;'/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/ltsmin11036401003360123149;'/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-LTLFireability-00 finished in 140519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))||p0)))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3901 transition count 3901
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3901 transition count 3901
Applied a total of 32 rules in 835 ms. Remains 3901 /3917 variables (removed 16) and now considering 3901/3917 (removed 16) transitions.
[2023-03-18 21:51:34] [INFO ] Invariant cache hit.
[2023-03-18 21:51:36] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2023-03-18 21:51:36] [INFO ] Invariant cache hit.
[2023-03-18 21:51:39] [INFO ] Implicit Places using invariants and state equation in 3808 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
[2023-03-18 21:51:39] [INFO ] Invariant cache hit.
[2023-03-18 21:51:42] [INFO ] Dead Transitions using invariants and state equation in 2409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3917 places, 3901/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8360 ms. Remains : 3901/3917 places, 3901/3917 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2835 1) (EQ s138 1)), p1:(EQ s974 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 42569 steps with 0 reset in 346 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-01 finished in 8887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 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 3916 transition count 2820
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2820 transition count 2820
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 2820 transition count 2027
Deduced a syphon composed of 793 places in 6 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3778 place count 2027 transition count 2027
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 3791 place count 2014 transition count 2014
Iterating global reduction 2 with 13 rules applied. Total rules applied 3804 place count 2014 transition count 2014
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3804 place count 2014 transition count 2003
Deduced a syphon composed of 11 places in 10 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3826 place count 2003 transition count 2003
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 0 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 5622 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 5623 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5625 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 5827 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6029 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 13 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6223 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 6225 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 6226 place count 802 transition count 1399
Applied a total of 6226 rules in 1358 ms. Remains 802 /3917 variables (removed 3115) and now considering 1399/3917 (removed 2518) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-18 21:51:44] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-18 21:51:44] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-18 21:51:44] [INFO ] Invariant cache hit.
[2023-03-18 21:51:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:51:45] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2023-03-18 21:51:45] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 21:51:45] [INFO ] Invariant cache hit.
[2023-03-18 21:51:46] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3917 places, 1399/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3738 ms. Remains : 802/3917 places, 1399/3917 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-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:(EQ s273 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-02 finished in 3849 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||G(p1)))))'
Support contains 2 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3903 transition count 3903
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3903 transition count 3903
Applied a total of 28 rules in 761 ms. Remains 3903 /3917 variables (removed 14) and now considering 3903/3917 (removed 14) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2023-03-18 21:51:47] [INFO ] Computed 401 place invariants in 13 ms
[2023-03-18 21:51:48] [INFO ] Implicit Places using invariants in 986 ms returned []
[2023-03-18 21:51:48] [INFO ] Invariant cache hit.
[2023-03-18 21:51:52] [INFO ] Implicit Places using invariants and state equation in 4327 ms returned []
Implicit Place search using SMT with State Equation took 5315 ms to find 0 implicit places.
[2023-03-18 21:51:52] [INFO ] Invariant cache hit.
[2023-03-18 21:51:54] [INFO ] Dead Transitions using invariants and state equation in 2150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3903/3917 places, 3903/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8230 ms. Remains : 3903/3917 places, 3903/3917 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s1501 1), p0:(EQ s241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 776 ms.
Stack based approach found an accepted trace after 1885 steps with 0 reset with depth 1886 and stack size 1886 in 15 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-03 finished in 9170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 1018 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:51:56] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-18 21:51:57] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-18 21:51:57] [INFO ] Invariant cache hit.
[2023-03-18 21:52:03] [INFO ] Implicit Places using invariants and state equation in 5190 ms returned []
Implicit Place search using SMT with State Equation took 6148 ms to find 0 implicit places.
[2023-03-18 21:52:03] [INFO ] Invariant cache hit.
[2023-03-18 21:52:05] [INFO ] Dead Transitions using invariants and state equation in 2271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9453 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s2861 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-04 finished in 9622 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)&&(X(p1) U ((!p2&&X(p1))||X(G(p1)))))))'
Support contains 4 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3905 transition count 3905
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3905 transition count 3905
Applied a total of 24 rules in 1019 ms. Remains 3905 /3917 variables (removed 12) and now considering 3905/3917 (removed 12) transitions.
// Phase 1: matrix 3905 rows 3905 cols
[2023-03-18 21:52:06] [INFO ] Computed 401 place invariants in 34 ms
[2023-03-18 21:52:07] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-18 21:52:07] [INFO ] Invariant cache hit.
[2023-03-18 21:52:09] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
[2023-03-18 21:52:09] [INFO ] Invariant cache hit.
[2023-03-18 21:52:11] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3905/3917 places, 3905/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5905 ms. Remains : 3905/3917 places, 3905/3917 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s3861 1), p2:(OR (AND (NEQ s3840 1) (NEQ s1525 1)) (EQ s1199 1)), p1:(NEQ s1199 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 162 reset in 741 ms.
Stack based approach found an accepted trace after 7496 steps with 22 reset with depth 1856 and stack size 1856 in 47 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-05 finished in 6920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3901 transition count 3901
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3901 transition count 3901
Applied a total of 32 rules in 730 ms. Remains 3901 /3917 variables (removed 16) and now considering 3901/3917 (removed 16) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2023-03-18 21:52:13] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-18 21:52:14] [INFO ] Implicit Places using invariants in 955 ms returned []
[2023-03-18 21:52:14] [INFO ] Invariant cache hit.
[2023-03-18 21:52:17] [INFO ] Implicit Places using invariants and state equation in 3610 ms returned []
Implicit Place search using SMT with State Equation took 4569 ms to find 0 implicit places.
[2023-03-18 21:52:17] [INFO ] Invariant cache hit.
[2023-03-18 21:52:19] [INFO ] Dead Transitions using invariants and state equation in 2089 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3917 places, 3901/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7390 ms. Remains : 3901/3917 places, 3901/3917 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s3390 1) (EQ s3404 1) (EQ s765 1) (EQ s1944 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-06 finished in 7505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 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 3916 transition count 2820
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 791 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2029
Deduced a syphon composed of 791 places in 7 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 2 with 1582 rules applied. Total rules applied 3774 place count 2029 transition count 2029
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 3787 place count 2016 transition count 2016
Iterating global reduction 2 with 13 rules applied. Total rules applied 3800 place count 2016 transition count 2016
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3800 place count 2016 transition count 2005
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3822 place count 2005 transition count 2005
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 5622 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 5623 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 3 with 2 rules applied. Total rules applied 5625 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 5827 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 6029 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 3 with 194 rules applied. Total rules applied 6223 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 6225 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 6226 place count 802 transition count 1399
Applied a total of 6226 rules in 943 ms. Remains 802 /3917 variables (removed 3115) and now considering 1399/3917 (removed 2518) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2023-03-18 21:52:20] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:52:21] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-18 21:52:21] [INFO ] Invariant cache hit.
[2023-03-18 21:52:22] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2023-03-18 21:52:22] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:52:22] [INFO ] Invariant cache hit.
[2023-03-18 21:52:22] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/3917 places, 1399/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2989 ms. Remains : 802/3917 places, 1399/3917 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-07 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:(AND (EQ s422 1) (EQ s426 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-07 finished in 3061 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||G(p1)))))'
Support contains 2 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 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 3916 transition count 2820
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 791 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2029
Deduced a syphon composed of 791 places in 5 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 2 with 1582 rules applied. Total rules applied 3774 place count 2029 transition count 2029
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 3787 place count 2016 transition count 2016
Iterating global reduction 2 with 13 rules applied. Total rules applied 3800 place count 2016 transition count 2016
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3800 place count 2016 transition count 2005
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 3822 place count 2005 transition count 2005
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 5620 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 5621 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 5623 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 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5825 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6027 place count 903 transition count 1304
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 6219 place count 807 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6221 place count 805 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6222 place count 804 transition count 1398
Applied a total of 6222 rules in 658 ms. Remains 804 /3917 variables (removed 3113) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 804 cols
[2023-03-18 21:52:23] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:52:24] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-18 21:52:24] [INFO ] Invariant cache hit.
[2023-03-18 21:52:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 21:52:25] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2023-03-18 21:52:25] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:52:25] [INFO ] Invariant cache hit.
[2023-03-18 21:52:25] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/3917 places, 1398/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2900 ms. Remains : 804/3917 places, 1398/3917 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s485 1), p0:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-08 finished in 2997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 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 3916 transition count 2819
Reduce places removed 1097 places and 0 transitions.
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2194 place count 2819 transition count 2819
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 792 Pre rules applied. Total rules applied 2194 place count 2819 transition count 2027
Deduced a syphon composed of 792 places in 5 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 2 with 1584 rules applied. Total rules applied 3778 place count 2027 transition count 2027
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 3790 place count 2015 transition count 2015
Iterating global reduction 2 with 12 rules applied. Total rules applied 3802 place count 2015 transition count 2015
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 3802 place count 2015 transition count 2005
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3822 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 5624 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 5625 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5627 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5829 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6031 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 6225 place count 804 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6227 place count 802 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6228 place count 801 transition count 1398
Applied a total of 6228 rules in 645 ms. Remains 801 /3917 variables (removed 3116) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 801 cols
[2023-03-18 21:52:26] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:52:27] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-18 21:52:27] [INFO ] Invariant cache hit.
[2023-03-18 21:52:28] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
[2023-03-18 21:52:28] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 21:52:28] [INFO ] Invariant cache hit.
[2023-03-18 21:52:28] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/3917 places, 1398/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2700 ms. Remains : 801/3917 places, 1398/3917 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s576 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-09 finished in 2747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 1062 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:52:29] [INFO ] Computed 401 place invariants in 20 ms
[2023-03-18 21:52:30] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2023-03-18 21:52:30] [INFO ] Invariant cache hit.
[2023-03-18 21:52:34] [INFO ] Implicit Places using invariants and state equation in 3754 ms returned []
Implicit Place search using SMT with State Equation took 4763 ms to find 0 implicit places.
[2023-03-18 21:52:34] [INFO ] Invariant cache hit.
[2023-03-18 21:52:37] [INFO ] Dead Transitions using invariants and state equation in 2729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8556 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s642 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-10 finished in 8690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p1)||G(p2))))))'
Support contains 5 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 746 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:52:38] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-18 21:52:39] [INFO ] Implicit Places using invariants in 882 ms returned []
[2023-03-18 21:52:39] [INFO ] Invariant cache hit.
[2023-03-18 21:52:42] [INFO ] Implicit Places using invariants and state equation in 3693 ms returned []
Implicit Place search using SMT with State Equation took 4577 ms to find 0 implicit places.
[2023-03-18 21:52:42] [INFO ] Invariant cache hit.
[2023-03-18 21:52:45] [INFO ] Dead Transitions using invariants and state equation in 2436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7777 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1262 1) (EQ s1276 1)), p2:(EQ s251 1), p0:(OR (EQ s1390 1) (EQ s2106 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 794 ms.
Product exploration explored 100000 steps with 3 reset in 1251 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) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 647 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) 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 14) seen :0
Interrupted probabilistic random walk after 109920 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109920 steps, saw 100714 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-18 21:52:52] [INFO ] Invariant cache hit.
[2023-03-18 21:52:53] [INFO ] [Real]Absence check using 401 positive place invariants in 175 ms returned sat
[2023-03-18 21:52:53] [INFO ] After 1115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 21:52:54] [INFO ] [Nat]Absence check using 401 positive place invariants in 168 ms returned sat
[2023-03-18 21:53:00] [INFO ] After 5324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 21:53:01] [INFO ] Deduced a trap composed of 25 places in 992 ms of which 2 ms to minimize.
[2023-03-18 21:53:02] [INFO ] Deduced a trap composed of 33 places in 902 ms of which 1 ms to minimize.
[2023-03-18 21:53:03] [INFO ] Deduced a trap composed of 32 places in 885 ms of which 3 ms to minimize.
[2023-03-18 21:53:04] [INFO ] Deduced a trap composed of 25 places in 825 ms of which 2 ms to minimize.
[2023-03-18 21:53:05] [INFO ] Deduced a trap composed of 35 places in 927 ms of which 2 ms to minimize.
[2023-03-18 21:53:06] [INFO ] Deduced a trap composed of 36 places in 690 ms of which 1 ms to minimize.
[2023-03-18 21:53:07] [INFO ] Deduced a trap composed of 65 places in 922 ms of which 5 ms to minimize.
[2023-03-18 21:53:08] [INFO ] Deduced a trap composed of 74 places in 904 ms of which 2 ms to minimize.
[2023-03-18 21:53:09] [INFO ] Deduced a trap composed of 59 places in 727 ms of which 2 ms to minimize.
[2023-03-18 21:53:10] [INFO ] Deduced a trap composed of 56 places in 674 ms of which 2 ms to minimize.
[2023-03-18 21:53:11] [INFO ] Deduced a trap composed of 104 places in 702 ms of which 1 ms to minimize.
[2023-03-18 21:53:12] [INFO ] Deduced a trap composed of 60 places in 804 ms of which 3 ms to minimize.
[2023-03-18 21:53:13] [INFO ] Deduced a trap composed of 68 places in 817 ms of which 3 ms to minimize.
[2023-03-18 21:53:14] [INFO ] Deduced a trap composed of 67 places in 660 ms of which 2 ms to minimize.
[2023-03-18 21:53:15] [INFO ] Deduced a trap composed of 75 places in 629 ms of which 1 ms to minimize.
[2023-03-18 21:53:15] [INFO ] Deduced a trap composed of 60 places in 641 ms of which 2 ms to minimize.
[2023-03-18 21:53:16] [INFO ] Deduced a trap composed of 59 places in 682 ms of which 1 ms to minimize.
[2023-03-18 21:53:17] [INFO ] Deduced a trap composed of 82 places in 663 ms of which 1 ms to minimize.
[2023-03-18 21:53:18] [INFO ] Deduced a trap composed of 72 places in 796 ms of which 1 ms to minimize.
[2023-03-18 21:53:18] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 18049 ms
[2023-03-18 21:53:18] [INFO ] After 23408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 21:53:18] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 14 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1309 ms.
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 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 3902 transition count 2807
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 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
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 2806 transition count 2008
Deduced a syphon composed of 798 places in 4 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2008 transition count 2008
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 5590 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 5591 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5593 place count 1106 transition count 1105
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 1005 transition count 1205
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 5997 place count 904 transition count 1305
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6187 place count 809 transition count 1399
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6188 place count 809 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6189 place count 808 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6190 place count 807 transition count 1397
Applied a total of 6190 rules in 486 ms. Remains 807 /3902 variables (removed 3095) and now considering 1397/3902 (removed 2505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 807/3902 places, 1397/3902 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 97094 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97094 steps, saw 59508 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-18 21:53:24] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:53:25] [INFO ] [Real]Absence check using 400 positive place invariants in 59 ms returned sat
[2023-03-18 21:53:25] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 21:53:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2023-03-18 21:53:26] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 21:53:27] [INFO ] After 1561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 398 ms.
[2023-03-18 21:53:27] [INFO ] After 2368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 2 properties in 3046 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 26 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 24 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-18 21:53:30] [INFO ] Invariant cache hit.
[2023-03-18 21:53:31] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-18 21:53:31] [INFO ] Invariant cache hit.
[2023-03-18 21:53:32] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2023-03-18 21:53:32] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 21:53:32] [INFO ] Invariant cache hit.
[2023-03-18 21:53:32] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2010 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 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 805 vertex of which 803 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 801 vertex of which 4 / 801 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 799 transition count 1388
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 797 vertex of which 6 / 797 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 794 transition count 1379
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 791 vertex of which 8 / 791 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 787 transition count 1368
Reduce places removed 4 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 783 vertex of which 8 / 783 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 779 transition count 1354
Reduce places removed 4 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 775 vertex of which 8 / 775 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 771 transition count 1340
Reduce places removed 4 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 767 vertex of which 8 / 767 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 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 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 755 transition count 1312
Reduce places removed 4 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 751 vertex of which 8 / 751 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 747 transition count 1298
Reduce places removed 4 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 743 vertex of which 8 / 743 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 739 transition count 1284
Reduce places removed 4 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 735 vertex of which 8 / 735 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 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 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 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 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 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 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 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 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 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 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 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 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 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 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 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 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 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 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 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 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 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 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 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 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 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 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 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 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 453 place count 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 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 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 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 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 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 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 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 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 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 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 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 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 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 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 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 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 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 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 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 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 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 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 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 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 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 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 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 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 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 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 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 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 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 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 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 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 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 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 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 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
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 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
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 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
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 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
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 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 172 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-18 21:53:32] [INFO ] Computed 212 place invariants in 1 ms
[2023-03-18 21:53:33] [INFO ] [Real]Absence check using 212 positive place invariants in 22 ms returned sat
[2023-03-18 21:53:33] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:53:33] [INFO ] [Nat]Absence check using 212 positive place invariants in 20 ms returned sat
[2023-03-18 21:53:33] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:53:34] [INFO ] After 636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-18 21:53:34] [INFO ] After 1028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 434 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 370 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:53:35] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-18 21:53:36] [INFO ] Implicit Places using invariants in 887 ms returned []
[2023-03-18 21:53:36] [INFO ] Invariant cache hit.
[2023-03-18 21:53:40] [INFO ] Implicit Places using invariants and state equation in 4004 ms returned []
Implicit Place search using SMT with State Equation took 4895 ms to find 0 implicit places.
[2023-03-18 21:53:40] [INFO ] Invariant cache hit.
[2023-03-18 21:53:43] [INFO ] Dead Transitions using invariants and state equation in 2401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7682 ms. Remains : 3902/3902 places, 3902/3902 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 (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 454 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 104394 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104394 steps, saw 98131 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-18 21:53:47] [INFO ] Invariant cache hit.
[2023-03-18 21:53:49] [INFO ] [Real]Absence check using 401 positive place invariants in 192 ms returned sat
[2023-03-18 21:53:49] [INFO ] After 1514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 21:53:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 210 ms returned sat
[2023-03-18 21:53:56] [INFO ] After 4773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 21:53:57] [INFO ] Deduced a trap composed of 25 places in 1026 ms of which 2 ms to minimize.
[2023-03-18 21:53:58] [INFO ] Deduced a trap composed of 33 places in 727 ms of which 2 ms to minimize.
[2023-03-18 21:53:59] [INFO ] Deduced a trap composed of 32 places in 708 ms of which 2 ms to minimize.
[2023-03-18 21:54:00] [INFO ] Deduced a trap composed of 25 places in 714 ms of which 1 ms to minimize.
[2023-03-18 21:54:00] [INFO ] Deduced a trap composed of 35 places in 638 ms of which 2 ms to minimize.
[2023-03-18 21:54:01] [INFO ] Deduced a trap composed of 36 places in 689 ms of which 1 ms to minimize.
[2023-03-18 21:54:02] [INFO ] Deduced a trap composed of 65 places in 770 ms of which 1 ms to minimize.
[2023-03-18 21:54:03] [INFO ] Deduced a trap composed of 74 places in 759 ms of which 2 ms to minimize.
[2023-03-18 21:54:04] [INFO ] Deduced a trap composed of 59 places in 616 ms of which 1 ms to minimize.
[2023-03-18 21:54:04] [INFO ] Deduced a trap composed of 56 places in 689 ms of which 2 ms to minimize.
[2023-03-18 21:54:05] [INFO ] Deduced a trap composed of 104 places in 656 ms of which 1 ms to minimize.
[2023-03-18 21:54:06] [INFO ] Deduced a trap composed of 60 places in 577 ms of which 1 ms to minimize.
[2023-03-18 21:54:07] [INFO ] Deduced a trap composed of 68 places in 605 ms of which 2 ms to minimize.
[2023-03-18 21:54:08] [INFO ] Deduced a trap composed of 67 places in 595 ms of which 2 ms to minimize.
[2023-03-18 21:54:08] [INFO ] Deduced a trap composed of 75 places in 591 ms of which 2 ms to minimize.
[2023-03-18 21:54:09] [INFO ] Deduced a trap composed of 60 places in 769 ms of which 2 ms to minimize.
[2023-03-18 21:54:10] [INFO ] Deduced a trap composed of 59 places in 677 ms of which 2 ms to minimize.
[2023-03-18 21:54:11] [INFO ] Deduced a trap composed of 82 places in 596 ms of which 1 ms to minimize.
[2023-03-18 21:54:11] [INFO ] Deduced a trap composed of 72 places in 606 ms of which 2 ms to minimize.
[2023-03-18 21:54:12] [INFO ] Deduced a trap composed of 76 places in 573 ms of which 1 ms to minimize.
[2023-03-18 21:54:13] [INFO ] Deduced a trap composed of 76 places in 589 ms of which 2 ms to minimize.
[2023-03-18 21:54:13] [INFO ] Deduced a trap composed of 73 places in 600 ms of which 1 ms to minimize.
[2023-03-18 21:54:14] [INFO ] Deduced a trap composed of 84 places in 686 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:54:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:54:14] [INFO ] After 25296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 2302 ms.
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 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 3902 transition count 2807
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 2807 transition count 2806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2806 transition count 2806
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 2806 transition count 2008
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3788 place count 2008 transition count 2008
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 3 with 1802 rules applied. Total rules applied 5590 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 5591 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 5593 place count 1106 transition count 1105
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 5795 place count 1005 transition count 1205
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 5997 place count 904 transition count 1305
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6187 place count 809 transition count 1399
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6188 place count 809 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6189 place count 808 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6190 place count 807 transition count 1397
Applied a total of 6190 rules in 710 ms. Remains 807 /3902 variables (removed 3095) and now considering 1397/3902 (removed 2505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 807/3902 places, 1397/3902 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 172491 steps, run timeout after 6001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 172491 steps, saw 106187 distinct states, run finished after 6001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-18 21:54:26] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:54:26] [INFO ] [Real]Absence check using 400 positive place invariants in 42 ms returned sat
[2023-03-18 21:54:26] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 21:54:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 43 ms returned sat
[2023-03-18 21:54:27] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 21:54:28] [INFO ] After 1342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 392 ms.
[2023-03-18 21:54:29] [INFO ] After 2093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 3358 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 25 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 24 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-18 21:54:32] [INFO ] Invariant cache hit.
[2023-03-18 21:54:32] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-18 21:54:32] [INFO ] Invariant cache hit.
[2023-03-18 21:54:34] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2023-03-18 21:54:34] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 21:54:34] [INFO ] Invariant cache hit.
[2023-03-18 21:54:34] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2192 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 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 2790 edges and 805 vertex of which 803 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 801 vertex of which 4 / 801 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 799 transition count 1388
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 797 vertex of which 6 / 797 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 794 transition count 1379
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 791 vertex of which 8 / 791 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 787 transition count 1368
Reduce places removed 4 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 783 vertex of which 8 / 783 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 779 transition count 1354
Reduce places removed 4 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 775 vertex of which 8 / 775 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 771 transition count 1340
Reduce places removed 4 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 767 vertex of which 8 / 767 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 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 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 755 transition count 1312
Reduce places removed 4 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 751 vertex of which 8 / 751 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 747 transition count 1298
Reduce places removed 4 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 743 vertex of which 8 / 743 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 739 transition count 1284
Reduce places removed 4 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 735 vertex of which 8 / 735 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 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 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 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 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 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 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 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 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 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 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 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 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 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 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 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 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 339 place count 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 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 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 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 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 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 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 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 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 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 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 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 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 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 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 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 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 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 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 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 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 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 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 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 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 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 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 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 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 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 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 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 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 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 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 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 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 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 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 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 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 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 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 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 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 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 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 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 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 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 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 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 833 place count 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
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 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
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 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
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 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
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 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 152 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-18 21:54:34] [INFO ] Computed 212 place invariants in 1 ms
[2023-03-18 21:54:34] [INFO ] [Real]Absence check using 212 positive place invariants in 19 ms returned sat
[2023-03-18 21:54:34] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 21:54:35] [INFO ] [Nat]Absence check using 212 positive place invariants in 20 ms returned sat
[2023-03-18 21:54:35] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 21:54:35] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-18 21:54:35] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 196 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 210 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 847 ms.
Product exploration explored 100000 steps with 1 reset in 1208 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 261 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 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 3902 transition count 3902
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 3902 transition count 4302
Deduced a syphon composed of 1496 places in 13 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1496 place count 3902 transition count 4302
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2696 places in 11 ms
Iterating global reduction 1 with 1200 rules applied. Total rules applied 2696 place count 3902 transition count 4303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2697 place count 3902 transition count 4302
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 3497 place count 3102 transition count 3501
Deduced a syphon composed of 1896 places in 7 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 4297 place count 3102 transition count 3501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1897 places in 13 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4298 place count 3102 transition count 3501
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4300 place count 3100 transition count 3499
Deduced a syphon composed of 1895 places in 12 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4302 place count 3100 transition count 3499
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 1996 places in 14 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4403 place count 3100 transition count 4224
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4504 place count 2999 transition count 4022
Deduced a syphon composed of 1895 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4605 place count 2999 transition count 4022
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -743
Deduced a syphon composed of 1996 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4706 place count 2999 transition count 4765
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4807 place count 2898 transition count 4563
Deduced a syphon composed of 1895 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4908 place count 2898 transition count 4563
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -721
Deduced a syphon composed of 1996 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5009 place count 2898 transition count 5284
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5110 place count 2797 transition count 5082
Deduced a syphon composed of 1895 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5211 place count 2797 transition count 5082
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -674
Deduced a syphon composed of 1988 places in 1 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 5304 place count 2797 transition count 5756
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 5397 place count 2704 transition count 5570
Deduced a syphon composed of 1895 places in 1 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 5490 place count 2704 transition count 5570
Deduced a syphon composed of 1895 places in 2 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5493 place count 2704 transition count 5567
Deduced a syphon composed of 1895 places in 2 ms
Applied a total of 5493 rules in 3790 ms. Remains 2704 /3902 variables (removed 1198) and now considering 5567/3902 (removed -1665) transitions.
[2023-03-18 21:54:43] [INFO ] Redundant transitions in 249 ms returned []
// Phase 1: matrix 5567 rows 2704 cols
[2023-03-18 21:54:43] [INFO ] Computed 401 place invariants in 98 ms
[2023-03-18 21:54:46] [INFO ] Dead Transitions using invariants and state equation in 2981 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2704/3902 places, 5567/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7039 ms. Remains : 2704/3902 places, 5567/3902 transitions.
Built C files in :
/tmp/ltsmin1177629551593237119
[2023-03-18 21:54:46] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1177629551593237119
Running compilation step : cd /tmp/ltsmin1177629551593237119;'/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/ltsmin1177629551593237119;'/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/ltsmin1177629551593237119;'/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 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 346 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:54:49] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-18 21:54:50] [INFO ] Implicit Places using invariants in 994 ms returned []
[2023-03-18 21:54:50] [INFO ] Invariant cache hit.
[2023-03-18 21:54:54] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 4561 ms to find 0 implicit places.
[2023-03-18 21:54:54] [INFO ] Invariant cache hit.
[2023-03-18 21:54:56] [INFO ] Dead Transitions using invariants and state equation in 2418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7326 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Built C files in :
/tmp/ltsmin605710284570959311
[2023-03-18 21:54:56] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin605710284570959311
Running compilation step : cd /tmp/ltsmin605710284570959311;'/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/ltsmin605710284570959311;'/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/ltsmin605710284570959311;'/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:59] [INFO ] Flatten gal took : 97 ms
[2023-03-18 21:55:00] [INFO ] Flatten gal took : 88 ms
[2023-03-18 21:55:00] [INFO ] Time to serialize gal into /tmp/LTL11940611909733980138.gal : 15 ms
[2023-03-18 21:55:00] [INFO ] Time to serialize properties into /tmp/LTL17501005099132126676.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/LTL11940611909733980138.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16273994395250112896.hoa' '-atoms' '/tmp/LTL17501005099132126676.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...320
Loading property file /tmp/LTL17501005099132126676.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16273994395250112896.hoa
Detected timeout of ITS tools.
[2023-03-18 21:55:15] [INFO ] Flatten gal took : 118 ms
[2023-03-18 21:55:15] [INFO ] Flatten gal took : 109 ms
[2023-03-18 21:55:15] [INFO ] Time to serialize gal into /tmp/LTL1168564775881215151.gal : 35 ms
[2023-03-18 21:55:15] [INFO ] Time to serialize properties into /tmp/LTL15244029030686545604.ltl : 8 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/LTL1168564775881215151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15244029030686545604.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(X((!("((p1761==1)||(p2683==1))"))U((G(!("((p1596==1)&&(p1615==1))")))||(G("(p293==1)")))))))
Formula 0 simplified : XX("((p1761==1)||(p2683==1))" R (F"((p1596==1)&&(p1615==1))" & F!"(p293==1)"))
Detected timeout of ITS tools.
[2023-03-18 21:55:30] [INFO ] Flatten gal took : 106 ms
[2023-03-18 21:55:30] [INFO ] Applying decomposition
[2023-03-18 21:55:30] [INFO ] Flatten gal took : 85 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/graph6918939310230628786.txt' '-o' '/tmp/graph6918939310230628786.bin' '-w' '/tmp/graph6918939310230628786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6918939310230628786.bin' '-l' '-1' '-v' '-w' '/tmp/graph6918939310230628786.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:55:31] [INFO ] Decomposing Gal with order
[2023-03-18 21:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:55:31] [INFO ] Removed a total of 994 redundant transitions.
[2023-03-18 21:55:31] [INFO ] Flatten gal took : 132 ms
[2023-03-18 21:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2023-03-18 21:55:31] [INFO ] Time to serialize gal into /tmp/LTL16359740522269512169.gal : 68 ms
[2023-03-18 21:55:31] [INFO ] Time to serialize properties into /tmp/LTL5893955228381118987.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/LTL16359740522269512169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5893955228381118987.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(X((!("((i8.i0.i4.u552.p1761==1)||(i37.i1.i3.u832.p2683==1))"))U((G(!("((i26.u501.p1596==1)&&(i26.u509.p1615==1))")))||(G("(i13.i0...180
Formula 0 simplified : XX("((i8.i0.i4.u552.p1761==1)||(i37.i1.i3.u832.p2683==1))" R (F"((i26.u501.p1596==1)&&(i26.u509.p1615==1))" & F!"(i13.i0.i5.u103.p29...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16382940646543287320
[2023-03-18 21:55:46] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16382940646543287320
Running compilation step : cd /tmp/ltsmin16382940646543287320;'/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/ltsmin16382940646543287320;'/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/ltsmin16382940646543287320;'/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-LTLFireability-11 finished in 192473 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(X(X(p1))))))'
Support contains 1 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 1064 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:55:51] [INFO ] Computed 401 place invariants in 32 ms
[2023-03-18 21:55:51] [INFO ] Implicit Places using invariants in 995 ms returned []
[2023-03-18 21:55:52] [INFO ] Invariant cache hit.
[2023-03-18 21:55:56] [INFO ] Implicit Places using invariants and state equation in 4822 ms returned []
Implicit Place search using SMT with State Equation took 5820 ms to find 0 implicit places.
[2023-03-18 21:55:56] [INFO ] Invariant cache hit.
[2023-03-18 21:55:59] [INFO ] Dead Transitions using invariants and state equation in 2481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9368 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2681 1), p1:(EQ s2681 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19963 reset in 1235 ms.
Product exploration explored 100000 steps with 19995 reset in 972 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 p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 194525 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194525 steps, saw 178103 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:56:05] [INFO ] Invariant cache hit.
[2023-03-18 21:56:05] [INFO ] [Real]Absence check using 401 positive place invariants in 166 ms returned sat
[2023-03-18 21:56:07] [INFO ] After 2678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:56:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 163 ms returned sat
[2023-03-18 21:56:10] [INFO ] After 2154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:56:12] [INFO ] Deduced a trap composed of 34 places in 1244 ms of which 2 ms to minimize.
[2023-03-18 21:56:13] [INFO ] Deduced a trap composed of 31 places in 1121 ms of which 2 ms to minimize.
[2023-03-18 21:56:14] [INFO ] Deduced a trap composed of 31 places in 934 ms of which 2 ms to minimize.
[2023-03-18 21:56:15] [INFO ] Deduced a trap composed of 25 places in 955 ms of which 2 ms to minimize.
[2023-03-18 21:56:16] [INFO ] Deduced a trap composed of 32 places in 1101 ms of which 1 ms to minimize.
[2023-03-18 21:56:18] [INFO ] Deduced a trap composed of 54 places in 1026 ms of which 2 ms to minimize.
[2023-03-18 21:56:19] [INFO ] Deduced a trap composed of 25 places in 985 ms of which 2 ms to minimize.
[2023-03-18 21:56:20] [INFO ] Deduced a trap composed of 38 places in 1074 ms of which 2 ms to minimize.
[2023-03-18 21:56:21] [INFO ] Deduced a trap composed of 32 places in 1066 ms of which 2 ms to minimize.
[2023-03-18 21:56:22] [INFO ] Deduced a trap composed of 23 places in 1036 ms of which 1 ms to minimize.
[2023-03-18 21:56:23] [INFO ] Deduced a trap composed of 44 places in 871 ms of which 2 ms to minimize.
[2023-03-18 21:56:24] [INFO ] Deduced a trap composed of 44 places in 948 ms of which 2 ms to minimize.
[2023-03-18 21:56:25] [INFO ] Deduced a trap composed of 52 places in 849 ms of which 2 ms to minimize.
[2023-03-18 21:56:26] [INFO ] Deduced a trap composed of 69 places in 844 ms of which 2 ms to minimize.
[2023-03-18 21:56:27] [INFO ] Deduced a trap composed of 61 places in 883 ms of which 2 ms to minimize.
[2023-03-18 21:56:28] [INFO ] Deduced a trap composed of 43 places in 794 ms of which 1 ms to minimize.
[2023-03-18 21:56:29] [INFO ] Deduced a trap composed of 39 places in 980 ms of which 2 ms to minimize.
[2023-03-18 21:56:30] [INFO ] Deduced a trap composed of 35 places in 829 ms of which 1 ms to minimize.
[2023-03-18 21:56:31] [INFO ] Deduced a trap composed of 43 places in 874 ms of which 2 ms to minimize.
[2023-03-18 21:56:32] [INFO ] Deduced a trap composed of 35 places in 656 ms of which 1 ms to minimize.
[2023-03-18 21:56:33] [INFO ] Deduced a trap composed of 47 places in 921 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:56:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:56:33] [INFO ] After 25587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 2803
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2803 transition count 2803
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2198 place count 2803 transition count 2004
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3796 place count 2004 transition count 2004
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5598 place count 1103 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1103 transition count 1102
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 5601 place count 1102 transition count 1101
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 5803 place count 1001 transition count 1201
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 6005 place count 900 transition count 1302
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 6197 place count 804 transition count 1397
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 1396
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 804 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 803 transition count 1395
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6201 place count 803 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6202 place count 802 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6203 place count 801 transition count 1393
Applied a total of 6203 rules in 649 ms. Remains 801 /3902 variables (removed 3101) and now considering 1393/3902 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 801/3902 places, 1393/3902 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 187274 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187274 steps, saw 117384 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 801 cols
[2023-03-18 21:56:37] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:56:37] [INFO ] [Real]Absence check using 400 positive place invariants in 40 ms returned sat
[2023-03-18 21:56:38] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:56:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 39 ms returned sat
[2023-03-18 21:56:38] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:56:38] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-18 21:56:38] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 1 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 22 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 801/801 places, 1393/1393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 22 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
[2023-03-18 21:56:39] [INFO ] Invariant cache hit.
[2023-03-18 21:56:39] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-18 21:56:39] [INFO ] Invariant cache hit.
[2023-03-18 21:56:40] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2023-03-18 21:56:40] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 21:56:40] [INFO ] Invariant cache hit.
[2023-03-18 21:56:40] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1843 ms. Remains : 801/801 places, 1393/1393 transitions.
Graph (trivial) has 398 edges and 801 vertex of which 4 / 801 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 799 vertex of which 797 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 795 vertex of which 4 / 795 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 793 transition count 1384
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 791 vertex of which 6 / 791 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 788 transition count 1375
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 785 vertex of which 8 / 785 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 781 transition count 1364
Reduce places removed 4 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 777 vertex of which 8 / 777 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 773 transition count 1350
Reduce places removed 4 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 769 vertex of which 8 / 769 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 765 transition count 1336
Reduce places removed 4 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 761 vertex of which 8 / 761 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 757 transition count 1322
Reduce places removed 4 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 753 vertex of which 8 / 753 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 749 transition count 1308
Reduce places removed 4 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 745 vertex of which 8 / 745 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 741 transition count 1294
Reduce places removed 4 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 737 vertex of which 8 / 737 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 733 transition count 1280
Reduce places removed 4 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 729 vertex of which 8 / 729 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 725 transition count 1266
Reduce places removed 4 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 721 vertex of which 8 / 721 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 717 transition count 1252
Reduce places removed 4 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 713 vertex of which 8 / 713 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 709 transition count 1238
Reduce places removed 4 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 705 vertex of which 8 / 705 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 701 transition count 1224
Reduce places removed 4 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 697 vertex of which 8 / 697 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 693 transition count 1210
Reduce places removed 4 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 689 vertex of which 8 / 689 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 685 transition count 1196
Reduce places removed 4 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 681 vertex of which 8 / 681 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 677 transition count 1182
Reduce places removed 4 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 673 vertex of which 8 / 673 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 669 transition count 1168
Reduce places removed 4 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 665 vertex of which 8 / 665 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 661 transition count 1154
Reduce places removed 4 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 657 vertex of which 8 / 657 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 653 transition count 1140
Reduce places removed 4 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 649 vertex of which 8 / 649 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 645 transition count 1126
Reduce places removed 4 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 641 vertex of which 8 / 641 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 637 transition count 1112
Reduce places removed 4 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 633 vertex of which 8 / 633 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 629 transition count 1098
Reduce places removed 4 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 625 vertex of which 8 / 625 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 415 place count 621 transition count 1084
Reduce places removed 4 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 617 vertex of which 8 / 617 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 613 transition count 1070
Reduce places removed 4 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 609 vertex of which 8 / 609 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 605 transition count 1056
Reduce places removed 4 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 601 vertex of which 8 / 601 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 597 transition count 1042
Reduce places removed 4 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 593 vertex of which 8 / 593 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 589 transition count 1028
Reduce places removed 4 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 585 vertex of which 8 / 585 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 581 transition count 1014
Reduce places removed 4 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 577 vertex of which 8 / 577 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 573 transition count 1000
Reduce places removed 4 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 569 vertex of which 8 / 569 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 565 transition count 986
Reduce places removed 4 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 561 vertex of which 6 / 561 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 972
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 276 edges and 555 vertex of which 4 / 555 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 31 with 14 rules applied. Total rules applied 581 place count 553 transition count 962
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 273 edges and 551 vertex of which 2 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 9 rules applied. Total rules applied 590 place count 550 transition count 956
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 33 with 5 rules applied. Total rules applied 595 place count 549 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 1 Pre rules applied. Total rules applied 595 place count 549 transition count 951
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 598 place count 547 transition count 951
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 34 with 3 rules applied. Total rules applied 601 place count 545 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 604 place count 545 transition count 947
Applied a total of 604 rules in 115 ms. Remains 545 /801 variables (removed 256) and now considering 947/1393 (removed 446) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 947 rows 545 cols
[2023-03-18 21:56:41] [INFO ] Computed 272 place invariants in 2 ms
[2023-03-18 21:56:41] [INFO ] [Real]Absence check using 272 positive place invariants in 24 ms returned sat
[2023-03-18 21:56:41] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:56:41] [INFO ] [Nat]Absence check using 272 positive place invariants in 25 ms returned sat
[2023-03-18 21:56:41] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:56:41] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-18 21:56:41] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 512 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:56:42] [INFO ] Computed 401 place invariants in 20 ms
[2023-03-18 21:56:43] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2023-03-18 21:56:43] [INFO ] Invariant cache hit.
[2023-03-18 21:56:48] [INFO ] Implicit Places using invariants and state equation in 4733 ms returned []
Implicit Place search using SMT with State Equation took 5818 ms to find 0 implicit places.
[2023-03-18 21:56:48] [INFO ] Invariant cache hit.
[2023-03-18 21:56:50] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8556 ms. Remains : 3902/3902 places, 3902/3902 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 190874 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190874 steps, saw 176565 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:56:54] [INFO ] Invariant cache hit.
[2023-03-18 21:56:55] [INFO ] [Real]Absence check using 401 positive place invariants in 165 ms returned sat
[2023-03-18 21:56:57] [INFO ] After 2895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:56:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 248 ms returned sat
[2023-03-18 21:57:01] [INFO ] After 2662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:57:02] [INFO ] Deduced a trap composed of 34 places in 1194 ms of which 1 ms to minimize.
[2023-03-18 21:57:03] [INFO ] Deduced a trap composed of 31 places in 1087 ms of which 1 ms to minimize.
[2023-03-18 21:57:04] [INFO ] Deduced a trap composed of 31 places in 900 ms of which 2 ms to minimize.
[2023-03-18 21:57:05] [INFO ] Deduced a trap composed of 25 places in 992 ms of which 2 ms to minimize.
[2023-03-18 21:57:06] [INFO ] Deduced a trap composed of 32 places in 837 ms of which 1 ms to minimize.
[2023-03-18 21:57:08] [INFO ] Deduced a trap composed of 54 places in 1032 ms of which 2 ms to minimize.
[2023-03-18 21:57:09] [INFO ] Deduced a trap composed of 25 places in 1025 ms of which 1 ms to minimize.
[2023-03-18 21:57:10] [INFO ] Deduced a trap composed of 38 places in 1023 ms of which 1 ms to minimize.
[2023-03-18 21:57:11] [INFO ] Deduced a trap composed of 32 places in 962 ms of which 2 ms to minimize.
[2023-03-18 21:57:12] [INFO ] Deduced a trap composed of 23 places in 960 ms of which 1 ms to minimize.
[2023-03-18 21:57:13] [INFO ] Deduced a trap composed of 44 places in 872 ms of which 2 ms to minimize.
[2023-03-18 21:57:15] [INFO ] Deduced a trap composed of 44 places in 976 ms of which 1 ms to minimize.
[2023-03-18 21:57:16] [INFO ] Deduced a trap composed of 52 places in 941 ms of which 2 ms to minimize.
[2023-03-18 21:57:17] [INFO ] Deduced a trap composed of 69 places in 727 ms of which 2 ms to minimize.
[2023-03-18 21:57:17] [INFO ] Deduced a trap composed of 61 places in 706 ms of which 1 ms to minimize.
[2023-03-18 21:57:18] [INFO ] Deduced a trap composed of 43 places in 982 ms of which 1 ms to minimize.
[2023-03-18 21:57:19] [INFO ] Deduced a trap composed of 39 places in 776 ms of which 2 ms to minimize.
[2023-03-18 21:57:20] [INFO ] Deduced a trap composed of 35 places in 831 ms of which 3 ms to minimize.
[2023-03-18 21:57:21] [INFO ] Deduced a trap composed of 43 places in 857 ms of which 1 ms to minimize.
[2023-03-18 21:57:22] [INFO ] Deduced a trap composed of 35 places in 922 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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:57:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:57:22] [INFO ] After 25316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions removed 1099 transitions
Trivial Post-agglo rules discarded 1099 transitions
Performed 1099 trivial Post agglomeration. Transition count delta: 1099
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 2803
Reduce places removed 1099 places and 0 transitions.
Iterating post reduction 1 with 1099 rules applied. Total rules applied 2198 place count 2803 transition count 2803
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2198 place count 2803 transition count 2004
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 3796 place count 2004 transition count 2004
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 5598 place count 1103 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1103 transition count 1102
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 5601 place count 1102 transition count 1101
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 5803 place count 1001 transition count 1201
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 6005 place count 900 transition count 1302
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 6197 place count 804 transition count 1397
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 1396
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 804 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 803 transition count 1395
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6201 place count 803 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6202 place count 802 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6203 place count 801 transition count 1393
Applied a total of 6203 rules in 672 ms. Remains 801 /3902 variables (removed 3101) and now considering 1393/3902 (removed 2509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 801/3902 places, 1393/3902 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 182508 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182508 steps, saw 114469 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1393 rows 801 cols
[2023-03-18 21:57:26] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:57:27] [INFO ] [Real]Absence check using 400 positive place invariants in 44 ms returned sat
[2023-03-18 21:57:27] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:57:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 49 ms returned sat
[2023-03-18 21:57:27] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:57:28] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-18 21:57:28] [INFO ] After 727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 1 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 24 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 801/801 places, 1393/1393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1393/1393 transitions.
Applied a total of 0 rules in 25 ms. Remains 801 /801 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
[2023-03-18 21:57:28] [INFO ] Invariant cache hit.
[2023-03-18 21:57:29] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-18 21:57:29] [INFO ] Invariant cache hit.
[2023-03-18 21:57:30] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2023-03-18 21:57:30] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:57:30] [INFO ] Invariant cache hit.
[2023-03-18 21:57:30] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2047 ms. Remains : 801/801 places, 1393/1393 transitions.
Graph (trivial) has 398 edges and 801 vertex of which 4 / 801 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 2781 edges and 799 vertex of which 797 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 795 vertex of which 4 / 795 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 793 transition count 1384
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 791 vertex of which 6 / 791 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 788 transition count 1375
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 785 vertex of which 8 / 785 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 781 transition count 1364
Reduce places removed 4 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 777 vertex of which 8 / 777 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 773 transition count 1350
Reduce places removed 4 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 769 vertex of which 8 / 769 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 765 transition count 1336
Reduce places removed 4 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 761 vertex of which 8 / 761 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 757 transition count 1322
Reduce places removed 4 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 753 vertex of which 8 / 753 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 749 transition count 1308
Reduce places removed 4 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 745 vertex of which 8 / 745 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 741 transition count 1294
Reduce places removed 4 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 737 vertex of which 8 / 737 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 733 transition count 1280
Reduce places removed 4 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 729 vertex of which 8 / 729 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 725 transition count 1266
Reduce places removed 4 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 721 vertex of which 8 / 721 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 717 transition count 1252
Reduce places removed 4 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 713 vertex of which 8 / 713 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 709 transition count 1238
Reduce places removed 4 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 705 vertex of which 8 / 705 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 701 transition count 1224
Reduce places removed 4 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 697 vertex of which 8 / 697 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 693 transition count 1210
Reduce places removed 4 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 689 vertex of which 8 / 689 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 685 transition count 1196
Reduce places removed 4 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 681 vertex of which 8 / 681 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 677 transition count 1182
Reduce places removed 4 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 673 vertex of which 8 / 673 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 669 transition count 1168
Reduce places removed 4 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 665 vertex of which 8 / 665 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 661 transition count 1154
Reduce places removed 4 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 657 vertex of which 8 / 657 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 653 transition count 1140
Reduce places removed 4 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 649 vertex of which 8 / 649 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 645 transition count 1126
Reduce places removed 4 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 641 vertex of which 8 / 641 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 637 transition count 1112
Reduce places removed 4 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 633 vertex of which 8 / 633 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 629 transition count 1098
Reduce places removed 4 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 625 vertex of which 8 / 625 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 415 place count 621 transition count 1084
Reduce places removed 4 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 617 vertex of which 8 / 617 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 613 transition count 1070
Reduce places removed 4 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 609 vertex of which 8 / 609 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 605 transition count 1056
Reduce places removed 4 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 601 vertex of which 8 / 601 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 597 transition count 1042
Reduce places removed 4 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 593 vertex of which 8 / 593 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 589 transition count 1028
Reduce places removed 4 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 585 vertex of which 8 / 585 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 581 transition count 1014
Reduce places removed 4 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 577 vertex of which 8 / 577 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 573 transition count 1000
Reduce places removed 4 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 569 vertex of which 8 / 569 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 565 transition count 986
Reduce places removed 4 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 561 vertex of which 6 / 561 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 972
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 276 edges and 555 vertex of which 4 / 555 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 31 with 14 rules applied. Total rules applied 581 place count 553 transition count 962
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 273 edges and 551 vertex of which 2 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 9 rules applied. Total rules applied 590 place count 550 transition count 956
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 33 with 5 rules applied. Total rules applied 595 place count 549 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 34 with 1 Pre rules applied. Total rules applied 595 place count 549 transition count 951
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 598 place count 547 transition count 951
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 34 with 3 rules applied. Total rules applied 601 place count 545 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 604 place count 545 transition count 947
Applied a total of 604 rules in 148 ms. Remains 545 /801 variables (removed 256) and now considering 947/1393 (removed 446) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 947 rows 545 cols
[2023-03-18 21:57:30] [INFO ] Computed 272 place invariants in 1 ms
[2023-03-18 21:57:30] [INFO ] [Real]Absence check using 272 positive place invariants in 25 ms returned sat
[2023-03-18 21:57:31] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:57:31] [INFO ] [Nat]Absence check using 272 positive place invariants in 39 ms returned sat
[2023-03-18 21:57:31] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:57:31] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-18 21:57:31] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20032 reset in 1459 ms.
Product exploration explored 100000 steps with 20032 reset in 1161 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Performed 1099 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1099 rules applied. Total rules applied 1099 place count 3902 transition count 3902
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 400 Pre rules applied. Total rules applied 1099 place count 3902 transition count 4302
Deduced a syphon composed of 1499 places in 12 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 1499 place count 3902 transition count 4302
Performed 1200 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2699 places in 8 ms
Iterating global reduction 1 with 1200 rules applied. Total rules applied 2699 place count 3902 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2700 place count 3902 transition count 4301
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 3500 place count 3102 transition count 3501
Deduced a syphon composed of 1899 places in 9 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 4300 place count 3102 transition count 3501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1900 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4301 place count 3102 transition count 3501
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4303 place count 3100 transition count 3499
Deduced a syphon composed of 1898 places in 14 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4305 place count 3100 transition count 3499
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1999 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4406 place count 3100 transition count 4231
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4507 place count 2999 transition count 4029
Deduced a syphon composed of 1898 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4608 place count 2999 transition count 4029
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 1999 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4709 place count 2999 transition count 4756
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4810 place count 2898 transition count 4554
Deduced a syphon composed of 1898 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4911 place count 2898 transition count 4554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -736
Deduced a syphon composed of 1999 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5012 place count 2898 transition count 5290
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5113 place count 2797 transition count 5088
Deduced a syphon composed of 1898 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5214 place count 2797 transition count 5088
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1993 places in 2 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5309 place count 2797 transition count 5771
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 5404 place count 2702 transition count 5581
Deduced a syphon composed of 1898 places in 2 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 5499 place count 2702 transition count 5581
Deduced a syphon composed of 1898 places in 2 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 2702 transition count 5578
Deduced a syphon composed of 1898 places in 2 ms
Applied a total of 5502 rules in 3748 ms. Remains 2702 /3902 variables (removed 1200) and now considering 5578/3902 (removed -1676) transitions.
[2023-03-18 21:57:39] [INFO ] Redundant transitions in 229 ms returned []
// Phase 1: matrix 5578 rows 2702 cols
[2023-03-18 21:57:39] [INFO ] Computed 401 place invariants in 125 ms
[2023-03-18 21:57:41] [INFO ] Dead Transitions using invariants and state equation in 2597 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2702/3902 places, 5578/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6590 ms. Remains : 2702/3902 places, 5578/3902 transitions.
Built C files in :
/tmp/ltsmin9167350729945662968
[2023-03-18 21:57:41] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9167350729945662968
Running compilation step : cd /tmp/ltsmin9167350729945662968;'/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/ltsmin9167350729945662968;'/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/ltsmin9167350729945662968;'/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 1 out of 3902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Applied a total of 0 rules in 524 ms. Remains 3902 /3902 variables (removed 0) and now considering 3902/3902 (removed 0) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:57:45] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-18 21:57:46] [INFO ] Implicit Places using invariants in 921 ms returned []
[2023-03-18 21:57:46] [INFO ] Invariant cache hit.
[2023-03-18 21:57:48] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2023-03-18 21:57:48] [INFO ] Invariant cache hit.
[2023-03-18 21:57:50] [INFO ] Dead Transitions using invariants and state equation in 2045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5207 ms. Remains : 3902/3902 places, 3902/3902 transitions.
Built C files in :
/tmp/ltsmin463805858373149032
[2023-03-18 21:57:50] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin463805858373149032
Running compilation step : cd /tmp/ltsmin463805858373149032;'/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/ltsmin463805858373149032;'/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/ltsmin463805858373149032;'/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:57:53] [INFO ] Flatten gal took : 89 ms
[2023-03-18 21:57:53] [INFO ] Flatten gal took : 88 ms
[2023-03-18 21:57:53] [INFO ] Time to serialize gal into /tmp/LTL10188941138383238762.gal : 13 ms
[2023-03-18 21:57:53] [INFO ] Time to serialize properties into /tmp/LTL1548297549972521344.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/LTL10188941138383238762.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17902255448480090103.hoa' '-atoms' '/tmp/LTL1548297549972521344.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/LTL1548297549972521344.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17902255448480090103.hoa
Detected timeout of ITS tools.
[2023-03-18 21:58:08] [INFO ] Flatten gal took : 167 ms
[2023-03-18 21:58:08] [INFO ] Flatten gal took : 100 ms
[2023-03-18 21:58:08] [INFO ] Time to serialize gal into /tmp/LTL9155746575976258496.gal : 27 ms
[2023-03-18 21:58:08] [INFO ] Time to serialize properties into /tmp/LTL18048073369194629200.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/LTL9155746575976258496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18048073369194629200.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(("(p3426==1)")||(X(X(X("(p3426==0)")))))))
Formula 0 simplified : F(!"(p3426==1)" & XXX!"(p3426==0)")
Detected timeout of ITS tools.
[2023-03-18 21:58:24] [INFO ] Flatten gal took : 57 ms
[2023-03-18 21:58:24] [INFO ] Applying decomposition
[2023-03-18 21:58:24] [INFO ] Flatten gal took : 56 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/graph4770685902157313918.txt' '-o' '/tmp/graph4770685902157313918.bin' '-w' '/tmp/graph4770685902157313918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4770685902157313918.bin' '-l' '-1' '-v' '-w' '/tmp/graph4770685902157313918.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:58:24] [INFO ] Decomposing Gal with order
[2023-03-18 21:58:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:58:25] [INFO ] Removed a total of 995 redundant transitions.
[2023-03-18 21:58:25] [INFO ] Flatten gal took : 174 ms
[2023-03-18 21:58:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 38 ms.
[2023-03-18 21:58:25] [INFO ] Time to serialize gal into /tmp/LTL2310895092070776737.gal : 36 ms
[2023-03-18 21:58:25] [INFO ] Time to serialize properties into /tmp/LTL5535145587606040284.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/LTL2310895092070776737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5535145587606040284.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(("(i39.i0.i4.u1057.p3426==1)")||(X(X(X("(i39.i0.i4.u1057.p3426==0)")))))))
Formula 0 simplified : F(!"(i39.i0.i4.u1057.p3426==1)" & XXX!"(i39.i0.i4.u1057.p3426==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10051336275420675578
[2023-03-18 21:58:40] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10051336275420675578
Running compilation step : cd /tmp/ltsmin10051336275420675578;'/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/ltsmin10051336275420675578;'/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/ltsmin10051336275420675578;'/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-LTLFireability-12 finished in 173592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((G(F(p1)) U p2))))))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 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 3916 transition count 2821
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 2821 transition count 2820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 2820 transition count 2820
Performed 792 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 792 Pre rules applied. Total rules applied 2192 place count 2820 transition count 2028
Deduced a syphon composed of 792 places in 6 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 3 with 1584 rules applied. Total rules applied 3776 place count 2028 transition count 2028
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 3788 place count 2016 transition count 2016
Iterating global reduction 3 with 12 rules applied. Total rules applied 3800 place count 2016 transition count 2016
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 3800 place count 2016 transition count 2006
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3820 place count 2006 transition count 2006
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 3 with 1798 rules applied. Total rules applied 5618 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 5619 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5621 place count 1106 transition count 1105
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 5823 place count 1005 transition count 1205
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 6025 place count 904 transition count 1305
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 4 with 192 rules applied. Total rules applied 6217 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 6219 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 6220 place count 805 transition count 1398
Applied a total of 6220 rules in 844 ms. Remains 805 /3917 variables (removed 3112) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 805 cols
[2023-03-18 21:58:44] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-18 21:58:44] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-18 21:58:44] [INFO ] Invariant cache hit.
[2023-03-18 21:58:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 21:58:46] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2023-03-18 21:58:46] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 21:58:46] [INFO ] Invariant cache hit.
[2023-03-18 21:58:46] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 805/3917 places, 1398/3917 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3022 ms. Remains : 805/3917 places, 1398/3917 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s796 1), p2:(EQ s39 1), p1:(NEQ s426 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-13 finished in 3212 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((F(p1)&&X(p2)&&p0))))'
Support contains 3 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3902 transition count 3902
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3902 transition count 3902
Applied a total of 30 rules in 849 ms. Remains 3902 /3917 variables (removed 15) and now considering 3902/3917 (removed 15) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2023-03-18 21:58:47] [INFO ] Computed 401 place invariants in 13 ms
[2023-03-18 21:58:48] [INFO ] Implicit Places using invariants in 963 ms returned []
[2023-03-18 21:58:48] [INFO ] Invariant cache hit.
[2023-03-18 21:58:49] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-18 21:58:49] [INFO ] Invariant cache hit.
[2023-03-18 21:58:52] [INFO ] Dead Transitions using invariants and state equation in 2507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3902/3917 places, 3902/3917 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5617 ms. Remains : 3902/3917 places, 3902/3917 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s826 0) (EQ s2316 1)), p1:(EQ s2224 1), p2:(EQ s2316 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 65826 steps with 0 reset in 678 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLFireability-14 finished in 6531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p1||X(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p1)||G(p2))))))'
Found a Lengthening insensitive property : ShieldRVt-PT-100B-LTLFireability-11
Stuttering acceptance computed with spot in 287 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 3917 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3917/3917 places, 3917/3917 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1093 transitions
Trivial Post-agglo rules discarded 1093 transitions
Performed 1093 trivial Post agglomeration. Transition count delta: 1093
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 3916 transition count 2823
Reduce places removed 1093 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1094 rules applied. Total rules applied 2187 place count 2823 transition count 2822
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2188 place count 2822 transition count 2822
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 791 Pre rules applied. Total rules applied 2188 place count 2822 transition count 2031
Deduced a syphon composed of 791 places in 7 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 3 with 1582 rules applied. Total rules applied 3770 place count 2031 transition count 2031
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 3782 place count 2019 transition count 2019
Iterating global reduction 3 with 12 rules applied. Total rules applied 3794 place count 2019 transition count 2019
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 3794 place count 2019 transition count 2009
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3814 place count 2009 transition count 2009
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 3 with 1802 rules applied. Total rules applied 5616 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 5617 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 5619 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 4 with 202 rules applied. Total rules applied 5821 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6023 place count 905 transition count 1306
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6213 place count 810 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6215 place count 808 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6216 place count 807 transition count 1398
Applied a total of 6216 rules in 861 ms. Remains 807 /3917 variables (removed 3110) and now considering 1398/3917 (removed 2519) transitions.
// Phase 1: matrix 1398 rows 807 cols
[2023-03-18 21:58:54] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:58:55] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-18 21:58:55] [INFO ] Invariant cache hit.
[2023-03-18 21:58:56] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2023-03-18 21:58:56] [INFO ] Invariant cache hit.
[2023-03-18 21:58:56] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 807/3917 places, 1398/3917 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2988 ms. Remains : 807/3917 places, 1398/3917 transitions.
Running random walk in product with property : ShieldRVt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s248 1) (EQ s252 1)), p2:(EQ s35 1), p0:(OR (EQ s276 1) (EQ s430 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 932 ms.
Product exploration explored 100000 steps with 27 reset in 1162 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 (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 110675 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 110675 steps, saw 67381 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :2
Running SMT prover for 12 properties.
[2023-03-18 21:59:04] [INFO ] Invariant cache hit.
[2023-03-18 21:59:04] [INFO ] [Real]Absence check using 400 positive place invariants in 39 ms returned sat
[2023-03-18 21:59:04] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:59:05] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2023-03-18 21:59:06] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:59:06] [INFO ] After 1696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 383 ms.
[2023-03-18 21:59:07] [INFO ] After 2424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 2707 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1398/1398 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 807 transition count 1397
Applied a total of 1 rules in 24 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 807/807 places, 1397/1398 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 309 ms. (steps per millisecond=32 ) 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 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 54160 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54160 steps, saw 29960 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-18 21:59:14] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-18 21:59:14] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2023-03-18 21:59:14] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:59:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2023-03-18 21:59:16] [INFO ] After 848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:59:16] [INFO ] After 1583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-18 21:59:17] [INFO ] After 2475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3087 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 35 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 32 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-18 21:59:20] [INFO ] Invariant cache hit.
[2023-03-18 21:59:21] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-18 21:59:21] [INFO ] Invariant cache hit.
[2023-03-18 21:59:21] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2023-03-18 21:59:21] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 21:59:21] [INFO ] Invariant cache hit.
[2023-03-18 21:59:22] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2023 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 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 2790 edges and 805 vertex of which 803 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 801 vertex of which 4 / 801 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 799 transition count 1388
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 797 vertex of which 6 / 797 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 794 transition count 1379
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 791 vertex of which 8 / 791 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 787 transition count 1368
Reduce places removed 4 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 783 vertex of which 8 / 783 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 779 transition count 1354
Reduce places removed 4 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 775 vertex of which 8 / 775 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 771 transition count 1340
Reduce places removed 4 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 767 vertex of which 8 / 767 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 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 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 755 transition count 1312
Reduce places removed 4 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 751 vertex of which 8 / 751 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 747 transition count 1298
Reduce places removed 4 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 743 vertex of which 8 / 743 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 739 transition count 1284
Reduce places removed 4 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 735 vertex of which 8 / 735 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 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 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 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 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 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 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 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 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 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 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 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 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 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 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 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 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 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 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 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 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 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 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 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 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 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 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 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 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 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 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 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 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 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 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 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 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 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 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 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 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 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 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 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 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 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 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 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 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 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 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 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 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 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 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 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 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 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 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 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 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 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 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 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 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 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 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 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
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 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
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 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
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 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
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 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 242 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-18 21:59:22] [INFO ] Computed 212 place invariants in 2 ms
[2023-03-18 21:59:22] [INFO ] [Real]Absence check using 212 positive place invariants in 26 ms returned sat
[2023-03-18 21:59:23] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:59:23] [INFO ] [Nat]Absence check using 212 positive place invariants in 28 ms returned sat
[2023-03-18 21:59:23] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:59:24] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-18 21:59:24] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 414 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 226 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Applied a total of 0 rules in 24 ms. Remains 807 /807 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 807 cols
[2023-03-18 21:59:25] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:59:25] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-18 21:59:25] [INFO ] Invariant cache hit.
[2023-03-18 21:59:26] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2023-03-18 21:59:27] [INFO ] Invariant cache hit.
[2023-03-18 21:59:27] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2196 ms. Remains : 807/807 places, 1398/1398 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 (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 84497 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 84497 steps, saw 49323 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :2
Running SMT prover for 12 properties.
[2023-03-18 21:59:32] [INFO ] Invariant cache hit.
[2023-03-18 21:59:32] [INFO ] [Real]Absence check using 400 positive place invariants in 48 ms returned sat
[2023-03-18 21:59:33] [INFO ] After 776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:59:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 45 ms returned sat
[2023-03-18 21:59:34] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:59:35] [INFO ] After 1471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 536 ms.
[2023-03-18 21:59:35] [INFO ] After 2387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 3149 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1398/1398 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 807 transition count 1397
Applied a total of 1 rules in 28 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 807/807 places, 1397/1398 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 95970 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95970 steps, saw 58519 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1397 rows 807 cols
[2023-03-18 21:59:43] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-18 21:59:43] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2023-03-18 21:59:44] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:59:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 45 ms returned sat
[2023-03-18 21:59:45] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:59:45] [INFO ] After 1239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-18 21:59:45] [INFO ] After 1919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2833 ms.
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 28 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 807/807 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1397/1397 transitions.
Applied a total of 0 rules in 26 ms. Remains 807 /807 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-18 21:59:48] [INFO ] Invariant cache hit.
[2023-03-18 21:59:49] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-18 21:59:49] [INFO ] Invariant cache hit.
[2023-03-18 21:59:50] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2023-03-18 21:59:50] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:59:50] [INFO ] Invariant cache hit.
[2023-03-18 21:59:50] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2084 ms. Remains : 807/807 places, 1397/1397 transitions.
Graph (trivial) has 396 edges and 807 vertex of which 4 / 807 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 2790 edges and 805 vertex of which 803 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 801 vertex of which 4 / 801 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 799 transition count 1388
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 797 vertex of which 6 / 797 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 794 transition count 1379
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 791 vertex of which 8 / 791 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 787 transition count 1368
Reduce places removed 4 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 783 vertex of which 8 / 783 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 779 transition count 1354
Reduce places removed 4 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 775 vertex of which 8 / 775 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 771 transition count 1340
Reduce places removed 4 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 767 vertex of which 8 / 767 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 763 transition count 1326
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 759 vertex of which 8 / 759 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 755 transition count 1312
Reduce places removed 4 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 751 vertex of which 8 / 751 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 747 transition count 1298
Reduce places removed 4 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 743 vertex of which 8 / 743 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 739 transition count 1284
Reduce places removed 4 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 735 vertex of which 8 / 735 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 731 transition count 1270
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 727 vertex of which 8 / 727 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 723 transition count 1256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 719 vertex of which 8 / 719 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 715 transition count 1242
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 350 edges and 711 vertex of which 8 / 711 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 707 transition count 1228
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 346 edges and 703 vertex of which 8 / 703 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 699 transition count 1214
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 342 edges and 695 vertex of which 8 / 695 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 691 transition count 1200
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 338 edges and 687 vertex of which 8 / 687 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 683 transition count 1186
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 334 edges and 679 vertex of which 8 / 679 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 675 transition count 1172
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 330 edges and 671 vertex of which 8 / 671 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 667 transition count 1158
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 326 edges and 663 vertex of which 8 / 663 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 659 transition count 1144
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 322 edges and 655 vertex of which 8 / 655 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 651 transition count 1130
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 318 edges and 647 vertex of which 8 / 647 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 643 transition count 1116
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 314 edges and 639 vertex of which 8 / 639 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 635 transition count 1102
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 310 edges and 631 vertex of which 8 / 631 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 415 place count 627 transition count 1088
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 306 edges and 623 vertex of which 8 / 623 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 619 transition count 1074
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 302 edges and 615 vertex of which 8 / 615 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 611 transition count 1060
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 298 edges and 607 vertex of which 8 / 607 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 603 transition count 1046
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 294 edges and 599 vertex of which 8 / 599 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 595 transition count 1032
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 290 edges and 591 vertex of which 8 / 591 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 587 transition count 1018
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 286 edges and 583 vertex of which 8 / 583 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 579 transition count 1004
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 282 edges and 575 vertex of which 8 / 575 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 571 transition count 990
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 278 edges and 567 vertex of which 8 / 567 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 563 transition count 976
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 274 edges and 559 vertex of which 8 / 559 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 555 transition count 962
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 270 edges and 551 vertex of which 8 / 551 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 547 transition count 948
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 266 edges and 543 vertex of which 8 / 543 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 539 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 262 edges and 535 vertex of which 8 / 535 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 531 transition count 920
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 258 edges and 527 vertex of which 8 / 527 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 523 transition count 906
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 254 edges and 519 vertex of which 8 / 519 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 515 transition count 892
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 250 edges and 511 vertex of which 8 / 511 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 700 place count 507 transition count 878
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 246 edges and 503 vertex of which 8 / 503 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 499 transition count 864
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 242 edges and 495 vertex of which 8 / 495 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 491 transition count 850
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 8 / 487 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 757 place count 483 transition count 836
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 234 edges and 479 vertex of which 8 / 479 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 475 transition count 822
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 230 edges and 471 vertex of which 8 / 471 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 467 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 463 vertex of which 8 / 463 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 459 transition count 794
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 455 vertex of which 8 / 455 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 451 transition count 780
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 447 vertex of which 6 / 447 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 444 transition count 766
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 214 edges and 441 vertex of which 4 / 441 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 14 rules applied. Total rules applied 866 place count 439 transition count 756
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 211 edges and 437 vertex of which 2 / 437 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 9 rules applied. Total rules applied 875 place count 436 transition count 750
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 48 with 5 rules applied. Total rules applied 880 place count 435 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 1 Pre rules applied. Total rules applied 880 place count 435 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 49 with 3 rules applied. Total rules applied 883 place count 433 transition count 745
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 49 with 3 rules applied. Total rules applied 886 place count 431 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 49 with 3 rules applied. Total rules applied 889 place count 431 transition count 741
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 891 place count 431 transition count 739
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 892 place count 431 transition count 739
Applied a total of 892 rules in 249 ms. Remains 431 /807 variables (removed 376) and now considering 739/1397 (removed 658) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 739 rows 431 cols
[2023-03-18 21:59:51] [INFO ] Computed 212 place invariants in 4 ms
[2023-03-18 21:59:51] [INFO ] [Real]Absence check using 212 positive place invariants in 25 ms returned sat
[2023-03-18 21:59:51] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 21:59:51] [INFO ] [Nat]Absence check using 212 positive place invariants in 25 ms returned sat
[2023-03-18 21:59:52] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 21:59:52] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-18 21:59:52] [INFO ] After 1077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 385 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 23 reset in 885 ms.
Product exploration explored 100000 steps with 18 reset in 1068 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 337 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, p1, (NOT p2), (AND p1 (NOT p2))]
Support contains 5 out of 807 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 807/807 places, 1398/1398 transitions.
Applied a total of 0 rules in 36 ms. Remains 807 /807 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2023-03-18 21:59:56] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1398 rows 807 cols
[2023-03-18 21:59:56] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-18 21:59:56] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 798 ms. Remains : 807/807 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin12397321089101465637
[2023-03-18 21:59:57] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12397321089101465637
Running compilation step : cd /tmp/ltsmin12397321089101465637;'/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 2732 ms.
Running link step : cd /tmp/ltsmin12397321089101465637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin12397321089101465637;'/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/stateBased6459753037614354737.hoa' '--buchi-type=spotba'
LTSmin run took 766 ms.
Treatment of property ShieldRVt-PT-100B-LTLFireability-11 finished in 67216 ms.
FORMULA ShieldRVt-PT-100B-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(X(X(p1))))))'
[2023-03-18 22:00:00] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6150590107193177618
[2023-03-18 22:00:00] [INFO ] Too many transitions (3917) to apply POR reductions. Disabling POR matrices.
[2023-03-18 22:00:00] [INFO ] Applying decomposition
[2023-03-18 22:00:00] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6150590107193177618
Running compilation step : cd /tmp/ltsmin6150590107193177618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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 22:00:01] [INFO ] Flatten gal took : 139 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/graph4535431304323213239.txt' '-o' '/tmp/graph4535431304323213239.bin' '-w' '/tmp/graph4535431304323213239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4535431304323213239.bin' '-l' '-1' '-v' '-w' '/tmp/graph4535431304323213239.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:00:01] [INFO ] Decomposing Gal with order
[2023-03-18 22:00:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:00:02] [INFO ] Removed a total of 984 redundant transitions.
[2023-03-18 22:00:02] [INFO ] Flatten gal took : 189 ms
[2023-03-18 22:00:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-18 22:00:02] [INFO ] Time to serialize gal into /tmp/LTLFireability11611179366409997434.gal : 42 ms
[2023-03-18 22:00:02] [INFO ] Time to serialize properties into /tmp/LTLFireability5935020794354918756.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/LTLFireability11611179366409997434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5935020794354918756.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 2 LTL properties
Checking formula 0 : !((X(("(i23.i1.i1.u335.p1039==0)")&&(X(G(("(i44.i0.i4.u1280.p4115==0)")||(X("(i48.i0.i1.u1420.p4572==0)"))))))))
Formula 0 simplified : X(!"(i23.i1.i1.u335.p1039==0)" | XF(!"(i44.i0.i4.u1280.p4115==0)" & X!"(i48.i0.i1.u1420.p4572==0)"))
Compilation finished in 10283 ms.
Running link step : cd /tmp/ltsmin6150590107193177618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6150590107193177618;'/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)&&X([](((LTLAPp1==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 22:24:00] [INFO ] Applying decomposition
[2023-03-18 22:24:00] [INFO ] Flatten gal took : 228 ms
[2023-03-18 22:24:00] [INFO ] Decomposing Gal with order
[2023-03-18 22:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:24:02] [INFO ] Removed a total of 294 redundant transitions.
[2023-03-18 22:24:02] [INFO ] Flatten gal took : 295 ms
[2023-03-18 22:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2023-03-18 22:24:03] [INFO ] Time to serialize gal into /tmp/LTLFireability10224146355013736209.gal : 101 ms
[2023-03-18 22:24:03] [INFO ] Time to serialize properties into /tmp/LTLFireability12172891121500444803.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/LTLFireability10224146355013736209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12172891121500444803.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...278
Read 2 LTL properties
Checking formula 0 : !((X(("(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.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....440
Formula 0 simplified : X(!"(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.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...430
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin6150590107193177618;'/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)&&X([](((LTLAPp1==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6150590107193177618;'/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' '[](((LTLAPp6==true)||X(X(X((LTLAPp7==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 22:48:01] [INFO ] Flatten gal took : 203 ms
[2023-03-18 22:48:01] [INFO ] Input system was already deterministic with 3917 transitions.
[2023-03-18 22:48:01] [INFO ] Transformed 3917 places.
[2023-03-18 22:48:01] [INFO ] Transformed 3917 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:48:04] [INFO ] Time to serialize gal into /tmp/LTLFireability13881671996825960916.gal : 27 ms
[2023-03-18 22:48:04] [INFO ] Time to serialize properties into /tmp/LTLFireability218808381369522076.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/LTLFireability13881671996825960916.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability218808381369522076.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 2 LTL properties
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12983388 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16031656 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905975100348"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;