Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716700164.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 868K 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 ShieldIIPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679431650768

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:47:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 20:47:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:47:33] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2023-03-21 20:47:33] [INFO ] Transformed 2503 places.
[2023-03-21 20:47:33] [INFO ] Transformed 2403 transitions.
[2023-03-21 20:47:33] [INFO ] Found NUPN structural information;
[2023-03-21 20:47:33] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-100A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 220 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:47:34] [INFO ] Computed 901 place invariants in 33 ms
[2023-03-21 20:47:36] [INFO ] Implicit Places using invariants in 2111 ms returned []
[2023-03-21 20:47:36] [INFO ] Invariant cache hit.
[2023-03-21 20:47:39] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 4820 ms to find 0 implicit places.
[2023-03-21 20:47:39] [INFO ] Invariant cache hit.
[2023-03-21 20:47:40] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6565 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 58 out of 2503 places after structural reductions.
[2023-03-21 20:47:41] [INFO ] Flatten gal took : 311 ms
[2023-03-21 20:47:41] [INFO ] Flatten gal took : 238 ms
[2023-03-21 20:47:41] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-21 20:47:44] [INFO ] Invariant cache hit.
[2023-03-21 20:47:45] [INFO ] [Real]Absence check using 901 positive place invariants in 231 ms returned sat
[2023-03-21 20:47:50] [INFO ] After 5666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 20:47:51] [INFO ] [Nat]Absence check using 901 positive place invariants in 233 ms returned sat
[2023-03-21 20:48:15] [INFO ] After 22802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 20:48:15] [INFO ] After 22812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 20:48:15] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 4584 ms.
Support contains 31 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 42 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 682 times.
Drop transitions removed 682 transitions
Iterating global reduction 0 with 682 rules applied. Total rules applied 686 place count 2501 transition count 2401
Applied a total of 686 rules in 526 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 62123 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{3=1, 5=1}
Probabilistic random walk after 62123 steps, saw 59194 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:48:25] [INFO ] Computed 901 place invariants in 61 ms
[2023-03-21 20:48:26] [INFO ] [Real]Absence check using 893 positive place invariants in 249 ms returned sat
[2023-03-21 20:48:26] [INFO ] [Real]Absence check using 893 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-21 20:48:29] [INFO ] After 4758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 20:48:30] [INFO ] [Nat]Absence check using 893 positive place invariants in 274 ms returned sat
[2023-03-21 20:48:30] [INFO ] [Nat]Absence check using 893 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-21 20:48:54] [INFO ] After 23476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:48:54] [INFO ] State equation strengthened by 4 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:48:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:48:54] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 399 ms.
Support contains 28 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 2401
Applied a total of 1 rules in 195 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 55033 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55033 steps, saw 52321 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:49:00] [INFO ] Computed 901 place invariants in 78 ms
[2023-03-21 20:49:01] [INFO ] [Real]Absence check using 893 positive place invariants in 354 ms returned sat
[2023-03-21 20:49:01] [INFO ] [Real]Absence check using 893 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-21 20:49:04] [INFO ] After 4257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 20:49:05] [INFO ] [Nat]Absence check using 893 positive place invariants in 237 ms returned sat
[2023-03-21 20:49:05] [INFO ] [Nat]Absence check using 893 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-21 20:49:29] [INFO ] After 23297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 20:49:29] [INFO ] State equation strengthened by 4 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:49:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:49:29] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 99 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:49:29] [INFO ] Invariant cache hit.
[2023-03-21 20:49:31] [INFO ] Implicit Places using invariants in 1926 ms returned []
[2023-03-21 20:49:31] [INFO ] Invariant cache hit.
[2023-03-21 20:49:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:49:38] [INFO ] Implicit Places using invariants and state equation in 6749 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8707 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8908 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 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' '!(G(F((p0&&X(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 86 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:49:38] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-21 20:49:40] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2023-03-21 20:49:40] [INFO ] Invariant cache hit.
[2023-03-21 20:49:45] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 6204 ms to find 0 implicit places.
[2023-03-21 20:49:45] [INFO ] Invariant cache hit.
[2023-03-21 20:49:47] [INFO ] Dead Transitions using invariants and state equation in 2260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8552 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 489 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2150 0), p1:(OR (EQ s936 0) (EQ s940 0) (EQ s951 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33422 reset in 5954 ms.
Product exploration explored 100000 steps with 33423 reset in 5923 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:50:01] [INFO ] Invariant cache hit.
[2023-03-21 20:50:01] [INFO ] [Real]Absence check using 901 positive place invariants in 263 ms returned sat
[2023-03-21 20:50:03] [INFO ] After 2454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:50:04] [INFO ] [Nat]Absence check using 901 positive place invariants in 231 ms returned sat
[2023-03-21 20:50:06] [INFO ] After 1615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:50:06] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 12 ms to minimize.
[2023-03-21 20:50:06] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-21 20:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2023-03-21 20:50:07] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2023-03-21 20:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-21 20:50:07] [INFO ] After 2788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 449 ms.
[2023-03-21 20:50:07] [INFO ] After 4172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 273 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 365 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 110910 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110910 steps, saw 109218 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 20:50:11] [INFO ] Computed 900 place invariants in 14 ms
[2023-03-21 20:50:12] [INFO ] [Real]Absence check using 897 positive place invariants in 262 ms returned sat
[2023-03-21 20:50:12] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-21 20:50:14] [INFO ] After 2559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:50:15] [INFO ] [Nat]Absence check using 897 positive place invariants in 238 ms returned sat
[2023-03-21 20:50:15] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-21 20:50:16] [INFO ] After 1686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:50:17] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2023-03-21 20:50:17] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 1 ms to minimize.
[2023-03-21 20:50:18] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 2 ms to minimize.
[2023-03-21 20:50:18] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2023-03-21 20:50:18] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-21 20:50:19] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 0 ms to minimize.
[2023-03-21 20:50:19] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 0 ms to minimize.
[2023-03-21 20:50:19] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 1 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 0 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-21 20:50:23] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2023-03-21 20:50:24] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2023-03-21 20:50:24] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 2 ms to minimize.
[2023-03-21 20:50:24] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-21 20:50:25] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-21 20:50:25] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 0 ms to minimize.
[2023-03-21 20:50:25] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
[2023-03-21 20:50:26] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-21 20:50:26] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-21 20:50:26] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2023-03-21 20:50:26] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9932 ms
[2023-03-21 20:50:27] [INFO ] After 11923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-21 20:50:27] [INFO ] After 13012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 120 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 79 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:50:27] [INFO ] Invariant cache hit.
[2023-03-21 20:50:30] [INFO ] Implicit Places using invariants in 2387 ms returned []
[2023-03-21 20:50:30] [INFO ] Invariant cache hit.
[2023-03-21 20:50:35] [INFO ] Implicit Places using invariants and state equation in 5099 ms returned []
Implicit Place search using SMT with State Equation took 7489 ms to find 0 implicit places.
[2023-03-21 20:50:35] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-21 20:50:35] [INFO ] Invariant cache hit.
[2023-03-21 20:50:37] [INFO ] Dead Transitions using invariants and state equation in 2409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10199 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 85 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 20:50:37] [INFO ] Invariant cache hit.
[2023-03-21 20:50:38] [INFO ] [Real]Absence check using 897 positive place invariants in 229 ms returned sat
[2023-03-21 20:50:38] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 20:50:40] [INFO ] After 2255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:50:40] [INFO ] [Nat]Absence check using 897 positive place invariants in 247 ms returned sat
[2023-03-21 20:50:40] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 20:50:43] [INFO ] After 2468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:50:43] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-21 20:50:44] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-21 20:50:44] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-21 20:50:44] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-21 20:50:45] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 2 ms to minimize.
[2023-03-21 20:50:45] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 0 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-21 20:50:46] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-21 20:50:47] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-21 20:50:47] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-21 20:50:47] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 0 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 3 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
[2023-03-21 20:50:51] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7490 ms
[2023-03-21 20:50:51] [INFO ] After 10380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3626 ms.
[2023-03-21 20:50:55] [INFO ] After 14872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 75 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:50:55] [INFO ] Computed 901 place invariants in 14 ms
[2023-03-21 20:50:57] [INFO ] Implicit Places using invariants in 1573 ms returned []
[2023-03-21 20:50:57] [INFO ] Invariant cache hit.
[2023-03-21 20:51:02] [INFO ] Implicit Places using invariants and state equation in 5274 ms returned []
Implicit Place search using SMT with State Equation took 6857 ms to find 0 implicit places.
[2023-03-21 20:51:02] [INFO ] Invariant cache hit.
[2023-03-21 20:51:04] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8373 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:51:05] [INFO ] Invariant cache hit.
[2023-03-21 20:51:05] [INFO ] [Real]Absence check using 901 positive place invariants in 203 ms returned sat
[2023-03-21 20:51:07] [INFO ] After 2063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:51:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 253 ms returned sat
[2023-03-21 20:51:09] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 27 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1714 ms
[2023-03-21 20:51:11] [INFO ] After 3121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-21 20:51:11] [INFO ] After 4014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 112 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 34 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 443 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145350 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145350 steps, saw 143312 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 20:51:15] [INFO ] Computed 900 place invariants in 41 ms
[2023-03-21 20:51:15] [INFO ] [Real]Absence check using 897 positive place invariants in 237 ms returned sat
[2023-03-21 20:51:15] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 20:51:17] [INFO ] After 2289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:51:18] [INFO ] [Nat]Absence check using 897 positive place invariants in 176 ms returned sat
[2023-03-21 20:51:18] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-21 20:51:19] [INFO ] After 1414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:51:20] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 10 ms to minimize.
[2023-03-21 20:51:20] [INFO ] Deduced a trap composed of 11 places in 360 ms of which 1 ms to minimize.
[2023-03-21 20:51:21] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 1 ms to minimize.
[2023-03-21 20:51:21] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 0 ms to minimize.
[2023-03-21 20:51:21] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 1 ms to minimize.
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 1 ms to minimize.
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 0 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 0 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 0 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 0 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 0 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 2 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 0 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 2 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 2 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 0 ms to minimize.
[2023-03-21 20:51:28] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 2 ms to minimize.
[2023-03-21 20:51:28] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 0 ms to minimize.
[2023-03-21 20:51:28] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 0 ms to minimize.
[2023-03-21 20:51:29] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2023-03-21 20:51:29] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-21 20:51:29] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2023-03-21 20:51:30] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2023-03-21 20:51:30] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-21 20:51:30] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2023-03-21 20:51:31] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 1 ms to minimize.
[2023-03-21 20:51:31] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2023-03-21 20:51:31] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 11805 ms
[2023-03-21 20:51:31] [INFO ] After 13329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-21 20:51:31] [INFO ] After 14163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 135 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 65 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:51:31] [INFO ] Invariant cache hit.
[2023-03-21 20:51:34] [INFO ] Implicit Places using invariants in 2356 ms returned []
[2023-03-21 20:51:34] [INFO ] Invariant cache hit.
[2023-03-21 20:51:39] [INFO ] Implicit Places using invariants and state equation in 5341 ms returned []
Implicit Place search using SMT with State Equation took 7721 ms to find 0 implicit places.
[2023-03-21 20:51:39] [INFO ] Redundant transitions in 196 ms returned []
[2023-03-21 20:51:39] [INFO ] Invariant cache hit.
[2023-03-21 20:51:41] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9462 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 131 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 20:51:41] [INFO ] Invariant cache hit.
[2023-03-21 20:51:42] [INFO ] [Real]Absence check using 897 positive place invariants in 239 ms returned sat
[2023-03-21 20:51:42] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 20:51:43] [INFO ] After 2263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:51:44] [INFO ] [Nat]Absence check using 897 positive place invariants in 192 ms returned sat
[2023-03-21 20:51:44] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-21 20:51:45] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:51:45] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 1 ms to minimize.
[2023-03-21 20:51:46] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 0 ms to minimize.
[2023-03-21 20:51:46] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:51:47] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-21 20:51:47] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2023-03-21 20:51:47] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2023-03-21 20:51:48] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2023-03-21 20:51:48] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2023-03-21 20:51:48] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 1 ms to minimize.
[2023-03-21 20:51:49] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 0 ms to minimize.
[2023-03-21 20:51:49] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2023-03-21 20:51:50] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:51:50] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2023-03-21 20:51:50] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2023-03-21 20:51:51] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-21 20:51:51] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 0 ms to minimize.
[2023-03-21 20:51:51] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 0 ms to minimize.
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 0 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 0 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 12371 ms
[2023-03-21 20:51:58] [INFO ] After 13760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-21 20:51:58] [INFO ] After 14521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 549 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33318 reset in 6074 ms.
Product exploration explored 100000 steps with 33337 reset in 6061 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 127 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:52:11] [INFO ] Computed 901 place invariants in 14 ms
[2023-03-21 20:52:13] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2023-03-21 20:52:13] [INFO ] Invariant cache hit.
[2023-03-21 20:52:15] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 3480 ms to find 0 implicit places.
[2023-03-21 20:52:15] [INFO ] Invariant cache hit.
[2023-03-21 20:52:16] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5006 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-01 finished in 158381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 210 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:52:17] [INFO ] Computed 901 place invariants in 9 ms
[2023-03-21 20:52:18] [INFO ] Implicit Places using invariants in 1569 ms returned []
[2023-03-21 20:52:18] [INFO ] Invariant cache hit.
[2023-03-21 20:52:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:52:24] [INFO ] Implicit Places using invariants and state equation in 5387 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6965 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 143 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7319 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2154 1) (EQ s2169 1)), p1:(NEQ s2315 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 188 reset in 1505 ms.
Product exploration explored 100000 steps with 186 reset in 1917 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 353 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 567 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 318 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:52:29] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-21 20:52:33] [INFO ] [Real]Absence check using 900 positive place invariants in 1379 ms returned sat
[2023-03-21 20:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:52:44] [INFO ] [Real]Absence check using state equation in 10572 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 92 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:52:44] [INFO ] Invariant cache hit.
[2023-03-21 20:52:46] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2023-03-21 20:52:46] [INFO ] Invariant cache hit.
[2023-03-21 20:52:48] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2023-03-21 20:52:48] [INFO ] Redundant transitions in 414 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:52:48] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-21 20:52:50] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 99 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6319 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 556 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-21 20:52:52] [INFO ] Invariant cache hit.
[2023-03-21 20:52:56] [INFO ] [Real]Absence check using 900 positive place invariants in 1304 ms returned sat
[2023-03-21 20:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:53:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 188 reset in 1503 ms.
Product exploration explored 100000 steps with 187 reset in 1744 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 102 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:53:10] [INFO ] Invariant cache hit.
[2023-03-21 20:53:11] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2023-03-21 20:53:11] [INFO ] Invariant cache hit.
[2023-03-21 20:53:16] [INFO ] Implicit Places using invariants and state equation in 4970 ms returned []
Implicit Place search using SMT with State Equation took 6194 ms to find 0 implicit places.
[2023-03-21 20:53:17] [INFO ] Redundant transitions in 344 ms returned []
[2023-03-21 20:53:17] [INFO ] Invariant cache hit.
[2023-03-21 20:53:18] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8115 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-02 finished in 61644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U (!p1&&F(!p2)))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 64 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:53:18] [INFO ] Computed 901 place invariants in 10 ms
[2023-03-21 20:53:20] [INFO ] Implicit Places using invariants in 2023 ms returned []
[2023-03-21 20:53:20] [INFO ] Invariant cache hit.
[2023-03-21 20:53:22] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 4036 ms to find 0 implicit places.
[2023-03-21 20:53:22] [INFO ] Invariant cache hit.
[2023-03-21 20:53:25] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6384 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR p2 p1), (OR p1 p2), p0, p2]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1113 1) (EQ s1123 1) (EQ s1125 1)), p2:(AND (EQ s938 1) (EQ s946 1) (EQ s952 1)), p0:(OR (AND (EQ s1113 1) (EQ s1123 1) (EQ s1125 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8061 ms.
Product exploration explored 100000 steps with 50000 reset in 8253 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 7 factoid took 231 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-03 finished in 23177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&G(!p0))))))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 200 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:53:42] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-21 20:53:43] [INFO ] Implicit Places using invariants in 1635 ms returned []
[2023-03-21 20:53:43] [INFO ] Invariant cache hit.
[2023-03-21 20:53:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:53:46] [INFO ] Implicit Places using invariants and state equation in 2195 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
[2023-03-21 20:53:46] [INFO ] Redundant transitions in 429 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2023-03-21 20:53:46] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-21 20:53:48] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 83 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6136 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 233 ms :[p0, (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1462 1) (EQ s1495 1)), p1:(AND (EQ s6 1) (EQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 19 reset in 1682 ms.
Product exploration explored 100000 steps with 19 reset in 1910 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 609 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:53:53] [INFO ] Invariant cache hit.
[2023-03-21 20:53:54] [INFO ] [Real]Absence check using 901 positive place invariants in 309 ms returned sat
[2023-03-21 20:53:56] [INFO ] After 2654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:53:56] [INFO ] [Nat]Absence check using 901 positive place invariants in 325 ms returned sat
[2023-03-21 20:54:15] [INFO ] After 18197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:54:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 20:54:21] [INFO ] After 6010ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-21 20:54:21] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 387 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2501 transition count 2400
Applied a total of 696 rules in 137 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 112375 steps, run timeout after 3002 ms. (steps per millisecond=37 ) properties seen :{0=1}
Probabilistic random walk after 112375 steps, saw 109750 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2023-03-21 20:54:25] [INFO ] Computed 901 place invariants in 16 ms
[2023-03-21 20:54:25] [INFO ] [Real]Absence check using 899 positive place invariants in 221 ms returned sat
[2023-03-21 20:54:25] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 20:54:27] [INFO ] After 2506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:54:28] [INFO ] [Nat]Absence check using 899 positive place invariants in 224 ms returned sat
[2023-03-21 20:54:28] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-21 20:54:38] [INFO ] After 11043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 157 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142096 steps, run timeout after 3002 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142096 steps, saw 137965 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:54:42] [INFO ] Invariant cache hit.
[2023-03-21 20:54:42] [INFO ] [Real]Absence check using 899 positive place invariants in 205 ms returned sat
[2023-03-21 20:54:42] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:54:44] [INFO ] After 2197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:54:45] [INFO ] [Nat]Absence check using 899 positive place invariants in 215 ms returned sat
[2023-03-21 20:54:45] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:54:55] [INFO ] After 10941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 102 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 96 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:54:55] [INFO ] Invariant cache hit.
[2023-03-21 20:54:57] [INFO ] Implicit Places using invariants in 1677 ms returned []
[2023-03-21 20:54:57] [INFO ] Invariant cache hit.
[2023-03-21 20:54:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 20:55:03] [INFO ] Implicit Places using invariants and state equation in 6458 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8143 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8352 ms. Remains : 2500/2501 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131622 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131622 steps, saw 127808 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:55:07] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-21 20:55:07] [INFO ] [Real]Absence check using 898 positive place invariants in 165 ms returned sat
[2023-03-21 20:55:07] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-21 20:55:09] [INFO ] After 2169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:55:10] [INFO ] [Nat]Absence check using 898 positive place invariants in 200 ms returned sat
[2023-03-21 20:55:10] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:55:20] [INFO ] After 11191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 124 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:55:20] [INFO ] Invariant cache hit.
[2023-03-21 20:55:23] [INFO ] Implicit Places using invariants in 3048 ms returned []
[2023-03-21 20:55:23] [INFO ] Invariant cache hit.
[2023-03-21 20:55:29] [INFO ] Implicit Places using invariants and state equation in 5735 ms returned []
Implicit Place search using SMT with State Equation took 8824 ms to find 0 implicit places.
[2023-03-21 20:55:29] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-21 20:55:29] [INFO ] Invariant cache hit.
[2023-03-21 20:55:31] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10485 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 109 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 20:55:31] [INFO ] Invariant cache hit.
[2023-03-21 20:55:31] [INFO ] [Real]Absence check using 898 positive place invariants in 254 ms returned sat
[2023-03-21 20:55:31] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 20:55:33] [INFO ] After 2226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:55:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 251 ms returned sat
[2023-03-21 20:55:34] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:55:44] [INFO ] After 10977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (OR p1 p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 13 factoid took 902 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2023-03-21 20:55:45] [INFO ] Computed 901 place invariants in 31 ms
[2023-03-21 20:55:47] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2023-03-21 20:55:47] [INFO ] Invariant cache hit.
[2023-03-21 20:55:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 20:55:53] [INFO ] Implicit Places using invariants and state equation in 5815 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7657 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 110 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7842 ms. Remains : 2500/2501 places, 2400/2400 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 439 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:55:55] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-21 20:55:55] [INFO ] [Real]Absence check using 900 positive place invariants in 275 ms returned sat
[2023-03-21 20:55:57] [INFO ] After 2434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:55:58] [INFO ] [Nat]Absence check using 900 positive place invariants in 246 ms returned sat
[2023-03-21 20:56:07] [INFO ] After 9536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:56:08] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-21 20:56:08] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 0 ms to minimize.
[2023-03-21 20:56:08] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2023-03-21 20:56:09] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-21 20:56:09] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2023-03-21 20:56:09] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-21 20:56:09] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-21 20:56:10] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-21 20:56:10] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-21 20:56:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2567 ms
[2023-03-21 20:56:16] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 0 ms to minimize.
[2023-03-21 20:56:16] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2023-03-21 20:56:17] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-21 20:56:17] [INFO ] Deduced a trap composed of 19 places in 550 ms of which 1 ms to minimize.
[2023-03-21 20:56:18] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-21 20:56:18] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-21 20:56:18] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 1 ms to minimize.
[2023-03-21 20:56:19] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-21 20:56:19] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2023-03-21 20:56:20] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 0 ms to minimize.
[2023-03-21 20:56:20] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 6 ms to minimize.
[2023-03-21 20:56:21] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 0 ms to minimize.
[2023-03-21 20:56:21] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-21 20:56:21] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2023-03-21 20:56:22] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 0 ms to minimize.
[2023-03-21 20:56:22] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-21 20:56:25] [INFO ] Deduced a trap composed of 3 places in 2721 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:56:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:56:25] [INFO ] After 27742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 642 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2400
Applied a total of 696 rules in 225 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 103921 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{0=1}
Probabilistic random walk after 103921 steps, saw 101507 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:56:29] [INFO ] Computed 900 place invariants in 16 ms
[2023-03-21 20:56:30] [INFO ] [Real]Absence check using 898 positive place invariants in 235 ms returned sat
[2023-03-21 20:56:30] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 20:56:32] [INFO ] After 2486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:56:32] [INFO ] [Nat]Absence check using 898 positive place invariants in 193 ms returned sat
[2023-03-21 20:56:32] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 20:56:43] [INFO ] After 11163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 135 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 142013 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142013 steps, saw 137881 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:56:46] [INFO ] Invariant cache hit.
[2023-03-21 20:56:47] [INFO ] [Real]Absence check using 898 positive place invariants in 193 ms returned sat
[2023-03-21 20:56:47] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 20:56:48] [INFO ] After 2239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:56:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 246 ms returned sat
[2023-03-21 20:56:49] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:57:00] [INFO ] After 11102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 185 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:57:00] [INFO ] Invariant cache hit.
[2023-03-21 20:57:03] [INFO ] Implicit Places using invariants in 2926 ms returned []
[2023-03-21 20:57:03] [INFO ] Invariant cache hit.
[2023-03-21 20:57:08] [INFO ] Implicit Places using invariants and state equation in 5690 ms returned []
Implicit Place search using SMT with State Equation took 8629 ms to find 0 implicit places.
[2023-03-21 20:57:09] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-21 20:57:09] [INFO ] Invariant cache hit.
[2023-03-21 20:57:10] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10310 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 115 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 20:57:10] [INFO ] Invariant cache hit.
[2023-03-21 20:57:11] [INFO ] [Real]Absence check using 898 positive place invariants in 203 ms returned sat
[2023-03-21 20:57:11] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 20:57:12] [INFO ] After 2339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:57:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 263 ms returned sat
[2023-03-21 20:57:13] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 20:57:23] [INFO ] After 10930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 449 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 284 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 19 reset in 1582 ms.
Product exploration explored 100000 steps with 19 reset in 1850 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:57:28] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:57:29] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2023-03-21 20:57:29] [INFO ] Invariant cache hit.
[2023-03-21 20:57:34] [INFO ] Implicit Places using invariants and state equation in 4839 ms returned []
Implicit Place search using SMT with State Equation took 6174 ms to find 0 implicit places.
[2023-03-21 20:57:35] [INFO ] Redundant transitions in 355 ms returned []
[2023-03-21 20:57:35] [INFO ] Invariant cache hit.
[2023-03-21 20:57:37] [INFO ] Dead Transitions using invariants and state equation in 2447 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9102 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-06 finished in 235691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G((p1||F(p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 80 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:57:37] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-21 20:57:40] [INFO ] Implicit Places using invariants in 2362 ms returned []
[2023-03-21 20:57:40] [INFO ] Invariant cache hit.
[2023-03-21 20:57:44] [INFO ] Implicit Places using invariants and state equation in 4433 ms returned []
Implicit Place search using SMT with State Equation took 6800 ms to find 0 implicit places.
[2023-03-21 20:57:44] [INFO ] Invariant cache hit.
[2023-03-21 20:57:46] [INFO ] Dead Transitions using invariants and state equation in 2264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9158 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1688 ms.
Product exploration explored 100000 steps with 29 reset in 1970 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 487 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1944 steps, including 0 resets, run visited all 2 properties in 61 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 559 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-21 20:57:52] [INFO ] Invariant cache hit.
[2023-03-21 20:57:56] [INFO ] [Real]Absence check using 901 positive place invariants in 1010 ms returned sat
[2023-03-21 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:58:07] [INFO ] [Real]Absence check using state equation in 11022 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 220 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:58:07] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-21 20:58:09] [INFO ] Implicit Places using invariants in 2010 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2019 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 103 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2342 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 2031 steps, including 0 resets, run visited all 2 properties in 60 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:58:11] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:58:14] [INFO ] [Real]Absence check using 900 positive place invariants in 1052 ms returned sat
[2023-03-21 20:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:58:26] [INFO ] [Real]Absence check using state equation in 11171 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 29 reset in 1605 ms.
Product exploration explored 100000 steps with 30 reset in 1774 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 90 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 20:58:29] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 20:58:31] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2023-03-21 20:58:31] [INFO ] Invariant cache hit.
[2023-03-21 20:58:35] [INFO ] Implicit Places using invariants and state equation in 3993 ms returned []
Implicit Place search using SMT with State Equation took 5804 ms to find 0 implicit places.
[2023-03-21 20:58:36] [INFO ] Redundant transitions in 561 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-21 20:58:36] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-21 20:58:37] [INFO ] Dead Transitions using invariants and state equation in 1530 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2500 places, 2399/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8082 ms. Remains : 2499/2500 places, 2399/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-07 finished in 60209 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(p0)) U p1)))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 62 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:58:37] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-21 20:58:39] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2023-03-21 20:58:39] [INFO ] Invariant cache hit.
[2023-03-21 20:58:44] [INFO ] Implicit Places using invariants and state equation in 4834 ms returned []
Implicit Place search using SMT with State Equation took 6508 ms to find 0 implicit places.
[2023-03-21 20:58:44] [INFO ] Invariant cache hit.
[2023-03-21 20:58:45] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7975 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 210 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s486 1) (EQ s490 1) (EQ s502 1)), p1:(AND (EQ s786 1) (EQ s790 1) (EQ s802 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4057 steps with 0 reset in 179 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-08 finished in 8414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 90 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:58:46] [INFO ] Invariant cache hit.
[2023-03-21 20:58:47] [INFO ] Implicit Places using invariants in 1561 ms returned []
[2023-03-21 20:58:47] [INFO ] Invariant cache hit.
[2023-03-21 20:58:52] [INFO ] Implicit Places using invariants and state equation in 4594 ms returned []
Implicit Place search using SMT with State Equation took 6155 ms to find 0 implicit places.
[2023-03-21 20:58:52] [INFO ] Invariant cache hit.
[2023-03-21 20:58:55] [INFO ] Dead Transitions using invariants and state equation in 2537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8784 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s738 0) (EQ s746 0) (EQ s750 0) (EQ s2408 0) (EQ s2423 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1785 ms.
Product exploration explored 100000 steps with 19 reset in 1763 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 100279 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100279 steps, saw 93896 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:59:02] [INFO ] Invariant cache hit.
[2023-03-21 20:59:03] [INFO ] [Real]Absence check using 901 positive place invariants in 216 ms returned sat
[2023-03-21 20:59:05] [INFO ] After 2405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:59:05] [INFO ] [Nat]Absence check using 901 positive place invariants in 183 ms returned sat
[2023-03-21 20:59:11] [INFO ] After 5968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:59:16] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 1 ms to minimize.
[2023-03-21 20:59:16] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 0 ms to minimize.
[2023-03-21 20:59:17] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 0 ms to minimize.
[2023-03-21 20:59:17] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2023-03-21 20:59:18] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 0 ms to minimize.
[2023-03-21 20:59:18] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 0 ms to minimize.
[2023-03-21 20:59:19] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 1 ms to minimize.
[2023-03-21 20:59:19] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-21 20:59:19] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2023-03-21 20:59:20] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 0 ms to minimize.
[2023-03-21 20:59:20] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 0 ms to minimize.
[2023-03-21 20:59:21] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 0 ms to minimize.
[2023-03-21 20:59:21] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2023-03-21 20:59:21] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 0 ms to minimize.
[2023-03-21 20:59:22] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 0 ms to minimize.
[2023-03-21 20:59:22] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2023-03-21 20:59:23] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-21 20:59:23] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 1 ms to minimize.
[2023-03-21 20:59:23] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2023-03-21 20:59:24] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 1 ms to minimize.
[2023-03-21 20:59:24] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-21 20:59:24] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-21 20:59:25] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2023-03-21 20:59:25] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:59:25] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2023-03-21 20:59:26] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-21 20:59:26] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2023-03-21 20:59:26] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2023-03-21 20:59:27] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2023-03-21 20:59:27] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2023-03-21 20:59:27] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2023-03-21 20:59:28] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-21 20:59:28] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2023-03-21 20:59:28] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2023-03-21 20:59:28] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 12947 ms
[2023-03-21 20:59:29] [INFO ] After 23143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1165 ms.
[2023-03-21 20:59:30] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 355 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 291 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131837 steps, run timeout after 3002 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131837 steps, saw 129943 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:59:34] [INFO ] Computed 901 place invariants in 43 ms
[2023-03-21 20:59:34] [INFO ] [Real]Absence check using 898 positive place invariants in 221 ms returned sat
[2023-03-21 20:59:34] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 20:59:36] [INFO ] After 2506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:59:37] [INFO ] [Nat]Absence check using 898 positive place invariants in 185 ms returned sat
[2023-03-21 20:59:37] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-21 20:59:47] [INFO ] After 10944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 132 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 161 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:59:47] [INFO ] Invariant cache hit.
[2023-03-21 20:59:50] [INFO ] Implicit Places using invariants in 2970 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2975 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 113 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3249 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 167481 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167481 steps, saw 165083 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:59:54] [INFO ] Computed 900 place invariants in 40 ms
[2023-03-21 20:59:55] [INFO ] [Real]Absence check using 897 positive place invariants in 211 ms returned sat
[2023-03-21 20:59:55] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 20:59:56] [INFO ] After 2460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:59:57] [INFO ] [Nat]Absence check using 897 positive place invariants in 214 ms returned sat
[2023-03-21 20:59:57] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:00:07] [INFO ] After 11223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 97 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 68 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:00:08] [INFO ] Invariant cache hit.
[2023-03-21 21:00:10] [INFO ] Implicit Places using invariants in 2107 ms returned []
[2023-03-21 21:00:10] [INFO ] Invariant cache hit.
[2023-03-21 21:00:15] [INFO ] Implicit Places using invariants and state equation in 5271 ms returned []
Implicit Place search using SMT with State Equation took 7390 ms to find 0 implicit places.
[2023-03-21 21:00:15] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-21 21:00:15] [INFO ] Invariant cache hit.
[2023-03-21 21:00:18] [INFO ] Dead Transitions using invariants and state equation in 2450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10037 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 21:00:18] [INFO ] Invariant cache hit.
[2023-03-21 21:00:18] [INFO ] [Real]Absence check using 897 positive place invariants in 191 ms returned sat
[2023-03-21 21:00:18] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:00:20] [INFO ] After 2204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:00:21] [INFO ] [Nat]Absence check using 897 positive place invariants in 203 ms returned sat
[2023-03-21 21:00:21] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 21:00:26] [INFO ] After 5542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:00:35] [INFO ] After 14584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-21 21:00:35] [INFO ] After 15258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 133 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 21:00:36] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-21 21:00:38] [INFO ] Implicit Places using invariants in 2082 ms returned []
[2023-03-21 21:00:38] [INFO ] Invariant cache hit.
[2023-03-21 21:00:40] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 4076 ms to find 0 implicit places.
[2023-03-21 21:00:40] [INFO ] Invariant cache hit.
[2023-03-21 21:00:43] [INFO ] Dead Transitions using invariants and state equation in 2553 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6765 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99876 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99876 steps, saw 93508 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:00:46] [INFO ] Invariant cache hit.
[2023-03-21 21:00:47] [INFO ] [Real]Absence check using 901 positive place invariants in 238 ms returned sat
[2023-03-21 21:00:48] [INFO ] After 2319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:00:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 199 ms returned sat
[2023-03-21 21:00:56] [INFO ] After 6771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:01:00] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2023-03-21 21:01:01] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2023-03-21 21:01:01] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2023-03-21 21:01:02] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 0 ms to minimize.
[2023-03-21 21:01:02] [INFO ] Deduced a trap composed of 11 places in 374 ms of which 1 ms to minimize.
[2023-03-21 21:01:02] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-21 21:01:03] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2023-03-21 21:01:03] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-21 21:01:04] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 1 ms to minimize.
[2023-03-21 21:01:04] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-21 21:01:05] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2023-03-21 21:01:05] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 1 ms to minimize.
[2023-03-21 21:01:05] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-21 21:01:06] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 1 ms to minimize.
[2023-03-21 21:01:06] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 2 ms to minimize.
[2023-03-21 21:01:07] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 0 ms to minimize.
[2023-03-21 21:01:07] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 0 ms to minimize.
[2023-03-21 21:01:07] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-21 21:01:08] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2023-03-21 21:01:08] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2023-03-21 21:01:08] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-21 21:01:09] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-21 21:01:09] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-21 21:01:09] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-21 21:01:09] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-21 21:01:10] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 0 ms to minimize.
[2023-03-21 21:01:10] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-21 21:01:10] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2023-03-21 21:01:11] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 0 ms to minimize.
[2023-03-21 21:01:11] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2023-03-21 21:01:11] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2023-03-21 21:01:12] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 13 ms to minimize.
[2023-03-21 21:01:12] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-21 21:01:12] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-21 21:01:12] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 12343 ms
[2023-03-21 21:01:12] [INFO ] After 23275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1163 ms.
[2023-03-21 21:01:14] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 183 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 386 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145096 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145096 steps, saw 143068 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 21:01:17] [INFO ] Computed 901 place invariants in 26 ms
[2023-03-21 21:01:18] [INFO ] [Real]Absence check using 898 positive place invariants in 246 ms returned sat
[2023-03-21 21:01:18] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:01:20] [INFO ] After 2445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:01:20] [INFO ] [Nat]Absence check using 898 positive place invariants in 200 ms returned sat
[2023-03-21 21:01:20] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 39 ms returned sat
[2023-03-21 21:01:31] [INFO ] After 11205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 127 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 100 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:01:31] [INFO ] Invariant cache hit.
[2023-03-21 21:01:34] [INFO ] Implicit Places using invariants in 2245 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2247 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 128 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2475 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 149291 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149291 steps, saw 147217 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:01:37] [INFO ] Computed 900 place invariants in 39 ms
[2023-03-21 21:01:38] [INFO ] [Real]Absence check using 897 positive place invariants in 259 ms returned sat
[2023-03-21 21:01:38] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-21 21:01:39] [INFO ] After 2475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:01:40] [INFO ] [Nat]Absence check using 897 positive place invariants in 206 ms returned sat
[2023-03-21 21:01:40] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-21 21:01:50] [INFO ] After 9645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:01:59] [INFO ] After 18683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-21 21:01:59] [INFO ] After 19405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 165 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 99 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 114 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:01:59] [INFO ] Invariant cache hit.
[2023-03-21 21:02:01] [INFO ] Implicit Places using invariants in 2195 ms returned []
[2023-03-21 21:02:01] [INFO ] Invariant cache hit.
[2023-03-21 21:02:07] [INFO ] Implicit Places using invariants and state equation in 5329 ms returned []
Implicit Place search using SMT with State Equation took 7544 ms to find 0 implicit places.
[2023-03-21 21:02:07] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-21 21:02:07] [INFO ] Invariant cache hit.
[2023-03-21 21:02:10] [INFO ] Dead Transitions using invariants and state equation in 2522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10393 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 117 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 21:02:10] [INFO ] Invariant cache hit.
[2023-03-21 21:02:10] [INFO ] [Real]Absence check using 897 positive place invariants in 235 ms returned sat
[2023-03-21 21:02:10] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:02:12] [INFO ] After 2256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:02:13] [INFO ] [Nat]Absence check using 897 positive place invariants in 247 ms returned sat
[2023-03-21 21:02:13] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 21:02:18] [INFO ] After 5218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:02:27] [INFO ] After 14249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-21 21:02:27] [INFO ] After 14979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1799 ms.
Product exploration explored 100000 steps with 19 reset in 2211 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 24 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 20 ms
Applied a total of 2 rules in 562 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 21:02:33] [INFO ] Redundant transitions in 356 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-21 21:02:33] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-21 21:02:36] [INFO ] Dead Transitions using invariants and state equation in 2388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 17 ms
Applied a total of 0 rules in 192 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3505 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 21:02:36] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-21 21:02:38] [INFO ] Implicit Places using invariants in 2299 ms returned []
[2023-03-21 21:02:38] [INFO ] Invariant cache hit.
[2023-03-21 21:02:41] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 5061 ms to find 0 implicit places.
[2023-03-21 21:02:41] [INFO ] Invariant cache hit.
[2023-03-21 21:02:42] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6592 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-09 finished in 236651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X(X(G(p1))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 88 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 21:02:43] [INFO ] Invariant cache hit.
[2023-03-21 21:02:45] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2023-03-21 21:02:45] [INFO ] Invariant cache hit.
[2023-03-21 21:02:50] [INFO ] Implicit Places using invariants and state equation in 5549 ms returned []
Implicit Place search using SMT with State Equation took 7756 ms to find 0 implicit places.
[2023-03-21 21:02:50] [INFO ] Invariant cache hit.
[2023-03-21 21:02:52] [INFO ] Dead Transitions using invariants and state equation in 1999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9867 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1164 1) (EQ s1185 1) (EQ s608 1) (EQ s622 1) (EQ s2287 1) (EQ s2320 1)), p0:(AND (EQ s608 1) (EQ s622 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5114 steps with 0 reset in 104 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-10 finished in 10219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||F(p1)) U p2)||G(F(p3)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 21:02:53] [INFO ] Invariant cache hit.
[2023-03-21 21:02:55] [INFO ] Implicit Places using invariants in 1933 ms returned []
[2023-03-21 21:02:55] [INFO ] Invariant cache hit.
[2023-03-21 21:02:59] [INFO ] Implicit Places using invariants and state equation in 4788 ms returned []
Implicit Place search using SMT with State Equation took 6735 ms to find 0 implicit places.
[2023-03-21 21:03:00] [INFO ] Invariant cache hit.
[2023-03-21 21:03:01] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8699 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s16 1)), p3:(OR (EQ s6 0) (EQ s16 0) (EQ s1358 0) (EQ s1373 0)), p0:(AND (EQ s1358 1) (EQ s1373 1)), p1:(EQ s1325 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 1913 ms.
Product exploration explored 100000 steps with 31 reset in 2243 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 561 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 21:03:08] [INFO ] Invariant cache hit.
[2023-03-21 21:03:08] [INFO ] [Real]Absence check using 901 positive place invariants in 228 ms returned sat
[2023-03-21 21:03:11] [INFO ] After 2811ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-21 21:03:11] [INFO ] [Nat]Absence check using 901 positive place invariants in 279 ms returned sat
[2023-03-21 21:03:19] [INFO ] After 8202ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-21 21:03:20] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 1 ms to minimize.
[2023-03-21 21:03:20] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2023-03-21 21:03:21] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-21 21:03:21] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 15 ms to minimize.
[2023-03-21 21:03:21] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 0 ms to minimize.
[2023-03-21 21:03:22] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2023-03-21 21:03:22] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-21 21:03:22] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 1 ms to minimize.
[2023-03-21 21:03:23] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2023-03-21 21:03:23] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 0 ms to minimize.
[2023-03-21 21:03:23] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 1 ms to minimize.
[2023-03-21 21:03:24] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2023-03-21 21:03:24] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-21 21:03:24] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 13 ms to minimize.
[2023-03-21 21:03:25] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-21 21:03:25] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-21 21:03:25] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-21 21:03:25] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 0 ms to minimize.
[2023-03-21 21:03:26] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2023-03-21 21:03:26] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-21 21:03:26] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2023-03-21 21:03:26] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-21 21:03:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-21 21:03:27] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7042 ms
[2023-03-21 21:03:37] [INFO ] Deduced a trap composed of 3 places in 1855 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-21 21:03:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:03:37] [INFO ] After 26875ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 875 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 351 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96391 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96391 steps, saw 94875 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 21:03:42] [INFO ] Computed 901 place invariants in 42 ms
[2023-03-21 21:03:43] [INFO ] [Real]Absence check using 899 positive place invariants in 194 ms returned sat
[2023-03-21 21:03:43] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 21:03:45] [INFO ] After 2720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:03:46] [INFO ] [Nat]Absence check using 899 positive place invariants in 257 ms returned sat
[2023-03-21 21:03:46] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 21:03:56] [INFO ] After 10284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:03:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:03:58] [INFO ] After 1557ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:04:07] [INFO ] After 10568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-21 21:04:07] [INFO ] After 21627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 273 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 106 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 111 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:04:07] [INFO ] Invariant cache hit.
[2023-03-21 21:04:09] [INFO ] Implicit Places using invariants in 1992 ms returned []
[2023-03-21 21:04:09] [INFO ] Invariant cache hit.
[2023-03-21 21:04:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:04:17] [INFO ] Implicit Places using invariants and state equation in 8094 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10098 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 135 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10345 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 94432 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94432 steps, saw 92938 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:04:21] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-21 21:04:22] [INFO ] [Real]Absence check using 898 positive place invariants in 340 ms returned sat
[2023-03-21 21:04:22] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 21:04:23] [INFO ] After 2658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:04:24] [INFO ] [Nat]Absence check using 898 positive place invariants in 251 ms returned sat
[2023-03-21 21:04:24] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 21:04:35] [INFO ] After 10627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:04:37] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 0 ms to minimize.
[2023-03-21 21:04:37] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-21 21:04:38] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2023-03-21 21:04:38] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-21 21:04:38] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-21 21:04:38] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 1 ms to minimize.
[2023-03-21 21:04:39] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-21 21:04:39] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-21 21:04:39] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2023-03-21 21:04:39] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-21 21:04:40] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-21 21:04:40] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 5 ms to minimize.
[2023-03-21 21:04:40] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-21 21:04:40] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-21 21:04:40] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-21 21:04:42] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-21 21:04:42] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-21 21:04:42] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2023-03-21 21:04:42] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-21 21:04:43] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-21 21:04:43] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-21 21:04:43] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2023-03-21 21:04:44] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-21 21:04:44] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-21 21:04:44] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-21 21:04:44] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-21 21:04:45] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-21 21:04:45] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2023-03-21 21:04:45] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2023-03-21 21:04:46] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2023-03-21 21:04:46] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-21 21:04:46] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2023-03-21 21:04:46] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2023-03-21 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9693 ms
[2023-03-21 21:04:46] [INFO ] After 22263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-21 21:04:47] [INFO ] After 23094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 104 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 81 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 134 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:04:47] [INFO ] Invariant cache hit.
[2023-03-21 21:04:49] [INFO ] Implicit Places using invariants in 1912 ms returned []
[2023-03-21 21:04:49] [INFO ] Invariant cache hit.
[2023-03-21 21:04:55] [INFO ] Implicit Places using invariants and state equation in 5732 ms returned []
Implicit Place search using SMT with State Equation took 7671 ms to find 0 implicit places.
[2023-03-21 21:04:55] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-21 21:04:55] [INFO ] Invariant cache hit.
[2023-03-21 21:04:57] [INFO ] Dead Transitions using invariants and state equation in 2614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10518 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 856 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 124 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 21:04:59] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-21 21:05:01] [INFO ] Implicit Places using invariants in 2004 ms returned []
[2023-03-21 21:05:01] [INFO ] Invariant cache hit.
[2023-03-21 21:05:06] [INFO ] Implicit Places using invariants and state equation in 5176 ms returned []
Implicit Place search using SMT with State Equation took 7196 ms to find 0 implicit places.
[2023-03-21 21:05:06] [INFO ] Invariant cache hit.
[2023-03-21 21:05:08] [INFO ] Dead Transitions using invariants and state equation in 2227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9548 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 435 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 21:05:10] [INFO ] Invariant cache hit.
[2023-03-21 21:05:10] [INFO ] [Real]Absence check using 901 positive place invariants in 206 ms returned sat
[2023-03-21 21:05:12] [INFO ] After 2354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:05:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 241 ms returned sat
[2023-03-21 21:05:23] [INFO ] After 10529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:05:24] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-21 21:05:24] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-21 21:05:25] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-21 21:05:25] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-21 21:05:25] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-21 21:05:25] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-21 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1549 ms
[2023-03-21 21:05:25] [INFO ] After 12663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-21 21:05:26] [INFO ] After 13627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 249 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 327 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 103842 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103842 steps, saw 102235 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 21:05:30] [INFO ] Computed 901 place invariants in 54 ms
[2023-03-21 21:05:31] [INFO ] [Real]Absence check using 899 positive place invariants in 211 ms returned sat
[2023-03-21 21:05:31] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-21 21:05:32] [INFO ] After 2664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:05:33] [INFO ] [Nat]Absence check using 899 positive place invariants in 222 ms returned sat
[2023-03-21 21:05:33] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 21:05:44] [INFO ] After 10436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:05:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:05:46] [INFO ] After 2033ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:05:46] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-21 21:05:46] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-21 21:05:47] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-21 21:05:47] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 0 ms to minimize.
[2023-03-21 21:05:48] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-21 21:05:52] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-21 21:05:55] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-21 21:05:55] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-21 21:05:55] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2023-03-21 21:05:56] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 0 ms to minimize.
[2023-03-21 21:05:56] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-21 21:05:57] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 11622 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:05:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:05:57] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 271 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:05:58] [INFO ] Invariant cache hit.
[2023-03-21 21:06:00] [INFO ] Implicit Places using invariants in 2170 ms returned []
[2023-03-21 21:06:00] [INFO ] Invariant cache hit.
[2023-03-21 21:06:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:06:07] [INFO ] Implicit Places using invariants and state equation in 7132 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9319 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 103 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9502 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 115467 steps, run timeout after 3002 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115467 steps, saw 113724 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:06:11] [INFO ] Computed 900 place invariants in 39 ms
[2023-03-21 21:06:12] [INFO ] [Real]Absence check using 898 positive place invariants in 215 ms returned sat
[2023-03-21 21:06:12] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 21:06:13] [INFO ] After 2536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:06:14] [INFO ] [Nat]Absence check using 898 positive place invariants in 201 ms returned sat
[2023-03-21 21:06:14] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-21 21:06:25] [INFO ] After 10706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:06:29] [INFO ] Deduced a trap composed of 5 places in 398 ms of which 0 ms to minimize.
[2023-03-21 21:06:30] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2023-03-21 21:06:30] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-21 21:06:30] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-21 21:06:31] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-21 21:06:31] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2023-03-21 21:06:31] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-21 21:06:31] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-21 21:06:32] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-21 21:06:32] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-21 21:06:32] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2023-03-21 21:06:33] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-21 21:06:33] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-21 21:06:33] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2023-03-21 21:06:33] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-21 21:06:34] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-21 21:06:34] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2023-03-21 21:06:34] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 0 ms to minimize.
[2023-03-21 21:06:35] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 0 ms to minimize.
[2023-03-21 21:06:38] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 9802 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:06:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:06:38] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 542 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 126 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:06:39] [INFO ] Invariant cache hit.
[2023-03-21 21:06:42] [INFO ] Implicit Places using invariants in 2668 ms returned []
[2023-03-21 21:06:42] [INFO ] Invariant cache hit.
[2023-03-21 21:06:49] [INFO ] Implicit Places using invariants and state equation in 6681 ms returned []
Implicit Place search using SMT with State Equation took 9387 ms to find 0 implicit places.
[2023-03-21 21:06:49] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-21 21:06:49] [INFO ] Invariant cache hit.
[2023-03-21 21:06:51] [INFO ] Dead Transitions using invariants and state equation in 2620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12205 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 809 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 34 reset in 1585 ms.
Product exploration explored 100000 steps with 35 reset in 1795 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 12 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 14 ms
Applied a total of 2 rules in 209 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 21:06:58] [INFO ] Redundant transitions in 720 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-21 21:06:58] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-21 21:07:00] [INFO ] Dead Transitions using invariants and state equation in 2257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 16 ms
Applied a total of 0 rules in 128 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3373 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 21:07:00] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-21 21:07:03] [INFO ] Implicit Places using invariants in 2436 ms returned []
[2023-03-21 21:07:03] [INFO ] Invariant cache hit.
[2023-03-21 21:07:05] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 4613 ms to find 0 implicit places.
[2023-03-21 21:07:05] [INFO ] Invariant cache hit.
[2023-03-21 21:07:07] [INFO ] Dead Transitions using invariants and state equation in 1690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6389 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-11 finished in 254072 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(p0))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 65 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 21:07:07] [INFO ] Invariant cache hit.
[2023-03-21 21:07:09] [INFO ] Implicit Places using invariants in 2315 ms returned []
[2023-03-21 21:07:09] [INFO ] Invariant cache hit.
[2023-03-21 21:07:14] [INFO ] Implicit Places using invariants and state equation in 5229 ms returned []
Implicit Place search using SMT with State Equation took 7583 ms to find 0 implicit places.
[2023-03-21 21:07:14] [INFO ] Invariant cache hit.
[2023-03-21 21:07:17] [INFO ] Dead Transitions using invariants and state equation in 2183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9845 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s513 1) (EQ s523 1) (EQ s525 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 5047 steps with 0 reset in 85 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-12 finished in 10261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 229 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 21:07:17] [INFO ] Computed 900 place invariants in 12 ms
[2023-03-21 21:07:19] [INFO ] Implicit Places using invariants in 1844 ms returned []
[2023-03-21 21:07:19] [INFO ] Invariant cache hit.
[2023-03-21 21:07:21] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 3386 ms to find 0 implicit places.
[2023-03-21 21:07:21] [INFO ] Redundant transitions in 510 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-21 21:07:21] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 21:07:23] [INFO ] Dead Transitions using invariants and state equation in 1778 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 95 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6051 ms. Remains : 2499/2503 places, 2399/2403 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19 reset in 1834 ms.
Product exploration explored 100000 steps with 19 reset in 2138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Finished random walk after 709 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 334 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 94 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-21 21:07:28] [INFO ] Invariant cache hit.
[2023-03-21 21:07:30] [INFO ] Implicit Places using invariants in 2166 ms returned []
[2023-03-21 21:07:30] [INFO ] Invariant cache hit.
[2023-03-21 21:07:35] [INFO ] Implicit Places using invariants and state equation in 4254 ms returned []
Implicit Place search using SMT with State Equation took 6454 ms to find 0 implicit places.
[2023-03-21 21:07:35] [INFO ] Redundant transitions in 481 ms returned []
[2023-03-21 21:07:35] [INFO ] Invariant cache hit.
[2023-03-21 21:07:37] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8718 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 4038 steps, including 1 resets, run visited all 1 properties in 56 ms. (steps per millisecond=72 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19 reset in 2050 ms.
Product exploration explored 100000 steps with 19 reset in 1802 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-21 21:07:41] [INFO ] Invariant cache hit.
[2023-03-21 21:07:44] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2023-03-21 21:07:44] [INFO ] Invariant cache hit.
[2023-03-21 21:07:48] [INFO ] Implicit Places using invariants and state equation in 4136 ms returned []
Implicit Place search using SMT with State Equation took 6526 ms to find 0 implicit places.
[2023-03-21 21:07:48] [INFO ] Redundant transitions in 387 ms returned []
[2023-03-21 21:07:48] [INFO ] Invariant cache hit.
[2023-03-21 21:07:50] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8971 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-13 finished in 33496 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' '!((!p0 U (G(!p0)||(!p0&&(p1||X(!p2))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 188 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 21:07:51] [INFO ] Computed 901 place invariants in 4 ms
[2023-03-21 21:07:52] [INFO ] Implicit Places using invariants in 1473 ms returned []
[2023-03-21 21:07:52] [INFO ] Invariant cache hit.
[2023-03-21 21:07:55] [INFO ] Implicit Places using invariants and state equation in 2688 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
[2023-03-21 21:07:55] [INFO ] Invariant cache hit.
[2023-03-21 21:07:56] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5856 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, p0, (AND p0 p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1083 1) (EQ s1097 1)), p1:(AND (EQ s1322 1) (EQ s75 1)), p2:(AND (EQ s1906 1) (EQ s1916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8267 ms.
Product exploration explored 100000 steps with 50000 reset in 8476 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-14 finished in 23114 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 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 94 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 21:08:14] [INFO ] Invariant cache hit.
[2023-03-21 21:08:15] [INFO ] Implicit Places using invariants in 1333 ms returned []
[2023-03-21 21:08:15] [INFO ] Invariant cache hit.
[2023-03-21 21:08:18] [INFO ] Implicit Places using invariants and state equation in 2482 ms returned []
Implicit Place search using SMT with State Equation took 3851 ms to find 0 implicit places.
[2023-03-21 21:08:18] [INFO ] Invariant cache hit.
[2023-03-21 21:08:19] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5829 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-15 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 (OR (EQ s2007 0) (EQ s2009 0)) (OR (EQ s1661 0) (EQ s1665 0) (EQ s1676 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 763 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-15 finished in 6005 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&&X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100A-LTLFireability-01
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 240 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 21:08:20] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-21 21:08:22] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2023-03-21 21:08:22] [INFO ] Invariant cache hit.
[2023-03-21 21:08:26] [INFO ] Implicit Places using invariants and state equation in 4310 ms returned []
Implicit Place search using SMT with State Equation took 5696 ms to find 0 implicit places.
[2023-03-21 21:08:26] [INFO ] Invariant cache hit.
[2023-03-21 21:08:27] [INFO ] Dead Transitions using invariants and state equation in 1459 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7409 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2149 0), p1:(OR (EQ s935 0) (EQ s939 0) (EQ s950 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33234 reset in 2104 ms.
Product exploration explored 100000 steps with 33320 reset in 2474 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 638 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:08:33] [INFO ] Invariant cache hit.
[2023-03-21 21:08:34] [INFO ] [Real]Absence check using 900 positive place invariants in 301 ms returned sat
[2023-03-21 21:08:36] [INFO ] After 2352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:08:36] [INFO ] [Nat]Absence check using 900 positive place invariants in 470 ms returned sat
[2023-03-21 21:08:38] [INFO ] After 1485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:08:38] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-03-21 21:08:38] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2023-03-21 21:08:39] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-21 21:08:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-21 21:08:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 894 ms
[2023-03-21 21:08:39] [INFO ] After 2501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-21 21:08:39] [INFO ] After 3537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 78 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 165 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142805 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142805 steps, saw 141009 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 21:08:43] [INFO ] Computed 900 place invariants in 14 ms
[2023-03-21 21:08:43] [INFO ] [Real]Absence check using 900 positive place invariants in 234 ms returned sat
[2023-03-21 21:08:45] [INFO ] After 2359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:08:46] [INFO ] [Nat]Absence check using 900 positive place invariants in 167 ms returned sat
[2023-03-21 21:08:47] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:08:47] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-21 21:08:48] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 1 ms to minimize.
[2023-03-21 21:08:48] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-21 21:08:48] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2023-03-21 21:08:49] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-21 21:08:49] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-21 21:08:49] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 0 ms to minimize.
[2023-03-21 21:08:50] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-21 21:08:50] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
[2023-03-21 21:08:50] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-21 21:08:50] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 0 ms to minimize.
[2023-03-21 21:08:51] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-21 21:08:51] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2023-03-21 21:08:51] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-21 21:08:51] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2023-03-21 21:08:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4196 ms
[2023-03-21 21:08:51] [INFO ] After 5748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-21 21:08:52] [INFO ] After 6580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 116 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 94 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 21:08:52] [INFO ] Invariant cache hit.
[2023-03-21 21:08:54] [INFO ] Implicit Places using invariants in 1761 ms returned []
[2023-03-21 21:08:54] [INFO ] Invariant cache hit.
[2023-03-21 21:08:59] [INFO ] Implicit Places using invariants and state equation in 5254 ms returned []
Implicit Place search using SMT with State Equation took 7028 ms to find 0 implicit places.
[2023-03-21 21:08:59] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-21 21:08:59] [INFO ] Invariant cache hit.
[2023-03-21 21:09:01] [INFO ] Dead Transitions using invariants and state equation in 1958 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9176 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 21:09:01] [INFO ] Invariant cache hit.
[2023-03-21 21:09:02] [INFO ] [Real]Absence check using 900 positive place invariants in 340 ms returned sat
[2023-03-21 21:09:03] [INFO ] After 2166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:09:04] [INFO ] [Nat]Absence check using 900 positive place invariants in 252 ms returned sat
[2023-03-21 21:09:05] [INFO ] After 1351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:09:06] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 0 ms to minimize.
[2023-03-21 21:09:06] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2023-03-21 21:09:06] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2023-03-21 21:09:07] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2023-03-21 21:09:07] [INFO ] Deduced a trap composed of 29 places in 293 ms of which 1 ms to minimize.
[2023-03-21 21:09:07] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 0 ms to minimize.
[2023-03-21 21:09:08] [INFO ] Deduced a trap composed of 14 places in 357 ms of which 1 ms to minimize.
[2023-03-21 21:09:08] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-21 21:09:08] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-21 21:09:09] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 0 ms to minimize.
[2023-03-21 21:09:09] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2023-03-21 21:09:09] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2023-03-21 21:09:10] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 1 ms to minimize.
[2023-03-21 21:09:10] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 0 ms to minimize.
[2023-03-21 21:09:10] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 0 ms to minimize.
[2023-03-21 21:09:10] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-21 21:09:11] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-21 21:09:11] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-21 21:09:11] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-21 21:09:11] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-21 21:09:12] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6226 ms
[2023-03-21 21:09:12] [INFO ] After 7656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-21 21:09:12] [INFO ] After 8515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 461 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 81 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 21:09:13] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-21 21:09:14] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2023-03-21 21:09:14] [INFO ] Invariant cache hit.
[2023-03-21 21:09:16] [INFO ] Implicit Places using invariants and state equation in 2098 ms returned []
Implicit Place search using SMT with State Equation took 3669 ms to find 0 implicit places.
[2023-03-21 21:09:16] [INFO ] Invariant cache hit.
[2023-03-21 21:09:18] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5469 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:09:19] [INFO ] Invariant cache hit.
[2023-03-21 21:09:20] [INFO ] [Real]Absence check using 900 positive place invariants in 367 ms returned sat
[2023-03-21 21:09:22] [INFO ] After 2538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:09:23] [INFO ] [Nat]Absence check using 900 positive place invariants in 307 ms returned sat
[2023-03-21 21:09:24] [INFO ] After 1632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:09:25] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-21 21:09:25] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-21 21:09:25] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-21 21:09:25] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-21 21:09:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1014 ms
[2023-03-21 21:09:25] [INFO ] After 2795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-21 21:09:26] [INFO ] After 4123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 176 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 158824 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158824 steps, saw 156887 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 21:09:29] [INFO ] Computed 900 place invariants in 26 ms
[2023-03-21 21:09:30] [INFO ] [Real]Absence check using 900 positive place invariants in 190 ms returned sat
[2023-03-21 21:09:32] [INFO ] After 2436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:09:32] [INFO ] [Nat]Absence check using 900 positive place invariants in 262 ms returned sat
[2023-03-21 21:09:34] [INFO ] After 1418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:09:34] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-21 21:09:34] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2023-03-21 21:09:35] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-21 21:09:35] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2023-03-21 21:09:35] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-21 21:09:35] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-21 21:09:36] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 1 ms to minimize.
[2023-03-21 21:09:36] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-21 21:09:36] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-03-21 21:09:37] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-21 21:09:37] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-21 21:09:37] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-21 21:09:37] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2023-03-21 21:09:37] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-21 21:09:38] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-21 21:09:38] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4003 ms
[2023-03-21 21:09:38] [INFO ] After 5480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-21 21:09:38] [INFO ] After 6358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 125 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 74 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 21:09:38] [INFO ] Invariant cache hit.
[2023-03-21 21:09:40] [INFO ] Implicit Places using invariants in 2167 ms returned []
[2023-03-21 21:09:40] [INFO ] Invariant cache hit.
[2023-03-21 21:09:43] [INFO ] Implicit Places using invariants and state equation in 2746 ms returned []
Implicit Place search using SMT with State Equation took 4955 ms to find 0 implicit places.
[2023-03-21 21:09:43] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-21 21:09:43] [INFO ] Invariant cache hit.
[2023-03-21 21:09:45] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6959 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 79 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 21:09:45] [INFO ] Invariant cache hit.
[2023-03-21 21:09:46] [INFO ] [Real]Absence check using 900 positive place invariants in 214 ms returned sat
[2023-03-21 21:09:48] [INFO ] After 2395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:09:48] [INFO ] [Nat]Absence check using 900 positive place invariants in 188 ms returned sat
[2023-03-21 21:09:50] [INFO ] After 1492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:09:50] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-21 21:09:50] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 1 ms to minimize.
[2023-03-21 21:09:51] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-21 21:09:51] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 0 ms to minimize.
[2023-03-21 21:09:51] [INFO ] Deduced a trap composed of 29 places in 223 ms of which 1 ms to minimize.
[2023-03-21 21:09:52] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 0 ms to minimize.
[2023-03-21 21:09:52] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 0 ms to minimize.
[2023-03-21 21:09:52] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-21 21:09:53] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-21 21:09:53] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 1 ms to minimize.
[2023-03-21 21:09:53] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 0 ms to minimize.
[2023-03-21 21:09:54] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2023-03-21 21:09:54] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 1 ms to minimize.
[2023-03-21 21:09:54] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-21 21:09:54] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 0 ms to minimize.
[2023-03-21 21:09:55] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2023-03-21 21:09:55] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-21 21:09:55] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-21 21:09:55] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-21 21:09:56] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2023-03-21 21:09:56] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6154 ms
[2023-03-21 21:09:56] [INFO ] After 7709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-21 21:09:56] [INFO ] After 8483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 587 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33376 reset in 2046 ms.
Product exploration explored 100000 steps with 33216 reset in 2254 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 104 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 21:10:02] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-21 21:10:04] [INFO ] Implicit Places using invariants in 1940 ms returned []
[2023-03-21 21:10:04] [INFO ] Invariant cache hit.
[2023-03-21 21:10:06] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 4455 ms to find 0 implicit places.
[2023-03-21 21:10:06] [INFO ] Invariant cache hit.
[2023-03-21 21:10:08] [INFO ] Dead Transitions using invariants and state equation in 1726 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6312 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-01 finished in 108748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&G(!p0))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G((p1||F(p2)))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-07
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
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 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 201 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 21:10:09] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-21 21:10:11] [INFO ] Implicit Places using invariants in 2083 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2086 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2370 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1401 ms.
Product exploration explored 100000 steps with 30 reset in 1814 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 2022 steps, including 0 resets, run visited all 2 properties in 100 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 638 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:10:17] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-21 21:10:21] [INFO ] [Real]Absence check using 900 positive place invariants in 1365 ms returned sat
[2023-03-21 21:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:10:32] [INFO ] [Real]Absence check using state equation in 10585 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 104 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:10:32] [INFO ] Invariant cache hit.
[2023-03-21 21:10:33] [INFO ] Implicit Places using invariants in 1551 ms returned []
[2023-03-21 21:10:33] [INFO ] Invariant cache hit.
[2023-03-21 21:10:38] [INFO ] Implicit Places using invariants and state equation in 4878 ms returned []
Implicit Place search using SMT with State Equation took 6465 ms to find 0 implicit places.
[2023-03-21 21:10:39] [INFO ] Redundant transitions in 437 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 21:10:39] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 21:10:41] [INFO ] Dead Transitions using invariants and state equation in 2094 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9225 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1968 steps, including 0 resets, run visited all 2 properties in 89 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 431 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-21 21:10:43] [INFO ] Invariant cache hit.
[2023-03-21 21:10:47] [INFO ] [Real]Absence check using 900 positive place invariants in 1065 ms returned sat
[2023-03-21 21:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:10:58] [INFO ] [Real]Absence check using state equation in 10873 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 1426 ms.
Product exploration explored 100000 steps with 30 reset in 1872 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 92 ms. Remains 2499 /2500 variables (removed 1) and now considering 2399/2400 (removed 1) transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-21 21:11:01] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-21 21:11:03] [INFO ] Implicit Places using invariants in 1638 ms returned []
[2023-03-21 21:11:03] [INFO ] Invariant cache hit.
[2023-03-21 21:11:06] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 4439 ms to find 0 implicit places.
[2023-03-21 21:11:06] [INFO ] Redundant transitions in 397 ms returned []
[2023-03-21 21:11:06] [INFO ] Invariant cache hit.
[2023-03-21 21:11:08] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6277 ms. Remains : 2499/2500 places, 2399/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-07 finished in 59144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-09
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 214 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 21:11:08] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-21 21:11:10] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2023-03-21 21:11:10] [INFO ] Invariant cache hit.
[2023-03-21 21:11:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:11:16] [INFO ] Implicit Places using invariants and state equation in 6179 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7791 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8079 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s738 0) (EQ s746 0) (EQ s750 0) (EQ s2408 0) (EQ s2423 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1416 ms.
Product exploration explored 100000 steps with 19 reset in 1795 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 120244 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120244 steps, saw 111968 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:11:23] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-21 21:11:24] [INFO ] [Real]Absence check using 900 positive place invariants in 295 ms returned sat
[2023-03-21 21:11:26] [INFO ] After 2395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:11:26] [INFO ] [Nat]Absence check using 900 positive place invariants in 156 ms returned sat
[2023-03-21 21:11:34] [INFO ] After 8025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:11:42] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 0 ms to minimize.
[2023-03-21 21:11:49] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 0 ms to minimize.
[2023-03-21 21:11:51] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 9605 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:11:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:11:51] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 223 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 149 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 176888 steps, run timeout after 3002 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176888 steps, saw 174283 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:11:54] [INFO ] Computed 900 place invariants in 26 ms
[2023-03-21 21:11:56] [INFO ] [Real]Absence check using 897 positive place invariants in 669 ms returned sat
[2023-03-21 21:11:56] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:11:57] [INFO ] After 2823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:11:58] [INFO ] [Nat]Absence check using 897 positive place invariants in 429 ms returned sat
[2023-03-21 21:11:58] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 39 ms returned sat
[2023-03-21 21:12:09] [INFO ] After 12034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 121 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:12:10] [INFO ] Invariant cache hit.
[2023-03-21 21:12:12] [INFO ] Implicit Places using invariants in 2224 ms returned []
[2023-03-21 21:12:12] [INFO ] Invariant cache hit.
[2023-03-21 21:12:18] [INFO ] Implicit Places using invariants and state equation in 6039 ms returned []
Implicit Place search using SMT with State Equation took 8265 ms to find 0 implicit places.
[2023-03-21 21:12:18] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-21 21:12:18] [INFO ] Invariant cache hit.
[2023-03-21 21:12:20] [INFO ] Dead Transitions using invariants and state equation in 2568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11003 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 21:12:21] [INFO ] Invariant cache hit.
[2023-03-21 21:12:21] [INFO ] [Real]Absence check using 897 positive place invariants in 237 ms returned sat
[2023-03-21 21:12:21] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:12:23] [INFO ] After 2347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:12:24] [INFO ] [Nat]Absence check using 897 positive place invariants in 192 ms returned sat
[2023-03-21 21:12:24] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:12:34] [INFO ] After 11260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:12:35] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 21:12:37] [INFO ] Implicit Places using invariants in 1689 ms returned []
[2023-03-21 21:12:37] [INFO ] Invariant cache hit.
[2023-03-21 21:12:42] [INFO ] Implicit Places using invariants and state equation in 5591 ms returned []
Implicit Place search using SMT with State Equation took 7310 ms to find 0 implicit places.
[2023-03-21 21:12:42] [INFO ] Invariant cache hit.
[2023-03-21 21:12:44] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8892 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104384 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104384 steps, saw 97766 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:12:48] [INFO ] Invariant cache hit.
[2023-03-21 21:12:48] [INFO ] [Real]Absence check using 900 positive place invariants in 226 ms returned sat
[2023-03-21 21:12:50] [INFO ] After 2166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:12:50] [INFO ] [Nat]Absence check using 900 positive place invariants in 222 ms returned sat
[2023-03-21 21:13:01] [INFO ] After 10405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:13:02] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2023-03-21 21:13:02] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-21 21:13:03] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 0 ms to minimize.
[2023-03-21 21:13:04] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 0 ms to minimize.
[2023-03-21 21:13:04] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 0 ms to minimize.
[2023-03-21 21:13:05] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 0 ms to minimize.
[2023-03-21 21:13:05] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 1 ms to minimize.
[2023-03-21 21:13:06] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-21 21:13:06] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 1 ms to minimize.
[2023-03-21 21:13:07] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-21 21:13:07] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-21 21:13:08] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2023-03-21 21:13:08] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-21 21:13:09] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-21 21:13:15] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 13250 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:13:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:13:15] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 189 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 195 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 142052 steps, run timeout after 3002 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142052 steps, saw 140052 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:13:18] [INFO ] Computed 900 place invariants in 17 ms
[2023-03-21 21:13:19] [INFO ] [Real]Absence check using 897 positive place invariants in 232 ms returned sat
[2023-03-21 21:13:19] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-21 21:13:21] [INFO ] After 2304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:13:22] [INFO ] [Nat]Absence check using 897 positive place invariants in 259 ms returned sat
[2023-03-21 21:13:22] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-21 21:13:33] [INFO ] After 11760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 154 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:13:33] [INFO ] Invariant cache hit.
[2023-03-21 21:13:35] [INFO ] Implicit Places using invariants in 1891 ms returned []
[2023-03-21 21:13:35] [INFO ] Invariant cache hit.
[2023-03-21 21:13:40] [INFO ] Implicit Places using invariants and state equation in 5568 ms returned []
Implicit Place search using SMT with State Equation took 7475 ms to find 0 implicit places.
[2023-03-21 21:13:40] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-21 21:13:40] [INFO ] Invariant cache hit.
[2023-03-21 21:13:42] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9441 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 21:13:42] [INFO ] Invariant cache hit.
[2023-03-21 21:13:43] [INFO ] [Real]Absence check using 897 positive place invariants in 481 ms returned sat
[2023-03-21 21:13:43] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 22 ms returned sat
[2023-03-21 21:13:46] [INFO ] After 3684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:13:47] [INFO ] [Nat]Absence check using 897 positive place invariants in 217 ms returned sat
[2023-03-21 21:13:47] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 22 ms returned sat
[2023-03-21 21:13:57] [INFO ] After 11350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1546 ms.
Product exploration explored 100000 steps with 19 reset in 1834 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 106 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 21:14:03] [INFO ] Redundant transitions in 412 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 21:14:03] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 21:14:05] [INFO ] Dead Transitions using invariants and state equation in 2455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3086 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 21:14:05] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 21:14:07] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2023-03-21 21:14:07] [INFO ] Invariant cache hit.
[2023-03-21 21:14:12] [INFO ] Implicit Places using invariants and state equation in 5068 ms returned []
Implicit Place search using SMT with State Equation took 6563 ms to find 0 implicit places.
[2023-03-21 21:14:12] [INFO ] Invariant cache hit.
[2023-03-21 21:14:13] [INFO ] Dead Transitions using invariants and state equation in 1595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8224 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLFireability-09 finished in 185726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||F(p1)) U p2)||G(F(p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-21 21:14:14] [INFO ] Flatten gal took : 217 ms
[2023-03-21 21:14:14] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-21 21:14:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 2403 transitions and 10806 arcs took 13 ms.
Total runtime 1601210 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4861/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-01
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-02
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-06
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-07
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-09
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-11
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLFireability-13

BK_STOP 1679433262822

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-100A-LTLFireability-01
ltl formula formula --ltl=/tmp/4861/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.090 user 0.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-100A-LTLFireability-02
ltl formula formula --ltl=/tmp/4861/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.100 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-100A-LTLFireability-06
ltl formula formula --ltl=/tmp/4861/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.150 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldIIPs-PT-100A-LTLFireability-07
ltl formula formula --ltl=/tmp/4861/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.120 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-100A-LTLFireability-09
ltl formula formula --ltl=/tmp/4861/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.510 real 0.170 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-100A-LTLFireability-11
ltl formula formula --ltl=/tmp/4861/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.130 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldIIPs-PT-100A-LTLFireability-13
ltl formula formula --ltl=/tmp/4861/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.150 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4861/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4861/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4861/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4861/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d31382d3f4]
1: pnml2lts-mc(+0xa2496) [0x55d31382d496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f089fae9140]
3: pnml2lts-mc(+0x405be5) [0x55d313b90be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d3138f63f9]
5: pnml2lts-mc(+0x164ac4) [0x55d3138efac4]
6: pnml2lts-mc(+0x272e0a) [0x55d3139fde0a]
7: pnml2lts-mc(+0xb61f0) [0x55d3138411f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f089f93c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f089f93c67a]
10: pnml2lts-mc(+0xa1581) [0x55d31382c581]
11: pnml2lts-mc(+0xa1910) [0x55d31382c910]
12: pnml2lts-mc(+0xa32a2) [0x55d31382e2a2]
13: pnml2lts-mc(+0xa50f4) [0x55d3138300f4]
14: pnml2lts-mc(+0xa516b) [0x55d31383016b]
15: pnml2lts-mc(+0x3f34b3) [0x55d313b7e4b3]
16: pnml2lts-mc(+0x7c63d) [0x55d31380763d]
17: pnml2lts-mc(+0x67d86) [0x55d3137f2d86]
18: pnml2lts-mc(+0x60a8a) [0x55d3137eba8a]
19: pnml2lts-mc(+0x5eb15) [0x55d3137e9b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f089f924d0a]
21: pnml2lts-mc(+0x6075e) [0x55d3137eb75e]

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="ShieldIIPs-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-100A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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