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.r391-oct2-167903715400524.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 lolaxred
Input is ShieldPPPs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 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.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 ShieldPPPs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679277719121

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:02:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:02:02] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2023-03-20 02:02:02] [INFO ] Transformed 6803 places.
[2023-03-20 02:02:02] [INFO ] Transformed 6303 transitions.
[2023-03-20 02:02:02] [INFO ] Found NUPN structural information;
[2023-03-20 02:02:02] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 721 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 698 places :
Symmetric choice reduction at 0 with 698 rule applications. Total rules 698 place count 6105 transition count 5605
Iterating global reduction 0 with 698 rules applied. Total rules applied 1396 place count 6105 transition count 5605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1397 place count 6104 transition count 5604
Iterating global reduction 0 with 1 rules applied. Total rules applied 1398 place count 6104 transition count 5604
Applied a total of 1398 rules in 2963 ms. Remains 6104 /6803 variables (removed 699) and now considering 5604/6303 (removed 699) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2023-03-20 02:02:06] [INFO ] Computed 1101 place invariants in 84 ms
[2023-03-20 02:02:09] [INFO ] Implicit Places using invariants in 3869 ms returned []
[2023-03-20 02:02:09] [INFO ] Invariant cache hit.
[2023-03-20 02:02:10] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 4776 ms to find 0 implicit places.
[2023-03-20 02:02:10] [INFO ] Invariant cache hit.
[2023-03-20 02:02:11] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6803 places, 5604/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8596 ms. Remains : 6104/6803 places, 5604/6303 transitions.
Support contains 36 out of 6104 places after structural reductions.
[2023-03-20 02:02:12] [INFO ] Flatten gal took : 357 ms
[2023-03-20 02:02:12] [INFO ] Flatten gal took : 192 ms
[2023-03-20 02:02:12] [INFO ] Input system was already deterministic with 5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-20 02:02:13] [INFO ] Invariant cache hit.
[2023-03-20 02:02:16] [INFO ] After 2795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-20 02:02:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1008 ms returned sat
[2023-03-20 02:02:31] [INFO ] After 9690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-20 02:02:35] [INFO ] Deduced a trap composed of 26 places in 3579 ms of which 33 ms to minimize.
[2023-03-20 02:02:38] [INFO ] Deduced a trap composed of 14 places in 2915 ms of which 3 ms to minimize.
[2023-03-20 02:02:41] [INFO ] Deduced a trap composed of 26 places in 2636 ms of which 40 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:02:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:02:41] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 1 properties in 5348 ms.
Support contains 28 out of 6104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Drop transitions removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 693 rules applied. Total rules applied 693 place count 6104 transition count 4911
Reduce places removed 693 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 694 rules applied. Total rules applied 1387 place count 5411 transition count 4910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1388 place count 5410 transition count 4910
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 502 Pre rules applied. Total rules applied 1388 place count 5410 transition count 4408
Deduced a syphon composed of 502 places in 21 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2392 place count 4908 transition count 4408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2393 place count 4907 transition count 4407
Iterating global reduction 3 with 1 rules applied. Total rules applied 2394 place count 4907 transition count 4407
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2394 place count 4907 transition count 4406
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2396 place count 4906 transition count 4406
Performed 1784 Post agglomeration using F-continuation condition.Transition count delta: 1784
Deduced a syphon composed of 1784 places in 6 ms
Reduce places removed 1784 places and 0 transitions.
Iterating global reduction 3 with 3568 rules applied. Total rules applied 5964 place count 3122 transition count 2622
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 883 times.
Drop transitions removed 883 transitions
Iterating global reduction 3 with 883 rules applied. Total rules applied 6847 place count 3122 transition count 2622
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6848 place count 3121 transition count 2621
Applied a total of 6848 rules in 2248 ms. Remains 3121 /6104 variables (removed 2983) and now considering 2621/5604 (removed 2983) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2249 ms. Remains : 3121/6104 places, 2621/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2621 rows 3121 cols
[2023-03-20 02:02:52] [INFO ] Computed 1101 place invariants in 125 ms
[2023-03-20 02:02:53] [INFO ] [Real]Absence check using 1049 positive place invariants in 217 ms returned sat
[2023-03-20 02:02:53] [INFO ] [Real]Absence check using 1049 positive and 52 generalized place invariants in 29 ms returned sat
[2023-03-20 02:02:53] [INFO ] After 1379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 02:02:55] [INFO ] [Nat]Absence check using 1049 positive place invariants in 326 ms returned sat
[2023-03-20 02:02:55] [INFO ] [Nat]Absence check using 1049 positive and 52 generalized place invariants in 13 ms returned sat
[2023-03-20 02:02:59] [INFO ] After 3355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-20 02:02:59] [INFO ] Deduced a trap composed of 6 places in 454 ms of which 27 ms to minimize.
[2023-03-20 02:03:00] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 0 ms to minimize.
[2023-03-20 02:03:00] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 0 ms to minimize.
[2023-03-20 02:03:01] [INFO ] Deduced a trap composed of 11 places in 621 ms of which 1 ms to minimize.
[2023-03-20 02:03:01] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-20 02:03:02] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2023-03-20 02:03:02] [INFO ] Deduced a trap composed of 6 places in 556 ms of which 2 ms to minimize.
[2023-03-20 02:03:03] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 0 ms to minimize.
[2023-03-20 02:03:03] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:03:03] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:03:04] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 13 ms to minimize.
[2023-03-20 02:03:04] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2023-03-20 02:03:05] [INFO ] Deduced a trap composed of 6 places in 800 ms of which 1 ms to minimize.
[2023-03-20 02:03:06] [INFO ] Deduced a trap composed of 5 places in 652 ms of which 0 ms to minimize.
[2023-03-20 02:03:06] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:03:07] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-20 02:03:07] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 15 ms to minimize.
[2023-03-20 02:03:07] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-20 02:03:08] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:03:08] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 0 ms to minimize.
[2023-03-20 02:03:09] [INFO ] Deduced a trap composed of 6 places in 368 ms of which 0 ms to minimize.
[2023-03-20 02:03:09] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:03:09] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 0 ms to minimize.
[2023-03-20 02:03:10] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-20 02:03:10] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:03:10] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2023-03-20 02:03:11] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:03:11] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2023-03-20 02:03:12] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2023-03-20 02:03:12] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-20 02:03:12] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-20 02:03:13] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-20 02:03:13] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:03:13] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:03:14] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 2 ms to minimize.
[2023-03-20 02:03:14] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-20 02:03:14] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2023-03-20 02:03:15] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
[2023-03-20 02:03:15] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-20 02:03:15] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:03:16] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2023-03-20 02:03:16] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-20 02:03:16] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2023-03-20 02:03:17] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2023-03-20 02:03:17] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:03:18] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 16 ms to minimize.
[2023-03-20 02:03:18] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-20 02:03:21] [INFO ] Deduced a trap composed of 2 places in 3341 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:03:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:03:21] [INFO ] After 28361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 1945 ms.
Support contains 21 out of 3121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3121/3121 places, 2621/2621 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3121 transition count 2619
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3119 transition count 2619
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 3119 transition count 2617
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 3117 transition count 2617
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 19 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 3114 transition count 2614
Applied a total of 14 rules in 341 ms. Remains 3114 /3121 variables (removed 7) and now considering 2614/2621 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 3114/3121 places, 2614/2621 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 101321 steps, run timeout after 6001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 101321 steps, saw 94147 distinct states, run finished after 6003 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2614 rows 3114 cols
[2023-03-20 02:03:32] [INFO ] Computed 1101 place invariants in 38 ms
[2023-03-20 02:03:34] [INFO ] [Real]Absence check using 1037 positive place invariants in 341 ms returned sat
[2023-03-20 02:03:34] [INFO ] [Real]Absence check using 1037 positive and 64 generalized place invariants in 23 ms returned sat
[2023-03-20 02:03:34] [INFO ] After 1738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 02:03:36] [INFO ] [Nat]Absence check using 1037 positive place invariants in 298 ms returned sat
[2023-03-20 02:03:36] [INFO ] [Nat]Absence check using 1037 positive and 64 generalized place invariants in 40 ms returned sat
[2023-03-20 02:03:41] [INFO ] After 3907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-20 02:03:41] [INFO ] Deduced a trap composed of 6 places in 677 ms of which 2 ms to minimize.
[2023-03-20 02:03:42] [INFO ] Deduced a trap composed of 4 places in 712 ms of which 1 ms to minimize.
[2023-03-20 02:03:43] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 14 ms to minimize.
[2023-03-20 02:03:44] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-20 02:03:44] [INFO ] Deduced a trap composed of 6 places in 588 ms of which 1 ms to minimize.
[2023-03-20 02:03:45] [INFO ] Deduced a trap composed of 6 places in 650 ms of which 1 ms to minimize.
[2023-03-20 02:03:46] [INFO ] Deduced a trap composed of 7 places in 643 ms of which 2 ms to minimize.
[2023-03-20 02:03:46] [INFO ] Deduced a trap composed of 4 places in 537 ms of which 1 ms to minimize.
[2023-03-20 02:03:47] [INFO ] Deduced a trap composed of 6 places in 540 ms of which 1 ms to minimize.
[2023-03-20 02:03:48] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 1 ms to minimize.
[2023-03-20 02:03:48] [INFO ] Deduced a trap composed of 6 places in 502 ms of which 3 ms to minimize.
[2023-03-20 02:03:49] [INFO ] Deduced a trap composed of 6 places in 477 ms of which 1 ms to minimize.
[2023-03-20 02:03:50] [INFO ] Deduced a trap composed of 6 places in 780 ms of which 6 ms to minimize.
[2023-03-20 02:03:51] [INFO ] Deduced a trap composed of 6 places in 586 ms of which 1 ms to minimize.
[2023-03-20 02:03:51] [INFO ] Deduced a trap composed of 6 places in 646 ms of which 1 ms to minimize.
[2023-03-20 02:03:52] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2023-03-20 02:03:52] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 12 ms to minimize.
[2023-03-20 02:03:53] [INFO ] Deduced a trap composed of 6 places in 618 ms of which 1 ms to minimize.
[2023-03-20 02:03:54] [INFO ] Deduced a trap composed of 4 places in 504 ms of which 1 ms to minimize.
[2023-03-20 02:03:54] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-20 02:03:55] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 7 ms to minimize.
[2023-03-20 02:03:56] [INFO ] Deduced a trap composed of 6 places in 458 ms of which 0 ms to minimize.
[2023-03-20 02:03:56] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 1 ms to minimize.
[2023-03-20 02:03:57] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 1 ms to minimize.
[2023-03-20 02:03:57] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 0 ms to minimize.
[2023-03-20 02:03:58] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 1 ms to minimize.
[2023-03-20 02:03:59] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 1 ms to minimize.
[2023-03-20 02:03:59] [INFO ] Deduced a trap composed of 5 places in 431 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:03:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:03:59] [INFO ] After 25191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1748 ms.
Support contains 21 out of 3114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 2614/2614 transitions.
Applied a total of 0 rules in 185 ms. Remains 3114 /3114 variables (removed 0) and now considering 2614/2614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 3114/3114 places, 2614/2614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 2614/2614 transitions.
Applied a total of 0 rules in 148 ms. Remains 3114 /3114 variables (removed 0) and now considering 2614/2614 (removed 0) transitions.
[2023-03-20 02:04:01] [INFO ] Invariant cache hit.
[2023-03-20 02:04:03] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2023-03-20 02:04:03] [INFO ] Invariant cache hit.
[2023-03-20 02:04:11] [INFO ] Implicit Places using invariants and state equation in 7503 ms returned []
Implicit Place search using SMT with State Equation took 9426 ms to find 0 implicit places.
[2023-03-20 02:04:11] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-20 02:04:11] [INFO ] Invariant cache hit.
[2023-03-20 02:04:13] [INFO ] Dead Transitions using invariants and state equation in 2348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12080 ms. Remains : 3114/3114 places, 2614/2614 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Support contains 6 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1157 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:04:15] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-20 02:04:18] [INFO ] Implicit Places using invariants in 2624 ms returned []
[2023-03-20 02:04:18] [INFO ] Invariant cache hit.
[2023-03-20 02:04:20] [INFO ] Implicit Places using invariants and state equation in 2921 ms returned []
Implicit Place search using SMT with State Equation took 5566 ms to find 0 implicit places.
[2023-03-20 02:04:20] [INFO ] Invariant cache hit.
[2023-03-20 02:04:25] [INFO ] Dead Transitions using invariants and state equation in 5026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11753 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 507 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s2399 1) (EQ s2431 1)), p0:(AND (OR (EQ s3786 0) (EQ s3821 0)) (OR (EQ s2817 0) (EQ s2841 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-01 finished in 12427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&X(F(p0))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1245 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-20 02:04:27] [INFO ] Invariant cache hit.
[2023-03-20 02:04:30] [INFO ] Implicit Places using invariants in 3091 ms returned []
[2023-03-20 02:04:30] [INFO ] Invariant cache hit.
[2023-03-20 02:04:33] [INFO ] Implicit Places using invariants and state equation in 2917 ms returned []
Implicit Place search using SMT with State Equation took 6030 ms to find 0 implicit places.
[2023-03-20 02:04:33] [INFO ] Invariant cache hit.
[2023-03-20 02:04:39] [INFO ] Dead Transitions using invariants and state equation in 5188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12467 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2039 0) (EQ s2072 0)), p1:(OR (EQ s2637 0) (EQ s2661 0))], 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 32 reset in 1788 ms.
Product exploration explored 100000 steps with 15 reset in 2252 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 513 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 103977 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103977 steps, saw 102427 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:04:47] [INFO ] Invariant cache hit.
[2023-03-20 02:04:48] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:04:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 882 ms returned sat
[2023-03-20 02:04:57] [INFO ] After 6227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:05:01] [INFO ] Deduced a trap composed of 18 places in 3122 ms of which 3 ms to minimize.
[2023-03-20 02:05:04] [INFO ] Deduced a trap composed of 25 places in 3040 ms of which 5 ms to minimize.
[2023-03-20 02:05:07] [INFO ] Deduced a trap composed of 22 places in 3354 ms of which 4 ms to minimize.
[2023-03-20 02:05:11] [INFO ] Deduced a trap composed of 22 places in 3664 ms of which 4 ms to minimize.
[2023-03-20 02:05:15] [INFO ] Deduced a trap composed of 16 places in 3060 ms of which 4 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-20 02:05:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:05:15] [INFO ] After 26241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 778 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 27 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 8 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1435 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1435 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) 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
Interrupted probabilistic random walk after 63613 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63613 steps, saw 59467 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:05:21] [INFO ] Computed 1101 place invariants in 22 ms
[2023-03-20 02:05:22] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:05:23] [INFO ] [Nat]Absence check using 1048 positive place invariants in 380 ms returned sat
[2023-03-20 02:05:23] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 37 ms returned sat
[2023-03-20 02:05:26] [INFO ] After 2699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:05:26] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 1 ms to minimize.
[2023-03-20 02:05:26] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2023-03-20 02:05:27] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
[2023-03-20 02:05:27] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 2 ms to minimize.
[2023-03-20 02:05:28] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:05:28] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:05:28] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2023-03-20 02:05:29] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-20 02:05:29] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2023-03-20 02:05:30] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 0 ms to minimize.
[2023-03-20 02:05:30] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-20 02:05:30] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-20 02:05:31] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
[2023-03-20 02:05:31] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2023-03-20 02:05:32] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:05:32] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:05:32] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 0 ms to minimize.
[2023-03-20 02:05:33] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:05:33] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-20 02:05:33] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2023-03-20 02:05:34] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-20 02:05:34] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-20 02:05:35] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 1 ms to minimize.
[2023-03-20 02:05:35] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-20 02:05:36] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2023-03-20 02:05:36] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-20 02:05:36] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-20 02:05:37] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-20 02:05:37] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:05:37] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:05:38] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2023-03-20 02:05:38] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:05:39] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2023-03-20 02:05:39] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2023-03-20 02:05:40] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-20 02:05:40] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2023-03-20 02:05:40] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-20 02:05:41] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-20 02:05:41] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-20 02:05:41] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:05:42] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2023-03-20 02:05:42] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-20 02:05:43] [INFO ] Deduced a trap composed of 8 places in 573 ms of which 1 ms to minimize.
[2023-03-20 02:05:43] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-20 02:05:44] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-20 02:05:44] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:05:45] [INFO ] Deduced a trap composed of 6 places in 982 ms of which 1 ms to minimize.
[2023-03-20 02:05:46] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2023-03-20 02:05:46] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 0 ms to minimize.
[2023-03-20 02:05:46] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:05:47] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:05:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:05:47] [INFO ] After 25142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 750 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 135 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 162 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:05:48] [INFO ] Invariant cache hit.
[2023-03-20 02:05:50] [INFO ] Implicit Places using invariants in 2694 ms returned []
[2023-03-20 02:05:50] [INFO ] Invariant cache hit.
[2023-03-20 02:05:57] [INFO ] Implicit Places using invariants and state equation in 6465 ms returned []
Implicit Place search using SMT with State Equation took 9182 ms to find 0 implicit places.
[2023-03-20 02:05:57] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-20 02:05:57] [INFO ] Invariant cache hit.
[2023-03-20 02:05:59] [INFO ] Dead Transitions using invariants and state equation in 2034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11532 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 130 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:05:59] [INFO ] Invariant cache hit.
[2023-03-20 02:06:00] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:06:01] [INFO ] [Nat]Absence check using 1048 positive place invariants in 288 ms returned sat
[2023-03-20 02:06:01] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 15 ms returned sat
[2023-03-20 02:06:03] [INFO ] After 2334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:06:04] [INFO ] Deduced a trap composed of 4 places in 775 ms of which 2 ms to minimize.
[2023-03-20 02:06:05] [INFO ] Deduced a trap composed of 5 places in 616 ms of which 2 ms to minimize.
[2023-03-20 02:06:06] [INFO ] Deduced a trap composed of 4 places in 688 ms of which 2 ms to minimize.
[2023-03-20 02:06:07] [INFO ] Deduced a trap composed of 6 places in 811 ms of which 2 ms to minimize.
[2023-03-20 02:06:08] [INFO ] Deduced a trap composed of 5 places in 747 ms of which 1 ms to minimize.
[2023-03-20 02:06:09] [INFO ] Deduced a trap composed of 6 places in 1109 ms of which 3 ms to minimize.
[2023-03-20 02:06:09] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 2 ms to minimize.
[2023-03-20 02:06:10] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2023-03-20 02:06:11] [INFO ] Deduced a trap composed of 5 places in 690 ms of which 2 ms to minimize.
[2023-03-20 02:06:12] [INFO ] Deduced a trap composed of 6 places in 634 ms of which 1 ms to minimize.
[2023-03-20 02:06:13] [INFO ] Deduced a trap composed of 6 places in 600 ms of which 1 ms to minimize.
[2023-03-20 02:06:13] [INFO ] Deduced a trap composed of 6 places in 558 ms of which 2 ms to minimize.
[2023-03-20 02:06:14] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 1 ms to minimize.
[2023-03-20 02:06:15] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 2 ms to minimize.
[2023-03-20 02:06:15] [INFO ] Deduced a trap composed of 6 places in 587 ms of which 1 ms to minimize.
[2023-03-20 02:06:16] [INFO ] Deduced a trap composed of 8 places in 559 ms of which 1 ms to minimize.
[2023-03-20 02:06:17] [INFO ] Deduced a trap composed of 5 places in 523 ms of which 2 ms to minimize.
[2023-03-20 02:06:17] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 1 ms to minimize.
[2023-03-20 02:06:18] [INFO ] Deduced a trap composed of 9 places in 521 ms of which 1 ms to minimize.
[2023-03-20 02:06:19] [INFO ] Deduced a trap composed of 6 places in 554 ms of which 1 ms to minimize.
[2023-03-20 02:06:19] [INFO ] Deduced a trap composed of 4 places in 539 ms of which 1 ms to minimize.
[2023-03-20 02:06:20] [INFO ] Deduced a trap composed of 9 places in 610 ms of which 1 ms to minimize.
[2023-03-20 02:06:21] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2023-03-20 02:06:21] [INFO ] Deduced a trap composed of 6 places in 579 ms of which 1 ms to minimize.
[2023-03-20 02:06:22] [INFO ] Deduced a trap composed of 9 places in 499 ms of which 1 ms to minimize.
[2023-03-20 02:06:22] [INFO ] Deduced a trap composed of 6 places in 380 ms of which 1 ms to minimize.
[2023-03-20 02:06:23] [INFO ] Deduced a trap composed of 6 places in 502 ms of which 1 ms to minimize.
[2023-03-20 02:06:24] [INFO ] Deduced a trap composed of 6 places in 636 ms of which 1 ms to minimize.
[2023-03-20 02:06:24] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 1 ms to minimize.
[2023-03-20 02:06:25] [INFO ] Deduced a trap composed of 8 places in 554 ms of which 1 ms to minimize.
[2023-03-20 02:06:26] [INFO ] Deduced a trap composed of 6 places in 509 ms of which 1 ms to minimize.
[2023-03-20 02:06:26] [INFO ] Deduced a trap composed of 6 places in 453 ms of which 1 ms to minimize.
[2023-03-20 02:06:27] [INFO ] Deduced a trap composed of 6 places in 705 ms of which 1 ms to minimize.
[2023-03-20 02:06:28] [INFO ] Deduced a trap composed of 6 places in 619 ms of which 1 ms to minimize.
[2023-03-20 02:06:28] [INFO ] Deduced a trap composed of 12 places in 526 ms of which 1 ms to minimize.
[2023-03-20 02:06:29] [INFO ] Deduced a trap composed of 6 places in 437 ms of which 1 ms to minimize.
[2023-03-20 02:06:29] [INFO ] Deduced a trap composed of 23 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:06:30] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
[2023-03-20 02:06:30] [INFO ] Deduced a trap composed of 6 places in 445 ms of which 1 ms to minimize.
[2023-03-20 02:06:31] [INFO ] Deduced a trap composed of 8 places in 493 ms of which 1 ms to minimize.
[2023-03-20 02:06:32] [INFO ] Deduced a trap composed of 17 places in 903 ms of which 11 ms to minimize.
[2023-03-20 02:06:32] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 1 ms to minimize.
[2023-03-20 02:06:33] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2023-03-20 02:06:33] [INFO ] Deduced a trap composed of 23 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:06:34] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:06:34] [INFO ] Deduced a trap composed of 5 places in 383 ms of which 1 ms to minimize.
[2023-03-20 02:06:35] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2023-03-20 02:06:35] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:06:36] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 1 ms to minimize.
[2023-03-20 02:06:36] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2023-03-20 02:06:37] [INFO ] Deduced a trap composed of 17 places in 367 ms of which 1 ms to minimize.
[2023-03-20 02:06:37] [INFO ] Deduced a trap composed of 39 places in 631 ms of which 1 ms to minimize.
[2023-03-20 02:06:38] [INFO ] Deduced a trap composed of 34 places in 479 ms of which 1 ms to minimize.
[2023-03-20 02:06:38] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 34938 ms
[2023-03-20 02:06:39] [INFO ] After 38159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 570 ms.
[2023-03-20 02:06:40] [INFO ] After 39894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 573 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 651 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:06:41] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-20 02:06:44] [INFO ] Implicit Places using invariants in 2904 ms returned []
[2023-03-20 02:06:44] [INFO ] Invariant cache hit.
[2023-03-20 02:06:47] [INFO ] Implicit Places using invariants and state equation in 2922 ms returned []
Implicit Place search using SMT with State Equation took 5850 ms to find 0 implicit places.
[2023-03-20 02:06:47] [INFO ] Invariant cache hit.
[2023-03-20 02:06:52] [INFO ] Dead Transitions using invariants and state equation in 5014 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11516 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 135067 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135067 steps, saw 133010 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:06:57] [INFO ] Invariant cache hit.
[2023-03-20 02:06:58] [INFO ] After 1077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:07:00] [INFO ] [Nat]Absence check using 1101 positive place invariants in 703 ms returned sat
[2023-03-20 02:07:07] [INFO ] After 6595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:07:10] [INFO ] Deduced a trap composed of 18 places in 2943 ms of which 4 ms to minimize.
[2023-03-20 02:07:13] [INFO ] Deduced a trap composed of 25 places in 2911 ms of which 4 ms to minimize.
[2023-03-20 02:07:16] [INFO ] Deduced a trap composed of 22 places in 3015 ms of which 4 ms to minimize.
[2023-03-20 02:07:19] [INFO ] Deduced a trap composed of 22 places in 3049 ms of which 4 ms to minimize.
[2023-03-20 02:07:23] [INFO ] Deduced a trap composed of 16 places in 2956 ms of which 4 ms to minimize.
[2023-03-20 02:07:25] [INFO ] Deduced a trap composed of 23 places in 2493 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-20 02:07:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:07:25] [INFO ] After 27583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 569 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 9 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1453 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1453 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 61502 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61502 steps, saw 57430 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:07:31] [INFO ] Computed 1101 place invariants in 27 ms
[2023-03-20 02:07:32] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:07:33] [INFO ] [Nat]Absence check using 1048 positive place invariants in 335 ms returned sat
[2023-03-20 02:07:33] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 17 ms returned sat
[2023-03-20 02:07:35] [INFO ] After 2295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:07:36] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-20 02:07:36] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2023-03-20 02:07:36] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2023-03-20 02:07:37] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2023-03-20 02:07:37] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2023-03-20 02:07:38] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2023-03-20 02:07:38] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 0 ms to minimize.
[2023-03-20 02:07:38] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2023-03-20 02:07:39] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2023-03-20 02:07:39] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 0 ms to minimize.
[2023-03-20 02:07:40] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:07:40] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:07:40] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-20 02:07:41] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2023-03-20 02:07:41] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-20 02:07:41] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:07:42] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2023-03-20 02:07:42] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:07:42] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-20 02:07:44] [INFO ] Deduced a trap composed of 4 places in 1871 ms of which 0 ms to minimize.
[2023-03-20 02:07:45] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 0 ms to minimize.
[2023-03-20 02:07:46] [INFO ] Deduced a trap composed of 6 places in 1013 ms of which 1 ms to minimize.
[2023-03-20 02:07:46] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:07:47] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2023-03-20 02:07:47] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:07:48] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2023-03-20 02:07:48] [INFO ] Deduced a trap composed of 6 places in 717 ms of which 1 ms to minimize.
[2023-03-20 02:07:50] [INFO ] Deduced a trap composed of 6 places in 1078 ms of which 1 ms to minimize.
[2023-03-20 02:07:50] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 0 ms to minimize.
[2023-03-20 02:07:51] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-20 02:07:51] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:07:51] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 0 ms to minimize.
[2023-03-20 02:07:52] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-20 02:07:52] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:07:52] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 14 ms to minimize.
[2023-03-20 02:07:53] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-20 02:07:53] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2023-03-20 02:07:53] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-20 02:07:54] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:07:54] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:07:54] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2023-03-20 02:07:55] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 0 ms to minimize.
[2023-03-20 02:07:55] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 0 ms to minimize.
[2023-03-20 02:07:55] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-20 02:07:56] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 0 ms to minimize.
[2023-03-20 02:07:56] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-20 02:07:57] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 0 ms to minimize.
[2023-03-20 02:07:57] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:07:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:07:57] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 910 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 123 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 126 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:07:58] [INFO ] Invariant cache hit.
[2023-03-20 02:08:01] [INFO ] Implicit Places using invariants in 3023 ms returned []
[2023-03-20 02:08:01] [INFO ] Invariant cache hit.
[2023-03-20 02:08:05] [INFO ] Implicit Places using invariants and state equation in 4258 ms returned []
Implicit Place search using SMT with State Equation took 7283 ms to find 0 implicit places.
[2023-03-20 02:08:05] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 02:08:05] [INFO ] Invariant cache hit.
[2023-03-20 02:08:07] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9429 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 136 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:08:08] [INFO ] Invariant cache hit.
[2023-03-20 02:08:08] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:08:09] [INFO ] [Nat]Absence check using 1048 positive place invariants in 277 ms returned sat
[2023-03-20 02:08:09] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 124 ms returned sat
[2023-03-20 02:08:12] [INFO ] After 2324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:08:13] [INFO ] Deduced a trap composed of 4 places in 721 ms of which 6 ms to minimize.
[2023-03-20 02:08:13] [INFO ] Deduced a trap composed of 5 places in 736 ms of which 1 ms to minimize.
[2023-03-20 02:08:14] [INFO ] Deduced a trap composed of 4 places in 772 ms of which 6 ms to minimize.
[2023-03-20 02:08:15] [INFO ] Deduced a trap composed of 6 places in 711 ms of which 14 ms to minimize.
[2023-03-20 02:08:16] [INFO ] Deduced a trap composed of 5 places in 732 ms of which 15 ms to minimize.
[2023-03-20 02:08:17] [INFO ] Deduced a trap composed of 6 places in 635 ms of which 1 ms to minimize.
[2023-03-20 02:08:18] [INFO ] Deduced a trap composed of 4 places in 806 ms of which 1 ms to minimize.
[2023-03-20 02:08:19] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 3 ms to minimize.
[2023-03-20 02:08:19] [INFO ] Deduced a trap composed of 5 places in 654 ms of which 2 ms to minimize.
[2023-03-20 02:08:20] [INFO ] Deduced a trap composed of 6 places in 627 ms of which 10 ms to minimize.
[2023-03-20 02:08:21] [INFO ] Deduced a trap composed of 6 places in 688 ms of which 2 ms to minimize.
[2023-03-20 02:08:22] [INFO ] Deduced a trap composed of 6 places in 641 ms of which 2 ms to minimize.
[2023-03-20 02:08:22] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 1 ms to minimize.
[2023-03-20 02:08:23] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2023-03-20 02:08:24] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 1 ms to minimize.
[2023-03-20 02:08:24] [INFO ] Deduced a trap composed of 8 places in 484 ms of which 1 ms to minimize.
[2023-03-20 02:08:25] [INFO ] Deduced a trap composed of 5 places in 487 ms of which 1 ms to minimize.
[2023-03-20 02:08:26] [INFO ] Deduced a trap composed of 6 places in 505 ms of which 1 ms to minimize.
[2023-03-20 02:08:26] [INFO ] Deduced a trap composed of 9 places in 480 ms of which 1 ms to minimize.
[2023-03-20 02:08:27] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2023-03-20 02:08:27] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2023-03-20 02:08:28] [INFO ] Deduced a trap composed of 9 places in 533 ms of which 2 ms to minimize.
[2023-03-20 02:08:29] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-20 02:08:29] [INFO ] Deduced a trap composed of 6 places in 463 ms of which 1 ms to minimize.
[2023-03-20 02:08:30] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 0 ms to minimize.
[2023-03-20 02:08:30] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2023-03-20 02:08:31] [INFO ] Deduced a trap composed of 6 places in 579 ms of which 1 ms to minimize.
[2023-03-20 02:08:32] [INFO ] Deduced a trap composed of 6 places in 529 ms of which 2 ms to minimize.
[2023-03-20 02:08:32] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2023-03-20 02:08:33] [INFO ] Deduced a trap composed of 8 places in 576 ms of which 1 ms to minimize.
[2023-03-20 02:08:34] [INFO ] Deduced a trap composed of 6 places in 466 ms of which 1 ms to minimize.
[2023-03-20 02:08:34] [INFO ] Deduced a trap composed of 6 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:08:35] [INFO ] Deduced a trap composed of 6 places in 446 ms of which 1 ms to minimize.
[2023-03-20 02:08:35] [INFO ] Deduced a trap composed of 6 places in 435 ms of which 1 ms to minimize.
[2023-03-20 02:08:36] [INFO ] Deduced a trap composed of 12 places in 423 ms of which 1 ms to minimize.
[2023-03-20 02:08:36] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-03-20 02:08:37] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 1 ms to minimize.
[2023-03-20 02:08:37] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 3 ms to minimize.
[2023-03-20 02:08:38] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 0 ms to minimize.
[2023-03-20 02:08:38] [INFO ] Deduced a trap composed of 8 places in 428 ms of which 0 ms to minimize.
[2023-03-20 02:08:39] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:08:39] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2023-03-20 02:08:40] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 1 ms to minimize.
[2023-03-20 02:08:40] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2023-03-20 02:08:41] [INFO ] Deduced a trap composed of 28 places in 362 ms of which 1 ms to minimize.
[2023-03-20 02:08:41] [INFO ] Deduced a trap composed of 5 places in 358 ms of which 1 ms to minimize.
[2023-03-20 02:08:42] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 0 ms to minimize.
[2023-03-20 02:08:42] [INFO ] Deduced a trap composed of 6 places in 450 ms of which 1 ms to minimize.
[2023-03-20 02:08:43] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 1 ms to minimize.
[2023-03-20 02:08:43] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2023-03-20 02:08:44] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 1 ms to minimize.
[2023-03-20 02:08:44] [INFO ] Deduced a trap composed of 39 places in 334 ms of which 1 ms to minimize.
[2023-03-20 02:08:44] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 1 ms to minimize.
[2023-03-20 02:08:45] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 32853 ms
[2023-03-20 02:08:45] [INFO ] After 36064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 570 ms.
[2023-03-20 02:08:46] [INFO ] After 37885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 517 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 14 reset in 1878 ms.
Product exploration explored 100000 steps with 18 reset in 2370 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6102 transition count 5602
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 699 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 32 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2095 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2997 places in 11 ms
Iterating global reduction 1 with 2095 rules applied. Total rules applied 2997 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 3695 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 12 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 4393 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 12 ms
Applied a total of 4393 rules in 6550 ms. Remains 5404 /6102 variables (removed 698) and now considering 4905/5602 (removed 697) transitions.
[2023-03-20 02:08:59] [INFO ] Redundant transitions in 235 ms returned []
// Phase 1: matrix 4905 rows 5404 cols
[2023-03-20 02:08:59] [INFO ] Computed 1101 place invariants in 125 ms
[2023-03-20 02:09:04] [INFO ] Dead Transitions using invariants and state equation in 5347 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5404/6102 places, 4905/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12167 ms. Remains : 5404/6102 places, 4905/5602 transitions.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 693 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:09:05] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-20 02:09:08] [INFO ] Implicit Places using invariants in 2923 ms returned []
[2023-03-20 02:09:08] [INFO ] Invariant cache hit.
[2023-03-20 02:09:11] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 5849 ms to find 0 implicit places.
[2023-03-20 02:09:11] [INFO ] Invariant cache hit.
[2023-03-20 02:09:16] [INFO ] Dead Transitions using invariants and state equation in 5032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11588 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 290692 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 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6103 transition count 4901
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4401
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2406 place count 4899 transition count 4399
Iterating global reduction 2 with 2 rules applied. Total rules applied 2408 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2408 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2410 place count 4898 transition count 4398
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 9 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 6000 place count 3103 transition count 2603
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6002 place count 3101 transition count 2601
Applied a total of 6002 rules in 1729 ms. Remains 3101 /6104 variables (removed 3003) and now considering 2601/5604 (removed 3003) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:09:18] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-20 02:09:22] [INFO ] Implicit Places using invariants in 3091 ms returned []
[2023-03-20 02:09:22] [INFO ] Invariant cache hit.
[2023-03-20 02:09:27] [INFO ] Implicit Places using invariants and state equation in 5146 ms returned []
Implicit Place search using SMT with State Equation took 8264 ms to find 0 implicit places.
[2023-03-20 02:09:27] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-20 02:09:27] [INFO ] Invariant cache hit.
[2023-03-20 02:09:29] [INFO ] Dead Transitions using invariants and state equation in 2341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6104 places, 2601/5604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12433 ms. Remains : 3101/6104 places, 2601/5604 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s387 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6552 steps with 0 reset in 166 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-04 finished in 12685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6103 transition count 5603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6103 transition count 5603
Applied a total of 2 rules in 1348 ms. Remains 6103 /6104 variables (removed 1) and now considering 5603/5604 (removed 1) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-20 02:09:31] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-20 02:09:34] [INFO ] Implicit Places using invariants in 2979 ms returned []
[2023-03-20 02:09:34] [INFO ] Invariant cache hit.
[2023-03-20 02:09:37] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 5936 ms to find 0 implicit places.
[2023-03-20 02:09:37] [INFO ] Invariant cache hit.
[2023-03-20 02:09:42] [INFO ] Dead Transitions using invariants and state equation in 4802 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6104 places, 5603/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12087 ms. Remains : 6103/6104 places, 5603/5604 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s3627 1), p1:(NEQ s1831 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3386 ms.
Product exploration explored 100000 steps with 50000 reset in 3385 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/6103 stabilizing places and 1199/5603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 8 factoid took 378 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-05 finished in 19544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p2))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1275 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:09:50] [INFO ] Computed 1101 place invariants in 19 ms
[2023-03-20 02:09:53] [INFO ] Implicit Places using invariants in 2626 ms returned []
[2023-03-20 02:09:53] [INFO ] Invariant cache hit.
[2023-03-20 02:09:56] [INFO ] Implicit Places using invariants and state equation in 3444 ms returned []
Implicit Place search using SMT with State Equation took 6097 ms to find 0 implicit places.
[2023-03-20 02:09:56] [INFO ] Invariant cache hit.
[2023-03-20 02:10:01] [INFO ] Dead Transitions using invariants and state equation in 4748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12144 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2526 0) (EQ s2560 0)), p1:(OR (EQ s4242 0) (EQ s1886 0)), p2:(EQ s4242 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9 reset in 1809 ms.
Product exploration explored 100000 steps with 8 reset in 2210 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 984 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 02:10:07] [INFO ] Invariant cache hit.
[2023-03-20 02:10:09] [INFO ] After 1209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:10:11] [INFO ] [Nat]Absence check using 1101 positive place invariants in 730 ms returned sat
[2023-03-20 02:10:18] [INFO ] After 6629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:10:21] [INFO ] Deduced a trap composed of 20 places in 2874 ms of which 3 ms to minimize.
[2023-03-20 02:10:25] [INFO ] Deduced a trap composed of 24 places in 3111 ms of which 4 ms to minimize.
[2023-03-20 02:10:28] [INFO ] Deduced a trap composed of 22 places in 3044 ms of which 4 ms to minimize.
[2023-03-20 02:10:32] [INFO ] Deduced a trap composed of 23 places in 3925 ms of which 4 ms to minimize.
[2023-03-20 02:10:35] [INFO ] Deduced a trap composed of 14 places in 2680 ms of which 4 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-20 02:10:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:10:35] [INFO ] After 26187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1165 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 22 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 7 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1389 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1389 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) 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 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 54888 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54888 steps, saw 50288 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:10:41] [INFO ] Computed 1101 place invariants in 27 ms
[2023-03-20 02:10:42] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:10:43] [INFO ] [Nat]Absence check using 1055 positive place invariants in 360 ms returned sat
[2023-03-20 02:10:43] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2023-03-20 02:10:45] [INFO ] After 2560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:10:46] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 1 ms to minimize.
[2023-03-20 02:10:47] [INFO ] Deduced a trap composed of 6 places in 795 ms of which 1 ms to minimize.
[2023-03-20 02:10:48] [INFO ] Deduced a trap composed of 5 places in 522 ms of which 1 ms to minimize.
[2023-03-20 02:10:48] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2023-03-20 02:10:49] [INFO ] Deduced a trap composed of 5 places in 392 ms of which 1 ms to minimize.
[2023-03-20 02:10:49] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 2 ms to minimize.
[2023-03-20 02:10:50] [INFO ] Deduced a trap composed of 6 places in 611 ms of which 1 ms to minimize.
[2023-03-20 02:10:51] [INFO ] Deduced a trap composed of 6 places in 553 ms of which 1 ms to minimize.
[2023-03-20 02:10:51] [INFO ] Deduced a trap composed of 6 places in 458 ms of which 1 ms to minimize.
[2023-03-20 02:10:52] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 1 ms to minimize.
[2023-03-20 02:10:52] [INFO ] Deduced a trap composed of 5 places in 404 ms of which 1 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 1 ms to minimize.
[2023-03-20 02:10:55] [INFO ] Deduced a trap composed of 5 places in 1036 ms of which 27 ms to minimize.
[2023-03-20 02:10:55] [INFO ] Deduced a trap composed of 9 places in 446 ms of which 1 ms to minimize.
[2023-03-20 02:10:56] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 3 ms to minimize.
[2023-03-20 02:10:56] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 1 ms to minimize.
[2023-03-20 02:10:57] [INFO ] Deduced a trap composed of 8 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:10:57] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-20 02:10:58] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 1 ms to minimize.
[2023-03-20 02:10:58] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 2 ms to minimize.
[2023-03-20 02:10:58] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:10:59] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 1 ms to minimize.
[2023-03-20 02:10:59] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:11:00] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 1 ms to minimize.
[2023-03-20 02:11:01] [INFO ] Deduced a trap composed of 8 places in 478 ms of which 1 ms to minimize.
[2023-03-20 02:11:01] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 0 ms to minimize.
[2023-03-20 02:11:01] [INFO ] Deduced a trap composed of 8 places in 367 ms of which 1 ms to minimize.
[2023-03-20 02:11:02] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 1 ms to minimize.
[2023-03-20 02:11:03] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2023-03-20 02:11:03] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 1 ms to minimize.
[2023-03-20 02:11:04] [INFO ] Deduced a trap composed of 6 places in 883 ms of which 2 ms to minimize.
[2023-03-20 02:11:05] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 1 ms to minimize.
[2023-03-20 02:11:05] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 1 ms to minimize.
[2023-03-20 02:11:06] [INFO ] Deduced a trap composed of 6 places in 463 ms of which 1 ms to minimize.
[2023-03-20 02:11:06] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2023-03-20 02:11:07] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 1 ms to minimize.
[2023-03-20 02:11:07] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:11:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:11:07] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 335 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 138 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 137 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-20 02:11:08] [INFO ] Invariant cache hit.
[2023-03-20 02:11:11] [INFO ] Implicit Places using invariants in 2877 ms returned []
[2023-03-20 02:11:11] [INFO ] Invariant cache hit.
[2023-03-20 02:11:17] [INFO ] Implicit Places using invariants and state equation in 6585 ms returned []
Implicit Place search using SMT with State Equation took 9508 ms to find 0 implicit places.
[2023-03-20 02:11:17] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 02:11:17] [INFO ] Invariant cache hit.
[2023-03-20 02:11:20] [INFO ] Dead Transitions using invariants and state equation in 2980 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12696 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 168 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:11:20] [INFO ] Invariant cache hit.
[2023-03-20 02:11:21] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:11:22] [INFO ] [Nat]Absence check using 1055 positive place invariants in 247 ms returned sat
[2023-03-20 02:11:22] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 58 ms returned sat
[2023-03-20 02:11:25] [INFO ] After 2564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:11:25] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 1 ms to minimize.
[2023-03-20 02:11:28] [INFO ] Deduced a trap composed of 4 places in 2221 ms of which 1 ms to minimize.
[2023-03-20 02:11:28] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 1 ms to minimize.
[2023-03-20 02:11:29] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 1 ms to minimize.
[2023-03-20 02:11:30] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 1 ms to minimize.
[2023-03-20 02:11:30] [INFO ] Deduced a trap composed of 6 places in 493 ms of which 1 ms to minimize.
[2023-03-20 02:11:31] [INFO ] Deduced a trap composed of 6 places in 461 ms of which 1 ms to minimize.
[2023-03-20 02:11:32] [INFO ] Deduced a trap composed of 6 places in 511 ms of which 1 ms to minimize.
[2023-03-20 02:11:32] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 1 ms to minimize.
[2023-03-20 02:11:33] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2023-03-20 02:11:33] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 1 ms to minimize.
[2023-03-20 02:11:34] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 2 ms to minimize.
[2023-03-20 02:11:34] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:11:35] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2023-03-20 02:11:35] [INFO ] Deduced a trap composed of 4 places in 568 ms of which 1 ms to minimize.
[2023-03-20 02:11:36] [INFO ] Deduced a trap composed of 6 places in 385 ms of which 1 ms to minimize.
[2023-03-20 02:11:36] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-20 02:11:37] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2023-03-20 02:11:37] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 1 ms to minimize.
[2023-03-20 02:11:38] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:11:38] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:11:38] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2023-03-20 02:11:39] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 0 ms to minimize.
[2023-03-20 02:11:39] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-20 02:11:39] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 0 ms to minimize.
[2023-03-20 02:11:40] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2023-03-20 02:11:40] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-20 02:11:40] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2023-03-20 02:11:41] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:11:41] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 0 ms to minimize.
[2023-03-20 02:11:42] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2023-03-20 02:11:42] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:11:42] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 13 ms to minimize.
[2023-03-20 02:11:42] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-20 02:11:43] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 14 ms to minimize.
[2023-03-20 02:11:43] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-20 02:11:43] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-20 02:11:44] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-20 02:11:44] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2023-03-20 02:11:44] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:11:45] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-20 02:11:45] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 0 ms to minimize.
[2023-03-20 02:11:45] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-20 02:11:45] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-20 02:11:46] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-20 02:11:46] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:11:46] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21226 ms
[2023-03-20 02:11:46] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:11:47] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 0 ms to minimize.
[2023-03-20 02:11:47] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:11:47] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-20 02:11:48] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
[2023-03-20 02:11:48] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2023-03-20 02:11:48] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 1 ms to minimize.
[2023-03-20 02:11:49] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:11:49] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-20 02:11:49] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-20 02:11:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3145 ms
[2023-03-20 02:11:50] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:11:50] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2023-03-20 02:11:50] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:11:51] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:11:51] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2023-03-20 02:11:51] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2023-03-20 02:11:52] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-20 02:11:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2326 ms
[2023-03-20 02:11:52] [INFO ] After 29692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 577 ms.
[2023-03-20 02:11:52] [INFO ] After 31414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 1141 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 699 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:11:55] [INFO ] Computed 1101 place invariants in 18 ms
[2023-03-20 02:11:57] [INFO ] Implicit Places using invariants in 2729 ms returned []
[2023-03-20 02:11:58] [INFO ] Invariant cache hit.
[2023-03-20 02:12:00] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 5422 ms to find 0 implicit places.
[2023-03-20 02:12:00] [INFO ] Invariant cache hit.
[2023-03-20 02:12:06] [INFO ] Dead Transitions using invariants and state equation in 5330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11454 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 990 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 02:12:08] [INFO ] Invariant cache hit.
[2023-03-20 02:12:09] [INFO ] After 1276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:12:11] [INFO ] [Nat]Absence check using 1101 positive place invariants in 758 ms returned sat
[2023-03-20 02:12:19] [INFO ] After 6748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:12:23] [INFO ] Deduced a trap composed of 20 places in 3928 ms of which 3 ms to minimize.
[2023-03-20 02:12:26] [INFO ] Deduced a trap composed of 24 places in 2983 ms of which 3 ms to minimize.
[2023-03-20 02:12:29] [INFO ] Deduced a trap composed of 22 places in 2796 ms of which 5 ms to minimize.
[2023-03-20 02:12:33] [INFO ] Deduced a trap composed of 23 places in 3218 ms of which 4 ms to minimize.
[2023-03-20 02:12:36] [INFO ] Deduced a trap composed of 14 places in 3276 ms of which 4 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-20 02:12:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:12:36] [INFO ] After 27411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1293 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 27 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 7 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1377 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1377 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) 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 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67700 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67700 steps, saw 62482 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:12:43] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-20 02:12:44] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:12:44] [INFO ] [Nat]Absence check using 1055 positive place invariants in 213 ms returned sat
[2023-03-20 02:12:44] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-20 02:12:47] [INFO ] After 2703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:12:48] [INFO ] Deduced a trap composed of 6 places in 588 ms of which 1 ms to minimize.
[2023-03-20 02:12:49] [INFO ] Deduced a trap composed of 6 places in 608 ms of which 1 ms to minimize.
[2023-03-20 02:12:49] [INFO ] Deduced a trap composed of 5 places in 570 ms of which 1 ms to minimize.
[2023-03-20 02:12:50] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
[2023-03-20 02:12:51] [INFO ] Deduced a trap composed of 5 places in 424 ms of which 1 ms to minimize.
[2023-03-20 02:12:51] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 1 ms to minimize.
[2023-03-20 02:12:51] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 1 ms to minimize.
[2023-03-20 02:12:52] [INFO ] Deduced a trap composed of 6 places in 394 ms of which 0 ms to minimize.
[2023-03-20 02:12:52] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 0 ms to minimize.
[2023-03-20 02:12:53] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 1 ms to minimize.
[2023-03-20 02:12:54] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 2 ms to minimize.
[2023-03-20 02:12:54] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 1 ms to minimize.
[2023-03-20 02:12:55] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 2 ms to minimize.
[2023-03-20 02:12:55] [INFO ] Deduced a trap composed of 5 places in 407 ms of which 1 ms to minimize.
[2023-03-20 02:12:56] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 1 ms to minimize.
[2023-03-20 02:12:56] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2023-03-20 02:12:57] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 1 ms to minimize.
[2023-03-20 02:12:57] [INFO ] Deduced a trap composed of 8 places in 386 ms of which 1 ms to minimize.
[2023-03-20 02:12:58] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2023-03-20 02:12:58] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 0 ms to minimize.
[2023-03-20 02:12:59] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:12:59] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 2 ms to minimize.
[2023-03-20 02:13:00] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 1 ms to minimize.
[2023-03-20 02:13:00] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 1 ms to minimize.
[2023-03-20 02:13:00] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
[2023-03-20 02:13:01] [INFO ] Deduced a trap composed of 8 places in 671 ms of which 1 ms to minimize.
[2023-03-20 02:13:02] [INFO ] Deduced a trap composed of 6 places in 371 ms of which 1 ms to minimize.
[2023-03-20 02:13:02] [INFO ] Deduced a trap composed of 8 places in 426 ms of which 1 ms to minimize.
[2023-03-20 02:13:03] [INFO ] Deduced a trap composed of 4 places in 576 ms of which 1 ms to minimize.
[2023-03-20 02:13:03] [INFO ] Deduced a trap composed of 6 places in 500 ms of which 1 ms to minimize.
[2023-03-20 02:13:04] [INFO ] Deduced a trap composed of 9 places in 339 ms of which 1 ms to minimize.
[2023-03-20 02:13:07] [INFO ] Deduced a trap composed of 6 places in 2608 ms of which 1 ms to minimize.
[2023-03-20 02:13:07] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 1 ms to minimize.
[2023-03-20 02:13:08] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 2 ms to minimize.
[2023-03-20 02:13:08] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 2 ms to minimize.
[2023-03-20 02:13:08] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 0 ms to minimize.
[2023-03-20 02:13:09] [INFO ] Deduced a trap composed of 14 places in 372 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:13:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:13:09] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 577 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 155 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 158 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-20 02:13:10] [INFO ] Invariant cache hit.
[2023-03-20 02:13:13] [INFO ] Implicit Places using invariants in 3092 ms returned []
[2023-03-20 02:13:13] [INFO ] Invariant cache hit.
[2023-03-20 02:13:19] [INFO ] Implicit Places using invariants and state equation in 6291 ms returned []
Implicit Place search using SMT with State Equation took 9427 ms to find 0 implicit places.
[2023-03-20 02:13:19] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-20 02:13:19] [INFO ] Invariant cache hit.
[2023-03-20 02:13:21] [INFO ] Dead Transitions using invariants and state equation in 1960 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11637 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 153 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:13:21] [INFO ] Invariant cache hit.
[2023-03-20 02:13:22] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:13:23] [INFO ] [Nat]Absence check using 1055 positive place invariants in 295 ms returned sat
[2023-03-20 02:13:23] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 36 ms returned sat
[2023-03-20 02:13:25] [INFO ] After 2140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:13:26] [INFO ] Deduced a trap composed of 5 places in 785 ms of which 2 ms to minimize.
[2023-03-20 02:13:27] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 1 ms to minimize.
[2023-03-20 02:13:27] [INFO ] Deduced a trap composed of 6 places in 698 ms of which 1 ms to minimize.
[2023-03-20 02:13:28] [INFO ] Deduced a trap composed of 6 places in 469 ms of which 1 ms to minimize.
[2023-03-20 02:13:29] [INFO ] Deduced a trap composed of 5 places in 535 ms of which 1 ms to minimize.
[2023-03-20 02:13:29] [INFO ] Deduced a trap composed of 6 places in 582 ms of which 1 ms to minimize.
[2023-03-20 02:13:30] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2023-03-20 02:13:30] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 2 ms to minimize.
[2023-03-20 02:13:31] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 2 ms to minimize.
[2023-03-20 02:13:32] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 1 ms to minimize.
[2023-03-20 02:13:33] [INFO ] Deduced a trap composed of 4 places in 1148 ms of which 2 ms to minimize.
[2023-03-20 02:13:34] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 1 ms to minimize.
[2023-03-20 02:13:34] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:13:34] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2023-03-20 02:13:35] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-20 02:13:35] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 1 ms to minimize.
[2023-03-20 02:13:36] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 0 ms to minimize.
[2023-03-20 02:13:36] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 1 ms to minimize.
[2023-03-20 02:13:37] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-20 02:13:37] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-20 02:13:38] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 1 ms to minimize.
[2023-03-20 02:13:38] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:13:38] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:13:39] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-20 02:13:39] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:13:39] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:13:40] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2023-03-20 02:13:40] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:13:41] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 0 ms to minimize.
[2023-03-20 02:13:41] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:13:41] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2023-03-20 02:13:42] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:13:42] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 1 ms to minimize.
[2023-03-20 02:13:42] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 0 ms to minimize.
[2023-03-20 02:13:43] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 1 ms to minimize.
[2023-03-20 02:13:43] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 2 ms to minimize.
[2023-03-20 02:13:44] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:13:44] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-20 02:13:44] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2023-03-20 02:13:44] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-20 02:13:45] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-20 02:13:45] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-20 02:13:46] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:13:46] [INFO ] Deduced a trap composed of 6 places in 503 ms of which 1 ms to minimize.
[2023-03-20 02:13:46] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-20 02:13:47] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-20 02:13:47] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21814 ms
[2023-03-20 02:13:48] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 1 ms to minimize.
[2023-03-20 02:13:48] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 0 ms to minimize.
[2023-03-20 02:13:48] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-20 02:13:49] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-20 02:13:49] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-20 02:13:49] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:13:50] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-20 02:13:50] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:13:50] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 0 ms to minimize.
[2023-03-20 02:13:51] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-20 02:13:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3728 ms
[2023-03-20 02:13:52] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2023-03-20 02:13:52] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:13:52] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-20 02:13:53] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:13:53] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:13:53] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:13:54] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2023-03-20 02:13:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2611 ms
[2023-03-20 02:13:54] [INFO ] After 31018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 567 ms.
[2023-03-20 02:13:55] [INFO ] After 32695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 1427 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9 reset in 1705 ms.
Product exploration explored 100000 steps with 8 reset in 2212 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 603 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:14:01] [INFO ] Computed 1101 place invariants in 37 ms
[2023-03-20 02:14:04] [INFO ] Implicit Places using invariants in 2695 ms returned []
[2023-03-20 02:14:04] [INFO ] Invariant cache hit.
[2023-03-20 02:14:07] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 5394 ms to find 0 implicit places.
[2023-03-20 02:14:07] [INFO ] Invariant cache hit.
[2023-03-20 02:14:11] [INFO ] Dead Transitions using invariants and state equation in 4494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10495 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-06 finished in 262441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p1)||X(G(p2)))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1330 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-20 02:14:13] [INFO ] Invariant cache hit.
[2023-03-20 02:14:15] [INFO ] Implicit Places using invariants in 2721 ms returned []
[2023-03-20 02:14:15] [INFO ] Invariant cache hit.
[2023-03-20 02:14:18] [INFO ] Implicit Places using invariants and state equation in 2555 ms returned []
Implicit Place search using SMT with State Equation took 5278 ms to find 0 implicit places.
[2023-03-20 02:14:18] [INFO ] Invariant cache hit.
[2023-03-20 02:14:23] [INFO ] Dead Transitions using invariants and state equation in 4907 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11526 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s4375 0), p2:(EQ s2719 1), p0:(EQ s4375 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-07 finished in 11775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(((p1&&F(!p1)) U (!p1&&F(p2)))))))'
Support contains 3 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6103 transition count 5603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6103 transition count 5603
Applied a total of 2 rules in 1222 ms. Remains 6103 /6104 variables (removed 1) and now considering 5603/5604 (removed 1) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-20 02:14:24] [INFO ] Computed 1101 place invariants in 70 ms
[2023-03-20 02:14:27] [INFO ] Implicit Places using invariants in 2960 ms returned []
[2023-03-20 02:14:27] [INFO ] Invariant cache hit.
[2023-03-20 02:14:30] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 5664 ms to find 0 implicit places.
[2023-03-20 02:14:30] [INFO ] Invariant cache hit.
[2023-03-20 02:14:35] [INFO ] Dead Transitions using invariants and state equation in 4557 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6104 places, 5603/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11458 ms. Remains : 6103/6104 places, 5603/5604 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6023 1), p1:(NEQ s3669 1), p2:(EQ s4570 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]]
Stuttering criterion allowed to conclude after 15840 steps with 0 reset in 297 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-08 finished in 12103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6103 transition count 4903
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 5403 transition count 4902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 5402 transition count 4902
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1402 place count 5402 transition count 4401
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2406 place count 4899 transition count 4399
Iterating global reduction 3 with 2 rules applied. Total rules applied 2408 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2408 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 4898 transition count 4398
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 7 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5997 place count 3104 transition count 2604
Applied a total of 5997 rules in 1458 ms. Remains 3104 /6104 variables (removed 3000) and now considering 2604/5604 (removed 3000) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:14:37] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-20 02:14:39] [INFO ] Implicit Places using invariants in 2008 ms returned []
[2023-03-20 02:14:39] [INFO ] Invariant cache hit.
[2023-03-20 02:14:44] [INFO ] Implicit Places using invariants and state equation in 4826 ms returned []
Implicit Place search using SMT with State Equation took 6847 ms to find 0 implicit places.
[2023-03-20 02:14:44] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-20 02:14:44] [INFO ] Invariant cache hit.
[2023-03-20 02:14:45] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6104 places, 2604/5604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10101 ms. Remains : 3104/6104 places, 2604/5604 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2465 1) (EQ s2508 1) (EQ s3043 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 97 reset in 1631 ms.
Product exploration explored 100000 steps with 95 reset in 2043 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1095 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2023-03-20 02:14:50] [INFO ] Invariant cache hit.
[2023-03-20 02:14:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 1582 ms returned sat
[2023-03-20 02:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:15:05] [INFO ] [Real]Absence check using state equation in 9058 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 238 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:15:05] [INFO ] Invariant cache hit.
[2023-03-20 02:15:07] [INFO ] Implicit Places using invariants in 2105 ms returned []
[2023-03-20 02:15:07] [INFO ] Invariant cache hit.
[2023-03-20 02:15:14] [INFO ] Implicit Places using invariants and state equation in 6736 ms returned []
Implicit Place search using SMT with State Equation took 8867 ms to find 0 implicit places.
[2023-03-20 02:15:14] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-20 02:15:14] [INFO ] Invariant cache hit.
[2023-03-20 02:15:16] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10861 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1125 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
[2023-03-20 02:15:17] [INFO ] Invariant cache hit.
[2023-03-20 02:15:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 1537 ms returned sat
[2023-03-20 02:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:15:32] [INFO ] [Real]Absence check using state equation in 8861 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 96 reset in 1707 ms.
Product exploration explored 100000 steps with 95 reset in 2068 ms.
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 136 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:15:36] [INFO ] Invariant cache hit.
[2023-03-20 02:15:38] [INFO ] Implicit Places using invariants in 2129 ms returned []
[2023-03-20 02:15:38] [INFO ] Invariant cache hit.
[2023-03-20 02:15:43] [INFO ] Implicit Places using invariants and state equation in 4890 ms returned []
Implicit Place search using SMT with State Equation took 7025 ms to find 0 implicit places.
[2023-03-20 02:15:43] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-20 02:15:43] [INFO ] Invariant cache hit.
[2023-03-20 02:15:45] [INFO ] Dead Transitions using invariants and state equation in 2691 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9984 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-10 finished in 70312 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)&&X(X(X(X(X(X(X(X(F(p1))))))))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1280 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:15:47] [INFO ] Computed 1101 place invariants in 18 ms
[2023-03-20 02:15:50] [INFO ] Implicit Places using invariants in 2691 ms returned []
[2023-03-20 02:15:50] [INFO ] Invariant cache hit.
[2023-03-20 02:15:53] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 5596 ms to find 0 implicit places.
[2023-03-20 02:15:53] [INFO ] Invariant cache hit.
[2023-03-20 02:15:58] [INFO ] Dead Transitions using invariants and state equation in 5166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12058 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 653 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 11}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 11}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 11}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 11}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 11}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 11}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 11}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 11}], [{ cond=p0, acceptance={} source=8 dest: 7}, { cond=(NOT p0), acceptance={} source=8 dest: 11}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={} source=10 dest: 9}], [{ cond=true, acceptance={0} source=11 dest: 11}]], initial=10, aps=[p0:(AND (EQ s668 1) (EQ s748 1)), p1:(OR (EQ s1318 0) (EQ s1320 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-11 finished in 12796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(G((F(p2)&&p1)))))))'
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1312 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-20 02:16:00] [INFO ] Invariant cache hit.
[2023-03-20 02:16:03] [INFO ] Implicit Places using invariants in 2952 ms returned []
[2023-03-20 02:16:03] [INFO ] Invariant cache hit.
[2023-03-20 02:16:05] [INFO ] Implicit Places using invariants and state equation in 2668 ms returned []
Implicit Place search using SMT with State Equation took 5647 ms to find 0 implicit places.
[2023-03-20 02:16:05] [INFO ] Invariant cache hit.
[2023-03-20 02:16:06] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7709 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s77 0), p1:(AND (EQ s791 1) (EQ s819 1)), p2:(AND (EQ s1508 1) (EQ s1588 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1208 ms.
Product exploration explored 100000 steps with 34 reset in 1242 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/6102 stabilizing places and 1199/5602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 02:16:10] [INFO ] Invariant cache hit.
[2023-03-20 02:16:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 795 ms returned sat
[2023-03-20 02:16:18] [INFO ] After 7677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:16:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 648 ms returned sat
[2023-03-20 02:16:28] [INFO ] After 8237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:16:32] [INFO ] Deduced a trap composed of 22 places in 3163 ms of which 4 ms to minimize.
[2023-03-20 02:16:35] [INFO ] Deduced a trap composed of 25 places in 3036 ms of which 4 ms to minimize.
[2023-03-20 02:16:39] [INFO ] Deduced a trap composed of 24 places in 4167 ms of which 4 ms to minimize.
[2023-03-20 02:16:43] [INFO ] Deduced a trap composed of 26 places in 3779 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: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-20 02:16:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:16:43] [INFO ] After 25175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 596 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4400
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 7 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5996 place count 3104 transition count 2604
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 893 times.
Drop transitions removed 893 transitions
Iterating global reduction 2 with 893 rules applied. Total rules applied 6889 place count 3104 transition count 2604
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6890 place count 3103 transition count 2603
Applied a total of 6890 rules in 1368 ms. Remains 3103 /6102 variables (removed 2999) and now considering 2603/5602 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1368 ms. Remains : 3103/6102 places, 2603/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 79211 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79211 steps, saw 74044 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:16:49] [INFO ] Computed 1101 place invariants in 47 ms
[2023-03-20 02:16:50] [INFO ] [Real]Absence check using 1045 positive place invariants in 289 ms returned sat
[2023-03-20 02:16:50] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 10 ms returned sat
[2023-03-20 02:16:52] [INFO ] After 2618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:16:52] [INFO ] [Nat]Absence check using 1045 positive place invariants in 341 ms returned sat
[2023-03-20 02:16:52] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 14 ms returned sat
[2023-03-20 02:16:55] [INFO ] After 2258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:16:55] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 1 ms to minimize.
[2023-03-20 02:16:56] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2023-03-20 02:16:56] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2023-03-20 02:16:56] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2023-03-20 02:16:57] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 1 ms to minimize.
[2023-03-20 02:16:57] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 0 ms to minimize.
[2023-03-20 02:16:58] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 0 ms to minimize.
[2023-03-20 02:16:58] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 3 ms to minimize.
[2023-03-20 02:16:59] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 1 ms to minimize.
[2023-03-20 02:17:00] [INFO ] Deduced a trap composed of 9 places in 577 ms of which 1 ms to minimize.
[2023-03-20 02:17:00] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:17:01] [INFO ] Deduced a trap composed of 3 places in 485 ms of which 0 ms to minimize.
[2023-03-20 02:17:01] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2023-03-20 02:17:02] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2023-03-20 02:17:02] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:17:02] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:17:03] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:17:03] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:17:03] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2023-03-20 02:17:04] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 1 ms to minimize.
[2023-03-20 02:17:04] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
[2023-03-20 02:17:05] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:17:05] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-20 02:17:05] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:17:06] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-20 02:17:06] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2023-03-20 02:17:07] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 0 ms to minimize.
[2023-03-20 02:17:07] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-20 02:17:07] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2023-03-20 02:17:08] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:17:08] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-20 02:17:08] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 1 ms to minimize.
[2023-03-20 02:17:09] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 0 ms to minimize.
[2023-03-20 02:17:09] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2023-03-20 02:17:10] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:17:10] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 1 ms to minimize.
[2023-03-20 02:17:10] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:17:10] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 15457 ms
[2023-03-20 02:17:11] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 0 ms to minimize.
[2023-03-20 02:17:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-20 02:17:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-20 02:17:11] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-20 02:17:12] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-20 02:17:12] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-20 02:17:12] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:17:13] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:17:13] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-20 02:17:14] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2023-03-20 02:17:14] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:17:14] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:17:15] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 1 ms to minimize.
[2023-03-20 02:17:15] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2023-03-20 02:17:15] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 0 ms to minimize.
[2023-03-20 02:17:16] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-20 02:17:16] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2023-03-20 02:17:16] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:17:17] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:17:17] [INFO ] Trap strengthening (SAT) tested/added 17/17 trap constraints in 5826 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-20 02:17:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:17:17] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 286 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 134 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 175 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:17:17] [INFO ] Invariant cache hit.
[2023-03-20 02:17:20] [INFO ] Implicit Places using invariants in 3108 ms returned []
[2023-03-20 02:17:20] [INFO ] Invariant cache hit.
[2023-03-20 02:17:27] [INFO ] Implicit Places using invariants and state equation in 6253 ms returned []
Implicit Place search using SMT with State Equation took 9376 ms to find 0 implicit places.
[2023-03-20 02:17:27] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 02:17:27] [INFO ] Invariant cache hit.
[2023-03-20 02:17:29] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11909 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 150 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-20 02:17:29] [INFO ] Invariant cache hit.
[2023-03-20 02:17:30] [INFO ] [Real]Absence check using 1045 positive place invariants in 243 ms returned sat
[2023-03-20 02:17:30] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 30 ms returned sat
[2023-03-20 02:17:33] [INFO ] After 4081ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:17:34] [INFO ] [Nat]Absence check using 1045 positive place invariants in 308 ms returned sat
[2023-03-20 02:17:34] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 114 ms returned sat
[2023-03-20 02:17:36] [INFO ] After 2286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:17:37] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 1 ms to minimize.
[2023-03-20 02:17:38] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 1 ms to minimize.
[2023-03-20 02:17:38] [INFO ] Deduced a trap composed of 5 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:17:39] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2023-03-20 02:17:39] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 1 ms to minimize.
[2023-03-20 02:17:40] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2023-03-20 02:17:40] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 1 ms to minimize.
[2023-03-20 02:17:41] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2023-03-20 02:17:41] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 1 ms to minimize.
[2023-03-20 02:17:41] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 0 ms to minimize.
[2023-03-20 02:17:42] [INFO ] Deduced a trap composed of 6 places in 426 ms of which 1 ms to minimize.
[2023-03-20 02:17:43] [INFO ] Deduced a trap composed of 9 places in 424 ms of which 0 ms to minimize.
[2023-03-20 02:17:43] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:17:43] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2023-03-20 02:17:44] [INFO ] Deduced a trap composed of 9 places in 378 ms of which 1 ms to minimize.
[2023-03-20 02:17:44] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 1 ms to minimize.
[2023-03-20 02:17:45] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 0 ms to minimize.
[2023-03-20 02:17:45] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 1 ms to minimize.
[2023-03-20 02:17:46] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 1 ms to minimize.
[2023-03-20 02:17:46] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-20 02:17:47] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-20 02:17:47] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2023-03-20 02:17:48] [INFO ] Deduced a trap composed of 7 places in 421 ms of which 1 ms to minimize.
[2023-03-20 02:17:48] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-20 02:17:48] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:17:49] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-20 02:17:49] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:17:49] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-20 02:17:50] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2023-03-20 02:17:50] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 0 ms to minimize.
[2023-03-20 02:17:51] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2023-03-20 02:17:51] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-20 02:17:51] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:17:52] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:17:52] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2023-03-20 02:17:52] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 0 ms to minimize.
[2023-03-20 02:17:53] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-20 02:17:53] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2023-03-20 02:17:54] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:17:54] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 0 ms to minimize.
[2023-03-20 02:17:54] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-20 02:17:55] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2023-03-20 02:17:55] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-20 02:17:56] [INFO ] Deduced a trap composed of 17 places in 610 ms of which 0 ms to minimize.
[2023-03-20 02:17:56] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2023-03-20 02:17:57] [INFO ] Deduced a trap composed of 6 places in 588 ms of which 1 ms to minimize.
[2023-03-20 02:17:59] [INFO ] Deduced a trap composed of 6 places in 2179 ms of which 1 ms to minimize.
[2023-03-20 02:18:00] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-20 02:18:02] [INFO ] Deduced a trap composed of 8 places in 2112 ms of which 2 ms to minimize.
[2023-03-20 02:18:02] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 0 ms to minimize.
[2023-03-20 02:18:03] [INFO ] Deduced a trap composed of 6 places in 502 ms of which 1 ms to minimize.
[2023-03-20 02:18:03] [INFO ] Deduced a trap composed of 6 places in 571 ms of which 0 ms to minimize.
[2023-03-20 02:18:04] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 2 ms to minimize.
[2023-03-20 02:18:04] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 1 ms to minimize.
[2023-03-20 02:18:05] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:18:05] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 2 ms to minimize.
[2023-03-20 02:18:05] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:18:06] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2023-03-20 02:18:06] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:18:07] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-20 02:18:07] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-20 02:18:07] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-20 02:18:07] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 14 ms to minimize.
[2023-03-20 02:18:08] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-20 02:18:09] [INFO ] Deduced a trap composed of 20 places in 741 ms of which 1 ms to minimize.
[2023-03-20 02:18:09] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 32164 ms
[2023-03-20 02:18:09] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:18:09] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-20 02:18:10] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:18:10] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-20 02:18:10] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 0 ms to minimize.
[2023-03-20 02:18:11] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2023-03-20 02:18:11] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:18:11] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-20 02:18:12] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2023-03-20 02:18:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2740 ms
[2023-03-20 02:18:12] [INFO ] After 37707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-20 02:18:12] [INFO ] After 39037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:18:13] [INFO ] Computed 1101 place invariants in 55 ms
Proved EG (NOT p1)
[2023-03-20 02:18:21] [INFO ] Invariant cache hit.
[2023-03-20 02:18:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 5812 ms returned sat
[2023-03-20 02:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:18:36] [INFO ] [Real]Absence check using state equation in 2307 ms returned unknown
Could not prove EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-13 finished in 157807 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((p0 U p1)))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1390 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-20 02:18:38] [INFO ] Invariant cache hit.
[2023-03-20 02:18:41] [INFO ] Implicit Places using invariants in 3511 ms returned []
[2023-03-20 02:18:41] [INFO ] Invariant cache hit.
[2023-03-20 02:18:44] [INFO ] Implicit Places using invariants and state equation in 3130 ms returned []
Implicit Place search using SMT with State Equation took 6669 ms to find 0 implicit places.
[2023-03-20 02:18:44] [INFO ] Invariant cache hit.
[2023-03-20 02:18:49] [INFO ] Dead Transitions using invariants and state equation in 4697 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12774 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s712 1) (EQ s1891 1)), p0:(NEQ s1891 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]]
Product exploration explored 100000 steps with 25000 reset in 1922 ms.
Product exploration explored 100000 steps with 25000 reset in 1852 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162240 steps, run timeout after 3002 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162240 steps, saw 159824 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:18:57] [INFO ] Invariant cache hit.
[2023-03-20 02:18:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 609 ms returned sat
[2023-03-20 02:18:58] [INFO ] After 1471ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 02:19:00] [INFO ] [Nat]Absence check using 1101 positive place invariants in 781 ms returned sat
[2023-03-20 02:19:05] [INFO ] After 4977ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 02:19:08] [INFO ] Deduced a trap composed of 22 places in 2916 ms of which 4 ms to minimize.
[2023-03-20 02:19:11] [INFO ] Deduced a trap composed of 20 places in 2957 ms of which 4 ms to minimize.
[2023-03-20 02:19:14] [INFO ] Deduced a trap composed of 30 places in 2767 ms of which 3 ms to minimize.
[2023-03-20 02:19:18] [INFO ] Deduced a trap composed of 35 places in 3562 ms of which 4 ms to minimize.
[2023-03-20 02:19:22] [INFO ] Deduced a trap composed of 16 places in 3380 ms of which 4 ms to minimize.
[2023-03-20 02:19:25] [INFO ] Deduced a trap composed of 25 places in 3414 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: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-20 02:19:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:19:25] [INFO ] After 26912ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 23 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 7 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6897 place count 3101 transition count 2601
Applied a total of 6897 rules in 1435 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1435 ms. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112045 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112045 steps, saw 105415 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:19:30] [INFO ] Computed 1101 place invariants in 75 ms
[2023-03-20 02:19:31] [INFO ] [Real]Absence check using 1052 positive place invariants in 252 ms returned sat
[2023-03-20 02:19:31] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 13 ms returned sat
[2023-03-20 02:19:31] [INFO ] After 824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:19:32] [INFO ] [Nat]Absence check using 1052 positive place invariants in 187 ms returned sat
[2023-03-20 02:19:32] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 19 ms returned sat
[2023-03-20 02:19:34] [INFO ] After 2065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:19:34] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-20 02:19:35] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 0 ms to minimize.
[2023-03-20 02:19:35] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 1 ms to minimize.
[2023-03-20 02:19:36] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:19:36] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:19:36] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:19:37] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2023-03-20 02:19:37] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-20 02:19:38] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 1 ms to minimize.
[2023-03-20 02:19:38] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:19:39] [INFO ] Deduced a trap composed of 5 places in 408 ms of which 1 ms to minimize.
[2023-03-20 02:19:39] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2023-03-20 02:19:40] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2023-03-20 02:19:40] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:19:41] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-20 02:19:41] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 0 ms to minimize.
[2023-03-20 02:19:41] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2023-03-20 02:19:42] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:19:42] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:19:43] [INFO ] Deduced a trap composed of 6 places in 373 ms of which 1 ms to minimize.
[2023-03-20 02:19:43] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2023-03-20 02:19:43] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:19:44] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2023-03-20 02:19:44] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 0 ms to minimize.
[2023-03-20 02:19:44] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-20 02:19:45] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 0 ms to minimize.
[2023-03-20 02:19:45] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:19:45] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:19:46] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:19:46] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-20 02:19:46] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:19:47] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:19:47] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2023-03-20 02:19:47] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:19:47] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:19:48] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:19:48] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 0 ms to minimize.
[2023-03-20 02:19:48] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:19:49] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14806 ms
[2023-03-20 02:19:49] [INFO ] After 16944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-20 02:19:49] [INFO ] After 17695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 217 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 136 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:19:49] [INFO ] Invariant cache hit.
[2023-03-20 02:19:52] [INFO ] Implicit Places using invariants in 2774 ms returned []
[2023-03-20 02:19:52] [INFO ] Invariant cache hit.
[2023-03-20 02:19:59] [INFO ] Implicit Places using invariants and state equation in 7406 ms returned []
Implicit Place search using SMT with State Equation took 10185 ms to find 0 implicit places.
[2023-03-20 02:20:00] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:20:00] [INFO ] Invariant cache hit.
[2023-03-20 02:20:01] [INFO ] Dead Transitions using invariants and state equation in 1613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12009 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 136 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 02:20:01] [INFO ] Invariant cache hit.
[2023-03-20 02:20:02] [INFO ] [Real]Absence check using 1052 positive place invariants in 299 ms returned sat
[2023-03-20 02:20:02] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 58 ms returned sat
[2023-03-20 02:20:02] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:20:03] [INFO ] [Nat]Absence check using 1052 positive place invariants in 223 ms returned sat
[2023-03-20 02:20:03] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 110 ms returned sat
[2023-03-20 02:20:05] [INFO ] After 2338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:20:06] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 0 ms to minimize.
[2023-03-20 02:20:06] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2023-03-20 02:20:07] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 1 ms to minimize.
[2023-03-20 02:20:07] [INFO ] Deduced a trap composed of 5 places in 432 ms of which 1 ms to minimize.
[2023-03-20 02:20:08] [INFO ] Deduced a trap composed of 8 places in 400 ms of which 1 ms to minimize.
[2023-03-20 02:20:08] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2023-03-20 02:20:08] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 0 ms to minimize.
[2023-03-20 02:20:09] [INFO ] Deduced a trap composed of 7 places in 308 ms of which 1 ms to minimize.
[2023-03-20 02:20:09] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:20:10] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 0 ms to minimize.
[2023-03-20 02:20:10] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:20:10] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-20 02:20:11] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-20 02:20:11] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-20 02:20:11] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 1 ms to minimize.
[2023-03-20 02:20:11] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-20 02:20:12] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:20:12] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:20:12] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7103 ms
[2023-03-20 02:20:12] [INFO ] After 9521ms 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-20 02:20:13] [INFO ] After 10452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 697 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:20:14] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-20 02:20:17] [INFO ] Implicit Places using invariants in 2707 ms returned []
[2023-03-20 02:20:17] [INFO ] Invariant cache hit.
[2023-03-20 02:20:19] [INFO ] Implicit Places using invariants and state equation in 2760 ms returned []
Implicit Place search using SMT with State Equation took 5479 ms to find 0 implicit places.
[2023-03-20 02:20:19] [INFO ] Invariant cache hit.
[2023-03-20 02:20:23] [INFO ] Dead Transitions using invariants and state equation in 3701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9878 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216552 steps, run timeout after 3367 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 216552 steps, saw 211364 distinct states, run finished after 3367 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:20:27] [INFO ] Invariant cache hit.
[2023-03-20 02:20:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 780 ms returned sat
[2023-03-20 02:20:34] [INFO ] After 6616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:20:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 686 ms returned sat
[2023-03-20 02:20:41] [INFO ] After 6044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:20:45] [INFO ] Deduced a trap composed of 27 places in 3248 ms of which 3 ms to minimize.
[2023-03-20 02:20:48] [INFO ] Deduced a trap composed of 20 places in 3336 ms of which 4 ms to minimize.
[2023-03-20 02:20:51] [INFO ] Deduced a trap composed of 25 places in 2878 ms of which 3 ms to minimize.
[2023-03-20 02:20:54] [INFO ] Deduced a trap composed of 21 places in 2604 ms of which 3 ms to minimize.
[2023-03-20 02:20:57] [INFO ] Deduced a trap composed of 14 places in 3059 ms of which 5 ms to minimize.
[2023-03-20 02:21:01] [INFO ] Deduced a trap composed of 24 places in 3455 ms of which 4 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-20 02:21:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:21:01] [INFO ] After 27419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 97 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 26 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 8 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6897 place count 3101 transition count 2601
Applied a total of 6897 rules in 1496 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1496 ms. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 100843 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100843 steps, saw 94740 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:21:06] [INFO ] Computed 1101 place invariants in 60 ms
[2023-03-20 02:21:07] [INFO ] [Real]Absence check using 1052 positive place invariants in 299 ms returned sat
[2023-03-20 02:21:07] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 36 ms returned sat
[2023-03-20 02:21:07] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:21:08] [INFO ] [Nat]Absence check using 1052 positive place invariants in 270 ms returned sat
[2023-03-20 02:21:08] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 312 ms returned sat
[2023-03-20 02:21:10] [INFO ] After 2068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:21:10] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2023-03-20 02:21:11] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 1 ms to minimize.
[2023-03-20 02:21:12] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 0 ms to minimize.
[2023-03-20 02:21:12] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-20 02:21:12] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 2 ms to minimize.
[2023-03-20 02:21:13] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2023-03-20 02:21:13] [INFO ] Deduced a trap composed of 5 places in 449 ms of which 1 ms to minimize.
[2023-03-20 02:21:14] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2023-03-20 02:21:14] [INFO ] Deduced a trap composed of 6 places in 440 ms of which 1 ms to minimize.
[2023-03-20 02:21:15] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:21:15] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2023-03-20 02:21:16] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2023-03-20 02:21:16] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:21:17] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-20 02:21:17] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:21:17] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2023-03-20 02:21:19] [INFO ] Deduced a trap composed of 5 places in 1441 ms of which 1 ms to minimize.
[2023-03-20 02:21:19] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:21:20] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:21:20] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:21:20] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:21:20] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2023-03-20 02:21:21] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-20 02:21:21] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:21:21] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:21:22] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-20 02:21:22] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 0 ms to minimize.
[2023-03-20 02:21:22] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 5 ms to minimize.
[2023-03-20 02:21:23] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:21:23] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-20 02:21:23] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2023-03-20 02:21:23] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-20 02:21:24] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:21:24] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:21:24] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-20 02:21:25] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:21:25] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 6 ms to minimize.
[2023-03-20 02:21:25] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-20 02:21:26] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:21:26] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2023-03-20 02:21:26] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-20 02:21:26] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-20 02:21:27] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-20 02:21:27] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-20 02:21:27] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-20 02:21:27] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 17128 ms
[2023-03-20 02:21:27] [INFO ] After 19326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-20 02:21:27] [INFO ] After 20573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 227 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 149 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:21:28] [INFO ] Invariant cache hit.
[2023-03-20 02:21:32] [INFO ] Implicit Places using invariants in 3693 ms returned []
[2023-03-20 02:21:32] [INFO ] Invariant cache hit.
[2023-03-20 02:21:39] [INFO ] Implicit Places using invariants and state equation in 7455 ms returned []
Implicit Place search using SMT with State Equation took 11165 ms to find 0 implicit places.
[2023-03-20 02:21:39] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 02:21:39] [INFO ] Invariant cache hit.
[2023-03-20 02:21:42] [INFO ] Dead Transitions using invariants and state equation in 2346 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13743 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 176 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 02:21:42] [INFO ] Invariant cache hit.
[2023-03-20 02:21:42] [INFO ] [Real]Absence check using 1052 positive place invariants in 277 ms returned sat
[2023-03-20 02:21:42] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 12 ms returned sat
[2023-03-20 02:21:46] [INFO ] After 3997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:21:46] [INFO ] [Nat]Absence check using 1052 positive place invariants in 231 ms returned sat
[2023-03-20 02:21:46] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 18 ms returned sat
[2023-03-20 02:21:48] [INFO ] After 1752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:21:49] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2023-03-20 02:21:49] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:21:49] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-20 02:21:50] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-20 02:21:50] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-20 02:21:50] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2023-03-20 02:21:51] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:21:51] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2023-03-20 02:21:51] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2023-03-20 02:21:52] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-20 02:21:52] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2023-03-20 02:21:52] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-20 02:21:52] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:21:53] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:21:53] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2023-03-20 02:21:53] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2023-03-20 02:21:54] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 0 ms to minimize.
[2023-03-20 02:21:54] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-20 02:21:54] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2023-03-20 02:21:55] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 6 ms to minimize.
[2023-03-20 02:21:55] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:21:55] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:21:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7065 ms
[2023-03-20 02:21:55] [INFO ] After 8915ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-20 02:21:56] [INFO ] After 9720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1833 ms.
Product exploration explored 100000 steps with 25000 reset in 1748 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 5602
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 701 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 24 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2098 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3000 places in 11 ms
Iterating global reduction 1 with 2098 rules applied. Total rules applied 3000 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3702 place count 5400 transition count 4901
Deduced a syphon composed of 2298 places in 11 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4404 place count 5400 transition count 4901
Deduced a syphon composed of 2298 places in 9 ms
Applied a total of 4404 rules in 5489 ms. Remains 5400 /6102 variables (removed 702) and now considering 4901/5602 (removed 701) transitions.
[2023-03-20 02:22:06] [INFO ] Redundant transitions in 194 ms returned []
// Phase 1: matrix 4901 rows 5400 cols
[2023-03-20 02:22:06] [INFO ] Computed 1101 place invariants in 127 ms
[2023-03-20 02:22:09] [INFO ] Dead Transitions using invariants and state equation in 3855 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5400/6102 places, 4901/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9572 ms. Remains : 5400/6102 places, 4901/5602 transitions.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 715 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-20 02:22:10] [INFO ] Computed 1101 place invariants in 74 ms
[2023-03-20 02:22:13] [INFO ] Implicit Places using invariants in 2789 ms returned []
[2023-03-20 02:22:13] [INFO ] Invariant cache hit.
[2023-03-20 02:22:16] [INFO ] Implicit Places using invariants and state equation in 3024 ms returned []
Implicit Place search using SMT with State Equation took 5821 ms to find 0 implicit places.
[2023-03-20 02:22:16] [INFO ] Invariant cache hit.
[2023-03-20 02:22:22] [INFO ] Dead Transitions using invariants and state equation in 5546 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12109 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-15 finished in 225680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)&&X(F(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-03
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6103 transition count 4903
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5403 transition count 4903
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5403 transition count 4403
Deduced a syphon composed of 500 places in 23 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4903 transition count 4403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2402 place count 4901 transition count 4401
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2404 place count 4901 transition count 4400
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 4900 transition count 4400
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 9 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5994 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5996 place count 3104 transition count 2604
Applied a total of 5996 rules in 1935 ms. Remains 3104 /6104 variables (removed 3000) and now considering 2604/5604 (removed 3000) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:22:24] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-20 02:22:26] [INFO ] Implicit Places using invariants in 2187 ms returned []
[2023-03-20 02:22:26] [INFO ] Invariant cache hit.
[2023-03-20 02:22:31] [INFO ] Implicit Places using invariants and state equation in 4435 ms returned []
Implicit Place search using SMT with State Equation took 6623 ms to find 0 implicit places.
[2023-03-20 02:22:31] [INFO ] Invariant cache hit.
[2023-03-20 02:22:33] [INFO ] Dead Transitions using invariants and state equation in 2271 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6104 places, 2604/5604 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10838 ms. Remains : 3104/6104 places, 2604/5604 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1000 0) (EQ s1022 0)), p1:(OR (EQ s1310 0) (EQ s1328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 46 reset in 1954 ms.
Product exploration explored 100000 steps with 59 reset in 2303 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 (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67096 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67096 steps, saw 60742 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:22:42] [INFO ] Invariant cache hit.
[2023-03-20 02:22:42] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:22:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 394 ms returned sat
[2023-03-20 02:22:46] [INFO ] After 2019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:22:46] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-20 02:22:46] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:22:46] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2023-03-20 02:22:47] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2023-03-20 02:22:47] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-20 02:22:47] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-20 02:22:47] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-20 02:22:48] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-20 02:22:48] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-20 02:22:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2411 ms
[2023-03-20 02:22:49] [INFO ] After 5389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 613 ms.
[2023-03-20 02:22:50] [INFO ] After 7171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 268 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 258 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 4) 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 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 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69245 steps, run timeout after 3015 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 69245 steps, saw 68259 distinct states, run finished after 3015 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:22:54] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-20 02:22:55] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:22:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 259 ms returned sat
[2023-03-20 02:22:58] [INFO ] After 2182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:22:58] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 0 ms to minimize.
[2023-03-20 02:22:59] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-20 02:22:59] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-20 02:22:59] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-20 02:22:59] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-20 02:23:00] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 0 ms to minimize.
[2023-03-20 02:23:00] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:23:00] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-20 02:23:01] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2023-03-20 02:23:01] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2023-03-20 02:23:01] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-03-20 02:23:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3107 ms
[2023-03-20 02:23:02] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-20 02:23:02] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2023-03-20 02:23:02] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:23:03] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-03-20 02:23:03] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2023-03-20 02:23:03] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-03-20 02:23:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1735 ms
[2023-03-20 02:23:04] [INFO ] After 7773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 543 ms.
[2023-03-20 02:23:04] [INFO ] After 9308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 413 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 131 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 173 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:23:05] [INFO ] Invariant cache hit.
[2023-03-20 02:23:07] [INFO ] Implicit Places using invariants in 1800 ms returned []
[2023-03-20 02:23:07] [INFO ] Invariant cache hit.
[2023-03-20 02:23:12] [INFO ] Implicit Places using invariants and state equation in 5657 ms returned []
Implicit Place search using SMT with State Equation took 7475 ms to find 0 implicit places.
[2023-03-20 02:23:12] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-20 02:23:12] [INFO ] Invariant cache hit.
[2023-03-20 02:23:14] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9621 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 159 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:23:15] [INFO ] Invariant cache hit.
[2023-03-20 02:23:15] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:23:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 344 ms returned sat
[2023-03-20 02:23:19] [INFO ] After 3001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:23:20] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 0 ms to minimize.
[2023-03-20 02:23:20] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 0 ms to minimize.
[2023-03-20 02:23:20] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 0 ms to minimize.
[2023-03-20 02:23:21] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:23:21] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2023-03-20 02:23:21] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2023-03-20 02:23:22] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-20 02:23:22] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 0 ms to minimize.
[2023-03-20 02:23:22] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2023-03-20 02:23:22] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:23:23] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2023-03-20 02:23:23] [INFO ] Deduced a trap composed of 17 places in 348 ms of which 0 ms to minimize.
[2023-03-20 02:23:23] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 1 ms to minimize.
[2023-03-20 02:23:24] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:23:24] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2023-03-20 02:23:24] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2023-03-20 02:23:24] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-20 02:23:25] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2023-03-20 02:23:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5406 ms
[2023-03-20 02:23:25] [INFO ] After 8961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-20 02:23:26] [INFO ] After 10616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 158 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:23:27] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-20 02:23:29] [INFO ] Implicit Places using invariants in 2200 ms returned []
[2023-03-20 02:23:29] [INFO ] Invariant cache hit.
[2023-03-20 02:23:33] [INFO ] Implicit Places using invariants and state equation in 4475 ms returned []
Implicit Place search using SMT with State Equation took 6690 ms to find 0 implicit places.
[2023-03-20 02:23:33] [INFO ] Invariant cache hit.
[2023-03-20 02:23:35] [INFO ] Dead Transitions using invariants and state equation in 1803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8655 ms. Remains : 3104/3104 places, 2604/2604 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 (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 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 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59370 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59370 steps, saw 53663 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:23:40] [INFO ] Invariant cache hit.
[2023-03-20 02:23:40] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:23:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 308 ms returned sat
[2023-03-20 02:23:44] [INFO ] After 2309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:23:44] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:23:44] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:23:45] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-20 02:23:45] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-20 02:23:45] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-20 02:23:46] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-03-20 02:23:46] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-20 02:23:46] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-20 02:23:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-20 02:23:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2581 ms
[2023-03-20 02:23:47] [INFO ] After 5709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 456 ms.
[2023-03-20 02:23:48] [INFO ] After 7420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 209 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 295 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 89969 steps, run timeout after 3004 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89969 steps, saw 88867 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:23:52] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-20 02:23:53] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:23:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 265 ms returned sat
[2023-03-20 02:23:56] [INFO ] After 2023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:23:56] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:23:56] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:23:57] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-20 02:23:57] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 0 ms to minimize.
[2023-03-20 02:23:57] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-03-20 02:23:58] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-20 02:23:58] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-20 02:23:58] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2023-03-20 02:23:58] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 0 ms to minimize.
[2023-03-20 02:23:59] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-20 02:23:59] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:23:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3245 ms
[2023-03-20 02:24:00] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-20 02:24:00] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 1 ms to minimize.
[2023-03-20 02:24:00] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2023-03-20 02:24:00] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2023-03-20 02:24:00] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2023-03-20 02:24:01] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-20 02:24:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1389 ms
[2023-03-20 02:24:01] [INFO ] After 7327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 486 ms.
[2023-03-20 02:24:02] [INFO ] After 8868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 347 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 176 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 153 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:24:02] [INFO ] Invariant cache hit.
[2023-03-20 02:24:05] [INFO ] Implicit Places using invariants in 2924 ms returned []
[2023-03-20 02:24:05] [INFO ] Invariant cache hit.
[2023-03-20 02:24:12] [INFO ] Implicit Places using invariants and state equation in 6690 ms returned []
Implicit Place search using SMT with State Equation took 9616 ms to find 0 implicit places.
[2023-03-20 02:24:12] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-20 02:24:12] [INFO ] Invariant cache hit.
[2023-03-20 02:24:14] [INFO ] Dead Transitions using invariants and state equation in 2032 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11941 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 137 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:24:14] [INFO ] Invariant cache hit.
[2023-03-20 02:24:15] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:24:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 311 ms returned sat
[2023-03-20 02:24:18] [INFO ] After 2127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:24:19] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:24:19] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:24:19] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 1 ms to minimize.
[2023-03-20 02:24:20] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 0 ms to minimize.
[2023-03-20 02:24:20] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:24:20] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-20 02:24:21] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:24:21] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 0 ms to minimize.
[2023-03-20 02:24:21] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2023-03-20 02:24:22] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:24:22] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:24:23] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 0 ms to minimize.
[2023-03-20 02:24:23] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 0 ms to minimize.
[2023-03-20 02:24:23] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2023-03-20 02:24:24] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2023-03-20 02:24:24] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:24:24] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2023-03-20 02:24:24] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 1 ms to minimize.
[2023-03-20 02:24:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6583 ms
[2023-03-20 02:24:25] [INFO ] After 9497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 552 ms.
[2023-03-20 02:24:26] [INFO ] After 11191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 501 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 63 reset in 2199 ms.
Product exploration explored 100000 steps with 52 reset in 2319 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 232 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:24:32] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-20 02:24:32] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-20 02:24:34] [INFO ] Dead Transitions using invariants and state equation in 2121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2445 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 121 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-20 02:24:35] [INFO ] Invariant cache hit.
[2023-03-20 02:24:37] [INFO ] Implicit Places using invariants in 2098 ms returned []
[2023-03-20 02:24:37] [INFO ] Invariant cache hit.
[2023-03-20 02:24:42] [INFO ] Implicit Places using invariants and state equation in 5117 ms returned []
Implicit Place search using SMT with State Equation took 7219 ms to find 0 implicit places.
[2023-03-20 02:24:42] [INFO ] Invariant cache hit.
[2023-03-20 02:24:44] [INFO ] Dead Transitions using invariants and state equation in 1962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9304 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 142048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(p2))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-06
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5402 transition count 4902
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5402 transition count 4403
Deduced a syphon composed of 499 places in 27 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4903 transition count 4403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2402 place count 4901 transition count 4401
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2404 place count 4901 transition count 4400
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 4900 transition count 4400
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 8 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5992 place count 3107 transition count 2607
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Applied a total of 5994 rules in 1814 ms. Remains 3105 /6104 variables (removed 2999) and now considering 2605/5604 (removed 2999) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:24:46] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-20 02:24:48] [INFO ] Implicit Places using invariants in 2333 ms returned []
[2023-03-20 02:24:48] [INFO ] Invariant cache hit.
[2023-03-20 02:24:53] [INFO ] Implicit Places using invariants and state equation in 4564 ms returned []
Implicit Place search using SMT with State Equation took 6918 ms to find 0 implicit places.
[2023-03-20 02:24:53] [INFO ] Invariant cache hit.
[2023-03-20 02:24:55] [INFO ] Dead Transitions using invariants and state equation in 2433 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3105/6104 places, 2605/5604 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11166 ms. Remains : 3105/6104 places, 2605/5604 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1255 0) (EQ s1275 0)), p1:(OR (EQ s2145 0) (EQ s925 0)), p2:(EQ s2145 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 1786 ms.
Product exploration explored 100000 steps with 21 reset in 2209 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 986 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:25:02] [INFO ] Invariant cache hit.
[2023-03-20 02:25:03] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:25:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 471 ms returned sat
[2023-03-20 02:25:06] [INFO ] After 1827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:25:06] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:25:06] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-20 02:25:07] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2023-03-20 02:25:07] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:25:07] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 0 ms to minimize.
[2023-03-20 02:25:08] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2023-03-20 02:25:08] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2023-03-20 02:25:08] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 24 ms to minimize.
[2023-03-20 02:25:08] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-20 02:25:08] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2023-03-20 02:25:09] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-20 02:25:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2972 ms
[2023-03-20 02:25:09] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-20 02:25:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-20 02:25:10] [INFO ] After 5686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-20 02:25:10] [INFO ] After 7300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 441 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 323 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 67283 steps, run timeout after 3006 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67283 steps, saw 66033 distinct states, run finished after 3007 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:25:15] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-20 02:25:16] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:25:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 305 ms returned sat
[2023-03-20 02:25:19] [INFO ] After 2206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:25:19] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:25:19] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-20 02:25:20] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-20 02:25:20] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 0 ms to minimize.
[2023-03-20 02:25:20] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-20 02:25:21] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:25:21] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 0 ms to minimize.
[2023-03-20 02:25:21] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2023-03-20 02:25:22] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:25:22] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-20 02:25:22] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:25:22] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:25:23] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 0 ms to minimize.
[2023-03-20 02:25:23] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-20 02:25:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4262 ms
[2023-03-20 02:25:24] [INFO ] After 7133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 386 ms.
[2023-03-20 02:25:24] [INFO ] After 8593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 262 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 125 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 123 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-20 02:25:25] [INFO ] Invariant cache hit.
[2023-03-20 02:25:28] [INFO ] Implicit Places using invariants in 2881 ms returned []
[2023-03-20 02:25:28] [INFO ] Invariant cache hit.
[2023-03-20 02:25:35] [INFO ] Implicit Places using invariants and state equation in 7323 ms returned []
Implicit Place search using SMT with State Equation took 10215 ms to find 0 implicit places.
[2023-03-20 02:25:35] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-20 02:25:35] [INFO ] Invariant cache hit.
[2023-03-20 02:25:37] [INFO ] Dead Transitions using invariants and state equation in 1899 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12387 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 141 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:25:37] [INFO ] Invariant cache hit.
[2023-03-20 02:25:38] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:25:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 511 ms returned sat
[2023-03-20 02:25:41] [INFO ] After 2149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:25:41] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-20 02:25:42] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-20 02:25:42] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 1 ms to minimize.
[2023-03-20 02:25:43] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 1 ms to minimize.
[2023-03-20 02:25:43] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2023-03-20 02:25:43] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2023-03-20 02:25:43] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:25:44] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2023-03-20 02:25:44] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2023-03-20 02:25:44] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 0 ms to minimize.
[2023-03-20 02:25:45] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 0 ms to minimize.
[2023-03-20 02:25:45] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:25:45] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:25:46] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2023-03-20 02:25:46] [INFO ] Deduced a trap composed of 17 places in 413 ms of which 1 ms to minimize.
[2023-03-20 02:25:46] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:25:47] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
[2023-03-20 02:25:47] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 0 ms to minimize.
[2023-03-20 02:25:47] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-20 02:25:47] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6437 ms
[2023-03-20 02:25:48] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:25:48] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2023-03-20 02:25:48] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-20 02:25:48] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-20 02:25:48] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-20 02:25:49] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-20 02:25:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1104 ms
[2023-03-20 02:25:49] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-20 02:25:49] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-20 02:25:49] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2023-03-20 02:25:50] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 0 ms to minimize.
[2023-03-20 02:25:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-03-20 02:25:50] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2023-03-20 02:25:50] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-20 02:25:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1699 ms
[2023-03-20 02:25:51] [INFO ] After 11782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 504 ms.
[2023-03-20 02:25:51] [INFO ] After 13602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 775 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 182 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:25:53] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-20 02:25:55] [INFO ] Implicit Places using invariants in 2848 ms returned []
[2023-03-20 02:25:55] [INFO ] Invariant cache hit.
[2023-03-20 02:26:00] [INFO ] Implicit Places using invariants and state equation in 4815 ms returned []
Implicit Place search using SMT with State Equation took 7693 ms to find 0 implicit places.
[2023-03-20 02:26:00] [INFO ] Invariant cache hit.
[2023-03-20 02:26:02] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9468 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 980 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 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 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:26:04] [INFO ] Invariant cache hit.
[2023-03-20 02:26:05] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:26:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 319 ms returned sat
[2023-03-20 02:26:08] [INFO ] After 1838ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:26:08] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2023-03-20 02:26:08] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 0 ms to minimize.
[2023-03-20 02:26:09] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 0 ms to minimize.
[2023-03-20 02:26:09] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-03-20 02:26:09] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2023-03-20 02:26:09] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-20 02:26:10] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2023-03-20 02:26:10] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2023-03-20 02:26:10] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-20 02:26:10] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2023-03-20 02:26:11] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-20 02:26:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3186 ms
[2023-03-20 02:26:11] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-20 02:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-20 02:26:12] [INFO ] After 6182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 442 ms.
[2023-03-20 02:26:12] [INFO ] After 7743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 302 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 286 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 72075 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72075 steps, saw 70796 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:26:17] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-20 02:26:18] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:26:19] [INFO ] [Nat]Absence check using 1101 positive place invariants in 367 ms returned sat
[2023-03-20 02:26:21] [INFO ] After 1892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:26:21] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:26:22] [INFO ] Deduced a trap composed of 5 places in 526 ms of which 1 ms to minimize.
[2023-03-20 02:26:22] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 0 ms to minimize.
[2023-03-20 02:26:22] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:26:23] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-20 02:26:23] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:26:23] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 1 ms to minimize.
[2023-03-20 02:26:24] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:26:24] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:26:24] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-20 02:26:24] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 8 ms to minimize.
[2023-03-20 02:26:25] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 1 ms to minimize.
[2023-03-20 02:26:25] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 1 ms to minimize.
[2023-03-20 02:26:25] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2023-03-20 02:26:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4847 ms
[2023-03-20 02:26:26] [INFO ] After 7437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 352 ms.
[2023-03-20 02:26:27] [INFO ] After 8951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 426 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 128 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 128 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-20 02:26:27] [INFO ] Invariant cache hit.
[2023-03-20 02:26:30] [INFO ] Implicit Places using invariants in 2767 ms returned []
[2023-03-20 02:26:30] [INFO ] Invariant cache hit.
[2023-03-20 02:26:35] [INFO ] Implicit Places using invariants and state equation in 5458 ms returned []
Implicit Place search using SMT with State Equation took 8241 ms to find 0 implicit places.
[2023-03-20 02:26:36] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-20 02:26:36] [INFO ] Invariant cache hit.
[2023-03-20 02:26:38] [INFO ] Dead Transitions using invariants and state equation in 2056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10508 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 167 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:26:38] [INFO ] Invariant cache hit.
[2023-03-20 02:26:39] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:26:39] [INFO ] [Nat]Absence check using 1101 positive place invariants in 265 ms returned sat
[2023-03-20 02:26:42] [INFO ] After 2268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 02:26:42] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2023-03-20 02:26:43] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-20 02:26:43] [INFO ] Deduced a trap composed of 28 places in 343 ms of which 1 ms to minimize.
[2023-03-20 02:26:43] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 1 ms to minimize.
[2023-03-20 02:26:44] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 0 ms to minimize.
[2023-03-20 02:26:44] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2023-03-20 02:26:45] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 1 ms to minimize.
[2023-03-20 02:26:45] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-20 02:26:45] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 0 ms to minimize.
[2023-03-20 02:26:46] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2023-03-20 02:26:46] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-20 02:26:46] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2023-03-20 02:26:46] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 0 ms to minimize.
[2023-03-20 02:26:47] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:26:47] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-20 02:26:47] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2023-03-20 02:26:48] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2023-03-20 02:26:48] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:26:48] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-20 02:26:48] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6486 ms
[2023-03-20 02:26:49] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-20 02:26:49] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-20 02:26:49] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-20 02:26:50] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-20 02:26:50] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-20 02:26:50] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-20 02:26:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1638 ms
[2023-03-20 02:26:51] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:26:51] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:26:51] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-20 02:26:51] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-20 02:26:52] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:26:52] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-20 02:26:52] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-20 02:26:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2064 ms
[2023-03-20 02:26:53] [INFO ] After 13106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 541 ms.
[2023-03-20 02:26:53] [INFO ] After 14645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 921 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22 reset in 2037 ms.
Product exploration explored 100000 steps with 20 reset in 2371 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 223 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-20 02:26:59] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-20 02:27:01] [INFO ] Implicit Places using invariants in 2107 ms returned []
[2023-03-20 02:27:01] [INFO ] Invariant cache hit.
[2023-03-20 02:27:06] [INFO ] Implicit Places using invariants and state equation in 4870 ms returned []
Implicit Place search using SMT with State Equation took 6981 ms to find 0 implicit places.
[2023-03-20 02:27:06] [INFO ] Invariant cache hit.
[2023-03-20 02:27:08] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9035 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-06 finished in 144406 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)))'
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((p0 U p1)))))'
[2023-03-20 02:27:09] [INFO ] Flatten gal took : 185 ms
[2023-03-20 02:27:09] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 02:27:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6104 places, 5604 transitions and 16008 arcs took 29 ms.
Total runtime 1507408 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-100B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA ShieldPPPs-PT-100B-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279551407

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldPPPs-PT-100B-LTLFireability-10
lola: time limit : 897 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 2/897 2/32 ShieldPPPs-PT-100B-LTLFireability-10 90365 m, 18073 m/sec, 158405 t fired, .

Time elapsed: 12 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 7/897 7/32 ShieldPPPs-PT-100B-LTLFireability-10 310084 m, 43943 m/sec, 555369 t fired, .

Time elapsed: 17 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 12/897 12/32 ShieldPPPs-PT-100B-LTLFireability-10 538506 m, 45684 m/sec, 957596 t fired, .

Time elapsed: 22 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 17/897 17/32 ShieldPPPs-PT-100B-LTLFireability-10 771153 m, 46529 m/sec, 1362774 t fired, .

Time elapsed: 27 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 22/897 22/32 ShieldPPPs-PT-100B-LTLFireability-10 1009500 m, 47669 m/sec, 1771971 t fired, .

Time elapsed: 32 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 27/897 26/32 ShieldPPPs-PT-100B-LTLFireability-10 1235426 m, 45185 m/sec, 2175416 t fired, .

Time elapsed: 37 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 32/897 31/32 ShieldPPPs-PT-100B-LTLFireability-10 1467444 m, 46403 m/sec, 2573567 t fired, .

Time elapsed: 42 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ShieldPPPs-PT-100B-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 47 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldPPPs-PT-100B-LTLFireability-15
lola: time limit : 1184 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ShieldPPPs-PT-100B-LTLFireability-15
lola: result : true
lola: markings : 8
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPs-PT-100B-LTLFireability-06
lola: time limit : 1776 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1776 4/32 ShieldPPPs-PT-100B-LTLFireability-06 78950 m, 15790 m/sec, 187168 t fired, .

Time elapsed: 52 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1776 6/32 ShieldPPPs-PT-100B-LTLFireability-06 132244 m, 10658 m/sec, 379138 t fired, .

Time elapsed: 57 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1776 8/32 ShieldPPPs-PT-100B-LTLFireability-06 186858 m, 10922 m/sec, 571583 t fired, .

Time elapsed: 62 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1776 9/32 ShieldPPPs-PT-100B-LTLFireability-06 234608 m, 9550 m/sec, 765218 t fired, .

Time elapsed: 67 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1776 11/32 ShieldPPPs-PT-100B-LTLFireability-06 287519 m, 10582 m/sec, 957908 t fired, .

Time elapsed: 72 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1776 12/32 ShieldPPPs-PT-100B-LTLFireability-06 336812 m, 9858 m/sec, 1150927 t fired, .

Time elapsed: 77 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1776 13/32 ShieldPPPs-PT-100B-LTLFireability-06 387558 m, 10149 m/sec, 1343441 t fired, .

Time elapsed: 82 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1776 15/32 ShieldPPPs-PT-100B-LTLFireability-06 447418 m, 11972 m/sec, 1535149 t fired, .

Time elapsed: 87 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1776 17/32 ShieldPPPs-PT-100B-LTLFireability-06 497548 m, 10026 m/sec, 1727946 t fired, .

Time elapsed: 92 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1776 18/32 ShieldPPPs-PT-100B-LTLFireability-06 545066 m, 9503 m/sec, 1921157 t fired, .

Time elapsed: 97 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1776 19/32 ShieldPPPs-PT-100B-LTLFireability-06 591201 m, 9227 m/sec, 2114181 t fired, .

Time elapsed: 102 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1776 21/32 ShieldPPPs-PT-100B-LTLFireability-06 632836 m, 8327 m/sec, 2307117 t fired, .

Time elapsed: 107 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1776 22/32 ShieldPPPs-PT-100B-LTLFireability-06 679663 m, 9365 m/sec, 2500481 t fired, .

Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1776 23/32 ShieldPPPs-PT-100B-LTLFireability-06 724000 m, 8867 m/sec, 2693279 t fired, .

Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1776 24/32 ShieldPPPs-PT-100B-LTLFireability-06 765745 m, 8349 m/sec, 2886779 t fired, .

Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1776 26/32 ShieldPPPs-PT-100B-LTLFireability-06 818846 m, 10620 m/sec, 3079139 t fired, .

Time elapsed: 127 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1776 27/32 ShieldPPPs-PT-100B-LTLFireability-06 872143 m, 10659 m/sec, 3271948 t fired, .

Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1776 29/32 ShieldPPPs-PT-100B-LTLFireability-06 921073 m, 9786 m/sec, 3465008 t fired, .

Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1776 30/32 ShieldPPPs-PT-100B-LTLFireability-06 974490 m, 10683 m/sec, 3658136 t fired, .

Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/1776 32/32 ShieldPPPs-PT-100B-LTLFireability-06 1020301 m, 9162 m/sec, 3851370 t fired, .

Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldPPPs-PT-100B-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPs-PT-100B-LTLFireability-03
lola: time limit : 3448 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3448 4/32 ShieldPPPs-PT-100B-LTLFireability-03 49678 m, 9935 m/sec, 196405 t fired, .

Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3448 6/32 ShieldPPPs-PT-100B-LTLFireability-03 82729 m, 6610 m/sec, 396800 t fired, .

Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3448 7/32 ShieldPPPs-PT-100B-LTLFireability-03 118175 m, 7089 m/sec, 596458 t fired, .

Time elapsed: 167 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3448 8/32 ShieldPPPs-PT-100B-LTLFireability-03 147554 m, 5875 m/sec, 796512 t fired, .

Time elapsed: 172 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3448 9/32 ShieldPPPs-PT-100B-LTLFireability-03 176159 m, 5721 m/sec, 996079 t fired, .

Time elapsed: 177 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3448 10/32 ShieldPPPs-PT-100B-LTLFireability-03 208501 m, 6468 m/sec, 1195981 t fired, .

Time elapsed: 182 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3448 11/32 ShieldPPPs-PT-100B-LTLFireability-03 237873 m, 5874 m/sec, 1395997 t fired, .

Time elapsed: 187 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3448 12/32 ShieldPPPs-PT-100B-LTLFireability-03 266575 m, 5740 m/sec, 1596322 t fired, .

Time elapsed: 192 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3448 13/32 ShieldPPPs-PT-100B-LTLFireability-03 297369 m, 6158 m/sec, 1796438 t fired, .

Time elapsed: 197 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3448 13/32 ShieldPPPs-PT-100B-LTLFireability-03 323598 m, 5245 m/sec, 1997204 t fired, .

Time elapsed: 202 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3448 14/32 ShieldPPPs-PT-100B-LTLFireability-03 347909 m, 4862 m/sec, 2197752 t fired, .

Time elapsed: 207 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3448 15/32 ShieldPPPs-PT-100B-LTLFireability-03 374861 m, 5390 m/sec, 2398114 t fired, .

Time elapsed: 212 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3448 16/32 ShieldPPPs-PT-100B-LTLFireability-03 406273 m, 6282 m/sec, 2598018 t fired, .

Time elapsed: 217 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3448 17/32 ShieldPPPs-PT-100B-LTLFireability-03 434425 m, 5630 m/sec, 2798290 t fired, .

Time elapsed: 222 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3448 18/32 ShieldPPPs-PT-100B-LTLFireability-03 464999 m, 6114 m/sec, 2998195 t fired, .

Time elapsed: 227 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3448 19/32 ShieldPPPs-PT-100B-LTLFireability-03 496810 m, 6362 m/sec, 3198838 t fired, .

Time elapsed: 232 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3448 19/32 ShieldPPPs-PT-100B-LTLFireability-03 524951 m, 5628 m/sec, 3399362 t fired, .

Time elapsed: 237 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3448 20/32 ShieldPPPs-PT-100B-LTLFireability-03 555492 m, 6108 m/sec, 3598889 t fired, .

Time elapsed: 242 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3448 21/32 ShieldPPPs-PT-100B-LTLFireability-03 583246 m, 5550 m/sec, 3799044 t fired, .

Time elapsed: 247 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3448 22/32 ShieldPPPs-PT-100B-LTLFireability-03 607846 m, 4920 m/sec, 3999662 t fired, .

Time elapsed: 252 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3448 23/32 ShieldPPPs-PT-100B-LTLFireability-03 634001 m, 5231 m/sec, 4199780 t fired, .

Time elapsed: 257 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3448 23/32 ShieldPPPs-PT-100B-LTLFireability-03 661783 m, 5556 m/sec, 4399905 t fired, .

Time elapsed: 262 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3448 24/32 ShieldPPPs-PT-100B-LTLFireability-03 687594 m, 5162 m/sec, 4600240 t fired, .

Time elapsed: 267 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3448 25/32 ShieldPPPs-PT-100B-LTLFireability-03 712542 m, 4989 m/sec, 4800469 t fired, .

Time elapsed: 272 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3448 26/32 ShieldPPPs-PT-100B-LTLFireability-03 739270 m, 5345 m/sec, 5000426 t fired, .

Time elapsed: 277 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3448 26/32 ShieldPPPs-PT-100B-LTLFireability-03 763456 m, 4837 m/sec, 5200673 t fired, .

Time elapsed: 282 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3448 27/32 ShieldPPPs-PT-100B-LTLFireability-03 785677 m, 4444 m/sec, 5401227 t fired, .

Time elapsed: 287 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3448 28/32 ShieldPPPs-PT-100B-LTLFireability-03 808061 m, 4476 m/sec, 5601199 t fired, .

Time elapsed: 292 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3448 28/32 ShieldPPPs-PT-100B-LTLFireability-03 832853 m, 4958 m/sec, 5801614 t fired, .

Time elapsed: 297 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3448 29/32 ShieldPPPs-PT-100B-LTLFireability-03 859853 m, 5400 m/sec, 6001904 t fired, .

Time elapsed: 302 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3448 30/32 ShieldPPPs-PT-100B-LTLFireability-03 884292 m, 4887 m/sec, 6202247 t fired, .

Time elapsed: 307 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3448 31/32 ShieldPPPs-PT-100B-LTLFireability-03 910551 m, 5251 m/sec, 6402247 t fired, .

Time elapsed: 312 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3448 32/32 ShieldPPPs-PT-100B-LTLFireability-03 941638 m, 6217 m/sec, 6601721 t fired, .

Time elapsed: 317 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldPPPs-PT-100B-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 322 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-LTLFireability-03: LTL unknown AGGR
ShieldPPPs-PT-100B-LTLFireability-06: LTL unknown AGGR
ShieldPPPs-PT-100B-LTLFireability-10: LTL unknown AGGR
ShieldPPPs-PT-100B-LTLFireability-15: LTL true LTL model checker


Time elapsed: 322 secs. Pages in use: 32

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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPs-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715400524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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