Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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.9M 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 ShieldPPPt-PT-100B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679471864583

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:57:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:57:47] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2023-03-22 07:57:47] [INFO ] Transformed 7803 places.
[2023-03-22 07:57:47] [INFO ] Transformed 7103 transitions.
[2023-03-22 07:57:47] [INFO ] Found NUPN structural information;
[2023-03-22 07:57:47] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 625 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1092 places :
Symmetric choice reduction at 0 with 1092 rule applications. Total rules 1092 place count 6711 transition count 6011
Iterating global reduction 0 with 1092 rules applied. Total rules applied 2184 place count 6711 transition count 6011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2185 place count 6710 transition count 6010
Iterating global reduction 0 with 1 rules applied. Total rules applied 2186 place count 6710 transition count 6010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2187 place count 6709 transition count 6009
Iterating global reduction 0 with 1 rules applied. Total rules applied 2188 place count 6709 transition count 6009
Applied a total of 2188 rules in 5705 ms. Remains 6709 /7803 variables (removed 1094) and now considering 6009/7103 (removed 1094) transitions.
// Phase 1: matrix 6009 rows 6709 cols
[2023-03-22 07:57:54] [INFO ] Computed 1101 place invariants in 92 ms
[2023-03-22 07:58:00] [INFO ] Implicit Places using invariants in 6515 ms returned []
[2023-03-22 07:58:00] [INFO ] Invariant cache hit.
[2023-03-22 07:58:04] [INFO ] Implicit Places using invariants and state equation in 4126 ms returned []
Implicit Place search using SMT with State Equation took 10689 ms to find 0 implicit places.
[2023-03-22 07:58:04] [INFO ] Invariant cache hit.
[2023-03-22 07:58:11] [INFO ] Dead Transitions using invariants and state equation in 6539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6709/7803 places, 6009/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22941 ms. Remains : 6709/7803 places, 6009/7103 transitions.
Support contains 32 out of 6709 places after structural reductions.
[2023-03-22 07:58:11] [INFO ] Flatten gal took : 332 ms
[2023-03-22 07:58:12] [INFO ] Flatten gal took : 228 ms
[2023-03-22 07:58:12] [INFO ] Input system was already deterministic with 6009 transitions.
Support contains 30 out of 6709 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-22 07:58:13] [INFO ] Invariant cache hit.
[2023-03-22 07:58:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 913 ms returned sat
[2023-03-22 07:58:18] [INFO ] After 4544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 07:58:21] [INFO ] [Nat]Absence check using 1101 positive place invariants in 940 ms returned sat
[2023-03-22 07:58:33] [INFO ] After 9839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 07:58:36] [INFO ] Deduced a trap composed of 20 places in 2879 ms of which 18 ms to minimize.
[2023-03-22 07:58:40] [INFO ] Deduced a trap composed of 30 places in 3168 ms of which 5 ms to minimize.
[2023-03-22 07:58:43] [INFO ] Deduced a trap composed of 27 places in 3306 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-22 07:58:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:58:43] [INFO ] After 25623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 6913 ms.
Support contains 20 out of 6709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Drop transitions removed 1386 transitions
Trivial Post-agglo rules discarded 1386 transitions
Performed 1386 trivial Post agglomeration. Transition count delta: 1386
Iterating post reduction 0 with 1386 rules applied. Total rules applied 1386 place count 6709 transition count 4623
Reduce places removed 1386 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1387 rules applied. Total rules applied 2773 place count 5323 transition count 4622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2774 place count 5322 transition count 4622
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2774 place count 5322 transition count 3827
Deduced a syphon composed of 795 places in 11 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 4364 place count 4527 transition count 3827
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4365 place count 4526 transition count 3826
Iterating global reduction 3 with 1 rules applied. Total rules applied 4366 place count 4526 transition count 3826
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4366 place count 4526 transition count 3825
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4368 place count 4525 transition count 3825
Performed 1703 Post agglomeration using F-continuation condition.Transition count delta: 1703
Deduced a syphon composed of 1703 places in 13 ms
Reduce places removed 1703 places and 0 transitions.
Iterating global reduction 3 with 3406 rules applied. Total rules applied 7774 place count 2822 transition count 2122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7775 place count 2822 transition count 2121
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7777 place count 2821 transition count 2120
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7979 place count 2720 transition count 2120
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8181 place count 2619 transition count 2120
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 8361 place count 2529 transition count 2120
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8363 place count 2529 transition count 2118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8365 place count 2527 transition count 2118
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 5 with 296 rules applied. Total rules applied 8661 place count 2527 transition count 2118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8662 place count 2526 transition count 2117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8663 place count 2525 transition count 2117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8663 place count 2525 transition count 2115
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8667 place count 2523 transition count 2115
Applied a total of 8667 rules in 2605 ms. Remains 2523 /6709 variables (removed 4186) and now considering 2115/6009 (removed 3894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2605 ms. Remains : 2523/6709 places, 2115/6009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 36556 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36556 steps, saw 30160 distinct states, run finished after 3003 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2115 rows 2523 cols
[2023-03-22 07:58:57] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 07:58:58] [INFO ] [Real]Absence check using 1100 positive place invariants in 250 ms returned sat
[2023-03-22 07:58:58] [INFO ] After 1672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 07:59:00] [INFO ] [Nat]Absence check using 1100 positive place invariants in 366 ms returned sat
[2023-03-22 07:59:03] [INFO ] After 2522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 07:59:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:59:04] [INFO ] After 1324ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 07:59:05] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 10 ms to minimize.
[2023-03-22 07:59:05] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 14 ms to minimize.
[2023-03-22 07:59:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1114 ms
[2023-03-22 07:59:07] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-22 07:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2023-03-22 07:59:08] [INFO ] After 5411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1681 ms.
[2023-03-22 07:59:10] [INFO ] After 11901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 491 ms.
Support contains 19 out of 2523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2523/2523 places, 2115/2115 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2522 transition count 2114
Applied a total of 2 rules in 177 ms. Remains 2522 /2523 variables (removed 1) and now considering 2114/2115 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 2522/2523 places, 2114/2115 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 48736 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48736 steps, saw 40256 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2114 rows 2522 cols
[2023-03-22 07:59:15] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-22 07:59:16] [INFO ] [Real]Absence check using 1100 positive place invariants in 261 ms returned sat
[2023-03-22 07:59:16] [INFO ] After 1625ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 07:59:17] [INFO ] [Nat]Absence check using 1100 positive place invariants in 295 ms returned sat
[2023-03-22 07:59:21] [INFO ] After 2848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 07:59:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:59:23] [INFO ] After 1865ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 07:59:26] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 1 ms to minimize.
[2023-03-22 07:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2023-03-22 07:59:26] [INFO ] After 5199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1771 ms.
[2023-03-22 07:59:28] [INFO ] After 12074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 341 ms.
Support contains 19 out of 2522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2522/2522 places, 2114/2114 transitions.
Applied a total of 0 rules in 93 ms. Remains 2522 /2522 variables (removed 0) and now considering 2114/2114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2522/2522 places, 2114/2114 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2522/2522 places, 2114/2114 transitions.
Applied a total of 0 rules in 95 ms. Remains 2522 /2522 variables (removed 0) and now considering 2114/2114 (removed 0) transitions.
[2023-03-22 07:59:29] [INFO ] Invariant cache hit.
[2023-03-22 07:59:31] [INFO ] Implicit Places using invariants in 2172 ms returned [2505, 2509]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2212 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2520/2522 places, 2114/2114 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2518 transition count 2112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2518 transition count 2112
Applied a total of 4 rules in 222 ms. Remains 2518 /2520 variables (removed 2) and now considering 2112/2114 (removed 2) transitions.
// Phase 1: matrix 2112 rows 2518 cols
[2023-03-22 07:59:31] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 07:59:33] [INFO ] Implicit Places using invariants in 2277 ms returned []
[2023-03-22 07:59:33] [INFO ] Invariant cache hit.
[2023-03-22 07:59:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:59:37] [INFO ] Implicit Places using invariants and state equation in 3951 ms returned []
Implicit Place search using SMT with State Equation took 6232 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2518/2522 places, 2112/2114 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8763 ms. Remains : 2518/2522 places, 2112/2114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) 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 15) seen :0
Interrupted probabilistic random walk after 45183 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 45183 steps, saw 37326 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-22 07:59:41] [INFO ] Invariant cache hit.
[2023-03-22 07:59:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 276 ms returned sat
[2023-03-22 07:59:43] [INFO ] After 1877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 07:59:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 277 ms returned sat
[2023-03-22 07:59:49] [INFO ] After 2887ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 07:59:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:59:50] [INFO ] After 1715ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 07:59:52] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-22 07:59:52] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 0 ms to minimize.
[2023-03-22 07:59:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 821 ms
[2023-03-22 07:59:54] [INFO ] After 5373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1859 ms.
[2023-03-22 07:59:56] [INFO ] After 12568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 797 ms.
Support contains 19 out of 2518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2518/2518 places, 2112/2112 transitions.
Applied a total of 0 rules in 88 ms. Remains 2518 /2518 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2518/2518 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2518/2518 places, 2112/2112 transitions.
Applied a total of 0 rules in 92 ms. Remains 2518 /2518 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2023-03-22 07:59:57] [INFO ] Invariant cache hit.
[2023-03-22 07:59:59] [INFO ] Implicit Places using invariants in 2635 ms returned []
[2023-03-22 07:59:59] [INFO ] Invariant cache hit.
[2023-03-22 08:00:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 08:00:04] [INFO ] Implicit Places using invariants and state equation in 4249 ms returned []
Implicit Place search using SMT with State Equation took 6889 ms to find 0 implicit places.
[2023-03-22 08:00:04] [INFO ] Redundant transitions in 219 ms returned []
[2023-03-22 08:00:04] [INFO ] Invariant cache hit.
[2023-03-22 08:00:06] [INFO ] Dead Transitions using invariants and state equation in 2289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9512 ms. Remains : 2518/2518 places, 2112/2112 transitions.
FORMULA ShieldPPPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6708 transition count 4607
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5307 transition count 4607
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2802 place count 5307 transition count 3811
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4394 place count 4511 transition count 3811
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4399 place count 4506 transition count 3806
Iterating global reduction 2 with 5 rules applied. Total rules applied 4404 place count 4506 transition count 3806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4404 place count 4506 transition count 3802
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4412 place count 4502 transition count 3802
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7813 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8015 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8217 place count 2600 transition count 2101
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8411 place count 2503 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8413 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8414 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8414 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8418 place count 2498 transition count 2097
Applied a total of 8418 rules in 2228 ms. Remains 2498 /6709 variables (removed 4211) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2498 cols
[2023-03-22 08:00:09] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-22 08:00:11] [INFO ] Implicit Places using invariants in 2327 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2344 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2496/6709 places, 2097/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 2095
Applied a total of 4 rules in 201 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2023-03-22 08:00:11] [INFO ] Computed 1098 place invariants in 22 ms
[2023-03-22 08:00:14] [INFO ] Implicit Places using invariants in 2522 ms returned []
[2023-03-22 08:00:14] [INFO ] Invariant cache hit.
[2023-03-22 08:00:18] [INFO ] Implicit Places using invariants and state equation in 4577 ms returned []
Implicit Place search using SMT with State Equation took 7116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2494/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11889 ms. Remains : 2494/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s1996 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1718 ms.
Entered a terminal (fully accepting) state of product in 4417 steps with 0 reset in 93 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-00 finished in 14118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6708 transition count 4609
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5309 transition count 4609
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2798 place count 5309 transition count 3813
Deduced a syphon composed of 796 places in 14 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4395 place count 4508 transition count 3808
Iterating global reduction 2 with 5 rules applied. Total rules applied 4400 place count 4508 transition count 3808
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4508 transition count 3804
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4504 transition count 3804
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7806 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7807 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7809 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8011 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8213 place count 2602 transition count 2103
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8405 place count 2506 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8407 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8408 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8408 place count 2503 transition count 2099
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Applied a total of 8412 rules in 2269 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2099/6009 (removed 3910) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2023-03-22 08:00:23] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-22 08:00:26] [INFO ] Implicit Places using invariants in 2606 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2623 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2099/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2097
Applied a total of 4 rules in 197 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-22 08:00:26] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 08:00:28] [INFO ] Implicit Places using invariants in 2258 ms returned []
[2023-03-22 08:00:28] [INFO ] Invariant cache hit.
[2023-03-22 08:00:31] [INFO ] Implicit Places using invariants and state equation in 3436 ms returned []
Implicit Place search using SMT with State Equation took 5699 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6709 places, 2097/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10795 ms. Remains : 2497/6709 places, 2097/6009 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s1677 1) (NEQ s810 1)), p0:(EQ s2155 0), p1:(NEQ s810 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1580 ms.
Product exploration explored 100000 steps with 0 reset in 2228 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 p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 430 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 75795 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75795 steps, saw 57351 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:00:40] [INFO ] Invariant cache hit.
[2023-03-22 08:00:40] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:00:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 334 ms returned sat
[2023-03-22 08:00:42] [INFO ] After 1449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:00:43] [INFO ] After 1824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-22 08:00:43] [INFO ] After 2862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 94 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 77663 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77663 steps, saw 58616 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:00:47] [INFO ] Invariant cache hit.
[2023-03-22 08:00:47] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:00:48] [INFO ] [Nat]Absence check using 1098 positive place invariants in 273 ms returned sat
[2023-03-22 08:00:49] [INFO ] After 1638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:00:50] [INFO ] After 2025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-22 08:00:50] [INFO ] After 3060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 108 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 153 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-22 08:00:50] [INFO ] Invariant cache hit.
[2023-03-22 08:00:52] [INFO ] Implicit Places using invariants in 1944 ms returned []
[2023-03-22 08:00:52] [INFO ] Invariant cache hit.
[2023-03-22 08:00:57] [INFO ] Implicit Places using invariants and state equation in 4620 ms returned []
Implicit Place search using SMT with State Equation took 6579 ms to find 0 implicit places.
[2023-03-22 08:00:57] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-22 08:00:57] [INFO ] Invariant cache hit.
[2023-03-22 08:00:59] [INFO ] Dead Transitions using invariants and state equation in 2149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8966 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2497 transition count 2097
Applied a total of 593 rules in 266 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-22 08:00:59] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-22 08:01:00] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:01:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 206 ms returned sat
[2023-03-22 08:01:02] [INFO ] After 1364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:01:02] [INFO ] After 1790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-22 08:01:03] [INFO ] After 2764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 116 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-22 08:01:03] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 08:01:05] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2023-03-22 08:01:05] [INFO ] Invariant cache hit.
[2023-03-22 08:01:10] [INFO ] Implicit Places using invariants and state equation in 4322 ms returned []
Implicit Place search using SMT with State Equation took 6239 ms to find 0 implicit places.
[2023-03-22 08:01:10] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-22 08:01:10] [INFO ] Invariant cache hit.
[2023-03-22 08:01:12] [INFO ] Dead Transitions using invariants and state equation in 2166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8655 ms. Remains : 2497/2497 places, 2097/2097 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 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (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 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 78459 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78459 steps, saw 59206 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:01:16] [INFO ] Invariant cache hit.
[2023-03-22 08:01:16] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:01:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 235 ms returned sat
[2023-03-22 08:01:18] [INFO ] After 1289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:01:19] [INFO ] After 1725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-22 08:01:19] [INFO ] After 2640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 101 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 97 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 76999 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76999 steps, saw 58172 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:01:23] [INFO ] Invariant cache hit.
[2023-03-22 08:01:23] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:01:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 238 ms returned sat
[2023-03-22 08:01:25] [INFO ] After 1340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:01:25] [INFO ] After 1781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-22 08:01:26] [INFO ] After 2691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 140 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 101 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 188 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-22 08:01:26] [INFO ] Invariant cache hit.
[2023-03-22 08:01:28] [INFO ] Implicit Places using invariants in 2072 ms returned []
[2023-03-22 08:01:28] [INFO ] Invariant cache hit.
[2023-03-22 08:01:33] [INFO ] Implicit Places using invariants and state equation in 4843 ms returned []
Implicit Place search using SMT with State Equation took 6934 ms to find 0 implicit places.
[2023-03-22 08:01:33] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-22 08:01:33] [INFO ] Invariant cache hit.
[2023-03-22 08:01:35] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9146 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2497 transition count 2097
Applied a total of 593 rules in 292 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-22 08:01:35] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:01:36] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:01:36] [INFO ] [Nat]Absence check using 1098 positive place invariants in 219 ms returned sat
[2023-03-22 08:01:38] [INFO ] After 1445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:01:38] [INFO ] After 1753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-22 08:01:38] [INFO ] After 2666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (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 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 369 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1821 ms.
Product exploration explored 100000 steps with 0 reset in 2178 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 98 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-22 08:01:43] [INFO ] Computed 1098 place invariants in 19 ms
[2023-03-22 08:01:46] [INFO ] Implicit Places using invariants in 2580 ms returned []
[2023-03-22 08:01:46] [INFO ] Invariant cache hit.
[2023-03-22 08:01:51] [INFO ] Implicit Places using invariants and state equation in 4562 ms returned []
Implicit Place search using SMT with State Equation took 7154 ms to find 0 implicit places.
[2023-03-22 08:01:51] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-22 08:01:51] [INFO ] Invariant cache hit.
[2023-03-22 08:01:53] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9671 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-01 finished in 92862 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)||(p1&&X(p2))) U X(p1)))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 2217 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:01:56] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-22 08:01:59] [INFO ] Implicit Places using invariants in 3125 ms returned []
[2023-03-22 08:01:59] [INFO ] Invariant cache hit.
[2023-03-22 08:02:02] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 6159 ms to find 0 implicit places.
[2023-03-22 08:02:02] [INFO ] Invariant cache hit.
[2023-03-22 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 6292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14682 ms. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s4433 1), p1:(EQ s3166 1), p2:(EQ s3984 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 116 reset in 936 ms.
Product exploration explored 100000 steps with 114 reset in 958 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-03-22 08:02:12] [INFO ] Invariant cache hit.
[2023-03-22 08:02:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 747 ms returned sat
[2023-03-22 08:02:19] [INFO ] After 7647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:02:21] [INFO ] [Nat]Absence check using 1101 positive place invariants in 720 ms returned sat
[2023-03-22 08:02:27] [INFO ] After 6104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:02:30] [INFO ] Deduced a trap composed of 18 places in 2591 ms of which 3 ms to minimize.
[2023-03-22 08:02:33] [INFO ] Deduced a trap composed of 19 places in 2620 ms of which 7 ms to minimize.
[2023-03-22 08:02:36] [INFO ] Deduced a trap composed of 22 places in 2912 ms of which 3 ms to minimize.
[2023-03-22 08:02:39] [INFO ] Deduced a trap composed of 17 places in 2501 ms of which 4 ms to minimize.
[2023-03-22 08:02:41] [INFO ] Deduced a trap composed of 23 places in 2605 ms of which 4 ms to minimize.
[2023-03-22 08:02:44] [INFO ] Deduced a trap composed of 21 places in 2695 ms of which 5 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-22 08:02:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:02:44] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 164 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 14 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7798 place count 2802 transition count 2102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2802 transition count 2101
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2801 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2700 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2599 transition count 2100
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8399 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8699 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8700 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8700 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8704 place count 2498 transition count 2097
Applied a total of 8704 rules in 1843 ms. Remains 2498 /6701 variables (removed 4203) and now considering 2097/6001 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1844 ms. Remains : 2498/6701 places, 2097/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Finished probabilistic random walk after 53888 steps, run visited all 1 properties in 2278 ms. (steps per millisecond=23 )
Probabilistic random walk after 53888 steps, saw 36494 distinct states, run finished after 2278 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 8 factoid took 560 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-22 08:02:50] [INFO ] Invariant cache hit.
[2023-03-22 08:03:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 6430 ms returned sat
[2023-03-22 08:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:03:05] [INFO ] [Real]Absence check using state equation in 1981 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 6701 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1112 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
[2023-03-22 08:03:06] [INFO ] Invariant cache hit.
[2023-03-22 08:03:09] [INFO ] Implicit Places using invariants in 3088 ms returned []
[2023-03-22 08:03:09] [INFO ] Invariant cache hit.
[2023-03-22 08:03:12] [INFO ] Implicit Places using invariants and state equation in 3016 ms returned []
Implicit Place search using SMT with State Equation took 6122 ms to find 0 implicit places.
[2023-03-22 08:03:12] [INFO ] Invariant cache hit.
[2023-03-22 08:03:18] [INFO ] Dead Transitions using invariants and state equation in 5823 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13058 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 439 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:03:19] [INFO ] Invariant cache hit.
[2023-03-22 08:03:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 714 ms returned sat
[2023-03-22 08:03:27] [INFO ] After 7309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:03:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 895 ms returned sat
[2023-03-22 08:03:39] [INFO ] After 9886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:03:44] [INFO ] Deduced a trap composed of 18 places in 5152 ms of which 7 ms to minimize.
[2023-03-22 08:03:47] [INFO ] Deduced a trap composed of 19 places in 2443 ms of which 3 ms to minimize.
[2023-03-22 08:03:50] [INFO ] Deduced a trap composed of 22 places in 3035 ms of which 4 ms to minimize.
[2023-03-22 08:03:53] [INFO ] Deduced a trap composed of 17 places in 3138 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-22 08:03:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:03:53] [INFO ] After 26726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7798 place count 2802 transition count 2102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2802 transition count 2101
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2801 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2700 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2599 transition count 2100
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8399 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8699 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8700 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8700 place count 2500 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8704 place count 2498 transition count 2097
Applied a total of 8704 rules in 1741 ms. Remains 2498 /6701 variables (removed 4203) and now considering 2097/6001 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1741 ms. Remains : 2498/6701 places, 2097/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 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 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Finished probabilistic random walk after 53888 steps, run visited all 1 properties in 2298 ms. (steps per millisecond=23 )
Probabilistic random walk after 53888 steps, saw 36494 distinct states, run finished after 2298 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 7 factoid took 672 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-22 08:03:59] [INFO ] Invariant cache hit.
[2023-03-22 08:04:13] [INFO ] [Real]Absence check using 1101 positive place invariants in 7320 ms returned sat
[2023-03-22 08:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:04:14] [INFO ] [Real]Absence check using state equation in 921 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 115 reset in 751 ms.
Product exploration explored 100000 steps with 114 reset in 995 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 6001
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1399 place count 6701 transition count 6401
Deduced a syphon composed of 1899 places in 23 ms
Iterating global reduction 1 with 500 rules applied. Total rules applied 1899 place count 6701 transition count 6401
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3797 places in 25 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3797 place count 6701 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3798 place count 6701 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 2 with 701 rule applications. Total rules 4499 place count 6000 transition count 5699
Deduced a syphon composed of 3096 places in 28 ms
Iterating global reduction 2 with 701 rules applied. Total rules applied 5200 place count 6000 transition count 5699
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3097 places in 28 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5201 place count 6000 transition count 5699
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5203 place count 5998 transition count 5697
Deduced a syphon composed of 3095 places in 26 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5205 place count 5998 transition count 5697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5306 place count 5998 transition count 6127
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5407 place count 5897 transition count 5925
Deduced a syphon composed of 3095 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5508 place count 5897 transition count 5925
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3196 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 5897 transition count 6352
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 5796 transition count 6150
Deduced a syphon composed of 3095 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 5796 transition count 6150
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 5796 transition count 6580
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 5695 transition count 6378
Deduced a syphon composed of 3095 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 5695 transition count 6378
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 3191 places in 14 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6210 place count 5695 transition count 6786
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6306 place count 5599 transition count 6594
Deduced a syphon composed of 3095 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6402 place count 5599 transition count 6594
Deduced a syphon composed of 3095 places in 12 ms
Applied a total of 6402 rules in 10110 ms. Remains 5599 /6701 variables (removed 1102) and now considering 6594/6001 (removed -593) transitions.
[2023-03-22 08:04:27] [INFO ] Redundant transitions in 294 ms returned []
// Phase 1: matrix 6594 rows 5599 cols
[2023-03-22 08:04:27] [INFO ] Computed 1101 place invariants in 196 ms
[2023-03-22 08:04:34] [INFO ] Dead Transitions using invariants and state equation in 6580 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/6701 places, 6594/6001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17015 ms. Remains : 5599/6701 places, 6594/6001 transitions.
Support contains 2 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1134 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:04:35] [INFO ] Computed 1101 place invariants in 27 ms
[2023-03-22 08:04:38] [INFO ] Implicit Places using invariants in 3097 ms returned []
[2023-03-22 08:04:38] [INFO ] Invariant cache hit.
[2023-03-22 08:04:41] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 5952 ms to find 0 implicit places.
[2023-03-22 08:04:41] [INFO ] Invariant cache hit.
[2023-03-22 08:04:47] [INFO ] Dead Transitions using invariants and state equation in 6232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13320 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-03 finished in 174039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)&&X(F((p2&&F(!p2))))))'
Support contains 6 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 2380 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-22 08:04:50] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-22 08:04:53] [INFO ] Implicit Places using invariants in 3013 ms returned []
[2023-03-22 08:04:53] [INFO ] Invariant cache hit.
[2023-03-22 08:04:56] [INFO ] Implicit Places using invariants and state equation in 2982 ms returned []
Implicit Place search using SMT with State Equation took 6000 ms to find 0 implicit places.
[2023-03-22 08:04:56] [INFO ] Invariant cache hit.
[2023-03-22 08:05:01] [INFO ] Dead Transitions using invariants and state equation in 5564 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13966 ms. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, true, p1, true, p2]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s1843 1) (EQ s1885 1)) (EQ s374 1)), p0:(AND (EQ s662 1) (EQ s688 1)), p2:(EQ s229 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1749 ms.
Stack based approach found an accepted trace after 5928 steps with 0 reset with depth 5929 and stack size 2026 in 150 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-04 finished in 16321 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 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6708 transition count 4609
Reduce places removed 1399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2799 place count 5309 transition count 4608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3812
Deduced a syphon composed of 796 places in 11 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 4392 place count 4512 transition count 3812
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 4398 place count 4506 transition count 3806
Iterating global reduction 3 with 6 rules applied. Total rules applied 4404 place count 4506 transition count 3806
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4404 place count 4506 transition count 3801
Deduced a syphon composed of 5 places in 12 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4414 place count 4501 transition count 3801
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7813 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8015 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8217 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8409 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8411 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8412 place count 2501 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8416 place count 2499 transition count 2097
Applied a total of 8416 rules in 2264 ms. Remains 2499 /6709 variables (removed 4210) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-22 08:05:06] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:05:09] [INFO ] Implicit Places using invariants in 2922 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2924 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6709 places, 2097/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 171 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:05:09] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-22 08:05:11] [INFO ] Implicit Places using invariants in 2265 ms returned []
[2023-03-22 08:05:11] [INFO ] Invariant cache hit.
[2023-03-22 08:05:16] [INFO ] Implicit Places using invariants and state equation in 4873 ms returned []
Implicit Place search using SMT with State Equation took 7140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12499 ms. Remains : 2495/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-06 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 s2492 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1551 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-06 finished in 14117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&X(F(p0))))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 2249 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-22 08:05:20] [INFO ] Computed 1101 place invariants in 48 ms
[2023-03-22 08:05:23] [INFO ] Implicit Places using invariants in 2781 ms returned []
[2023-03-22 08:05:23] [INFO ] Invariant cache hit.
[2023-03-22 08:05:26] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 5617 ms to find 0 implicit places.
[2023-03-22 08:05:26] [INFO ] Invariant cache hit.
[2023-03-22 08:05:31] [INFO ] Dead Transitions using invariants and state equation in 5631 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13508 ms. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s4111 0), p1:(EQ s5112 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1904 ms.
Product exploration explored 100000 steps with 50000 reset in 1854 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6702 stabilizing places and 1598/6002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 174 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLFireability-08 finished in 17877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6708 transition count 4608
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3813
Deduced a syphon composed of 795 places in 11 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 4396 place count 4507 transition count 3807
Iterating global reduction 2 with 6 rules applied. Total rules applied 4402 place count 4507 transition count 3807
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4402 place count 4507 transition count 3802
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4412 place count 4502 transition count 3802
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7813 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8015 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8217 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8409 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8411 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8412 place count 2501 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8416 place count 2499 transition count 2097
Applied a total of 8416 rules in 2281 ms. Remains 2499 /6709 variables (removed 4210) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-22 08:05:38] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:05:40] [INFO ] Implicit Places using invariants in 1803 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1807 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6709 places, 2097/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 174 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:05:40] [INFO ] Computed 1098 place invariants in 2 ms
[2023-03-22 08:05:42] [INFO ] Implicit Places using invariants in 1836 ms returned []
[2023-03-22 08:05:42] [INFO ] Invariant cache hit.
[2023-03-22 08:05:46] [INFO ] Implicit Places using invariants and state equation in 4295 ms returned []
Implicit Place search using SMT with State Equation took 6167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10429 ms. Remains : 2495/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-09 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:(NEQ s1947 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1443 ms.
Product exploration explored 100000 steps with 0 reset in 2013 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 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 109 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93799 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93799 steps, saw 71291 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:05:53] [INFO ] Invariant cache hit.
[2023-03-22 08:05:54] [INFO ] [Real]Absence check using 1098 positive place invariants in 232 ms returned sat
[2023-03-22 08:05:55] [INFO ] After 1202ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:05:55] [INFO ] After 1347ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-22 08:05:56] [INFO ] After 2059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 94 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 95240 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95240 steps, saw 72253 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:05:59] [INFO ] Invariant cache hit.
[2023-03-22 08:06:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 252 ms returned sat
[2023-03-22 08:06:01] [INFO ] After 1394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:06:01] [INFO ] After 1583ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-22 08:06:01] [INFO ] After 2371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 87 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 129 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-22 08:06:02] [INFO ] Invariant cache hit.
[2023-03-22 08:06:04] [INFO ] Implicit Places using invariants in 1988 ms returned []
[2023-03-22 08:06:04] [INFO ] Invariant cache hit.
[2023-03-22 08:06:08] [INFO ] Implicit Places using invariants and state equation in 4812 ms returned []
Implicit Place search using SMT with State Equation took 6811 ms to find 0 implicit places.
[2023-03-22 08:06:09] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-22 08:06:09] [INFO ] Invariant cache hit.
[2023-03-22 08:06:10] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8556 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 242 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:06:10] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 08:06:11] [INFO ] [Real]Absence check using 1098 positive place invariants in 243 ms returned sat
[2023-03-22 08:06:12] [INFO ] After 1288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:06:12] [INFO ] After 1495ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-22 08:06:13] [INFO ] After 2247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 193 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 121 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 85 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:06:13] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:06:15] [INFO ] Implicit Places using invariants in 1943 ms returned []
[2023-03-22 08:06:15] [INFO ] Invariant cache hit.
[2023-03-22 08:06:19] [INFO ] Implicit Places using invariants and state equation in 3876 ms returned []
Implicit Place search using SMT with State Equation took 5823 ms to find 0 implicit places.
[2023-03-22 08:06:19] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-22 08:06:19] [INFO ] Invariant cache hit.
[2023-03-22 08:06:20] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7163 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
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 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93714 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93714 steps, saw 71225 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:06:24] [INFO ] Invariant cache hit.
[2023-03-22 08:06:24] [INFO ] [Real]Absence check using 1098 positive place invariants in 211 ms returned sat
[2023-03-22 08:06:26] [INFO ] After 1422ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:06:26] [INFO ] After 1644ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-22 08:06:26] [INFO ] After 2382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 121 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 92538 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92538 steps, saw 70259 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:06:30] [INFO ] Invariant cache hit.
[2023-03-22 08:06:30] [INFO ] [Real]Absence check using 1098 positive place invariants in 245 ms returned sat
[2023-03-22 08:06:31] [INFO ] After 1250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:06:32] [INFO ] After 1414ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-22 08:06:32] [INFO ] After 2178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 92 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 123 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-22 08:06:32] [INFO ] Invariant cache hit.
[2023-03-22 08:06:33] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2023-03-22 08:06:34] [INFO ] Invariant cache hit.
[2023-03-22 08:06:37] [INFO ] Implicit Places using invariants and state equation in 3857 ms returned []
Implicit Place search using SMT with State Equation took 5311 ms to find 0 implicit places.
[2023-03-22 08:06:37] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 08:06:37] [INFO ] Invariant cache hit.
[2023-03-22 08:06:39] [INFO ] Dead Transitions using invariants and state equation in 2052 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7532 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 249 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:06:40] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:06:40] [INFO ] [Real]Absence check using 1098 positive place invariants in 264 ms returned sat
[2023-03-22 08:06:42] [INFO ] After 1154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 08:06:42] [INFO ] After 1372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-22 08:06:42] [INFO ] After 2133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1484 ms.
Product exploration explored 100000 steps with 0 reset in 1877 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 86 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:06:46] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:06:48] [INFO ] Implicit Places using invariants in 1814 ms returned []
[2023-03-22 08:06:48] [INFO ] Invariant cache hit.
[2023-03-22 08:06:52] [INFO ] Implicit Places using invariants and state equation in 4436 ms returned []
Implicit Place search using SMT with State Equation took 6257 ms to find 0 implicit places.
[2023-03-22 08:06:52] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-22 08:06:52] [INFO ] Invariant cache hit.
[2023-03-22 08:06:54] [INFO ] Dead Transitions using invariants and state equation in 1639 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8025 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-09 finished in 78209 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 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6708 transition count 4611
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5311 transition count 4611
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2794 place count 5311 transition count 3814
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4388 place count 4514 transition count 3814
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4393 place count 4509 transition count 3809
Iterating global reduction 2 with 5 rules applied. Total rules applied 4398 place count 4509 transition count 3809
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4398 place count 4509 transition count 3804
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4408 place count 4504 transition count 3804
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7804 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7805 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7807 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8009 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8211 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8405 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8407 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8408 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8408 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8412 place count 2501 transition count 2100
Applied a total of 8412 rules in 2324 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2100/6009 (removed 3909) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-22 08:06:56] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 08:06:59] [INFO ] Implicit Places using invariants in 2697 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2701 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2100/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 261 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:06:59] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-22 08:07:01] [INFO ] Implicit Places using invariants in 2099 ms returned []
[2023-03-22 08:07:01] [INFO ] Invariant cache hit.
[2023-03-22 08:07:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 08:07:06] [INFO ] Implicit Places using invariants and state equation in 4980 ms returned []
Implicit Place search using SMT with State Equation took 7096 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6709 places, 2098/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12382 ms. Remains : 2497/6709 places, 2098/6009 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s150 1) (EQ s751 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1715 ms.
Stack based approach found an accepted trace after 202 steps with 0 reset with depth 203 and stack size 203 in 5 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-10 finished in 14190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6708 transition count 4608
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3813
Deduced a syphon composed of 795 places in 14 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 4396 place count 4507 transition count 3807
Iterating global reduction 2 with 6 rules applied. Total rules applied 4402 place count 4507 transition count 3807
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4402 place count 4507 transition count 3802
Deduced a syphon composed of 5 places in 13 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4412 place count 4502 transition count 3802
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7813 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8015 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8217 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8409 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8411 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8412 place count 2501 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8416 place count 2499 transition count 2097
Applied a total of 8416 rules in 2368 ms. Remains 2499 /6709 variables (removed 4210) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-22 08:07:11] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:07:13] [INFO ] Implicit Places using invariants in 2305 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2334 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6709 places, 2097/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 180 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:07:13] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:07:15] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2023-03-22 08:07:15] [INFO ] Invariant cache hit.
[2023-03-22 08:07:20] [INFO ] Implicit Places using invariants and state equation in 4517 ms returned []
Implicit Place search using SMT with State Equation took 6515 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11397 ms. Remains : 2495/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1595 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-11 finished in 13162 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(F((p1 U (p2||G(p1))))))||G(F((p1 U (p2||G(p1))))))))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6703 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6703 transition count 6003
Applied a total of 12 rules in 2353 ms. Remains 6703 /6709 variables (removed 6) and now considering 6003/6009 (removed 6) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2023-03-22 08:07:24] [INFO ] Computed 1101 place invariants in 48 ms
[2023-03-22 08:07:25] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-22 08:07:25] [INFO ] Invariant cache hit.
[2023-03-22 08:07:25] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
[2023-03-22 08:07:25] [INFO ] Invariant cache hit.
[2023-03-22 08:07:31] [INFO ] Dead Transitions using invariants and state equation in 5675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6709 places, 6003/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9606 ms. Remains : 6703/6709 places, 6003/6009 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s2069 1), p2:(AND (NEQ s1239 1) (NEQ s1027 1)), p1:(NEQ s1027 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1924 ms.
Product exploration explored 100000 steps with 50000 reset in 1885 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Detected a total of 1599/6703 stabilizing places and 1599/6003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (OR (AND (NOT p2) (NOT p1)) p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (OR (AND (NOT p2) (NOT p1)) p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 p1)
Knowledge based reduction with 10 factoid took 502 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLFireability-12 finished in 14325 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(F(p1)))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 2346 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-22 08:07:38] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-22 08:07:41] [INFO ] Implicit Places using invariants in 3021 ms returned []
[2023-03-22 08:07:41] [INFO ] Invariant cache hit.
[2023-03-22 08:07:44] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 6110 ms to find 0 implicit places.
[2023-03-22 08:07:44] [INFO ] Invariant cache hit.
[2023-03-22 08:07:50] [INFO ] Dead Transitions using invariants and state equation in 5978 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14442 ms. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s404 1), p0:(EQ s5501 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1796 ms.
Product exploration explored 100000 steps with 0 reset in 2219 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 119542 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119542 steps, saw 117792 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 08:07:59] [INFO ] Invariant cache hit.
[2023-03-22 08:08:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 721 ms returned sat
[2023-03-22 08:08:01] [INFO ] After 1962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 08:08:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 701 ms returned sat
[2023-03-22 08:08:09] [INFO ] After 6311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 08:08:12] [INFO ] Deduced a trap composed of 24 places in 2543 ms of which 4 ms to minimize.
[2023-03-22 08:08:15] [INFO ] Deduced a trap composed of 22 places in 2676 ms of which 3 ms to minimize.
[2023-03-22 08:08:18] [INFO ] Deduced a trap composed of 25 places in 2527 ms of which 4 ms to minimize.
[2023-03-22 08:08:20] [INFO ] Deduced a trap composed of 21 places in 2483 ms of which 12 ms to minimize.
[2023-03-22 08:08:23] [INFO ] Deduced a trap composed of 24 places in 2347 ms of which 3 ms to minimize.
[2023-03-22 08:08:26] [INFO ] Deduced a trap composed of 18 places in 2620 ms of which 5 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-22 08:08:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:08:26] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 690 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3804
Deduced a syphon composed of 799 places in 13 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 6 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 12 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8003 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8205 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8697 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8698 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2098
Applied a total of 8702 rules in 1981 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2098/6002 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1981 ms. Remains : 2500/6702 places, 2098/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-22 08:08:29] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:08:29] [INFO ] [Real]Absence check using 1100 positive place invariants in 208 ms returned sat
[2023-03-22 08:08:31] [INFO ] After 1838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:08:32] [INFO ] [Nat]Absence check using 1100 positive place invariants in 250 ms returned sat
[2023-03-22 08:08:33] [INFO ] After 1274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:08:33] [INFO ] After 139ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:33] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 0 ms to minimize.
[2023-03-22 08:08:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-22 08:08:34] [INFO ] After 708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-22 08:08:34] [INFO ] After 3008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2097
Applied a total of 2 rules in 230 ms. Remains 2499 /2500 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 2499/2500 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75397 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75397 steps, saw 50556 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-22 08:08:37] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:08:38] [INFO ] [Real]Absence check using 1100 positive place invariants in 247 ms returned sat
[2023-03-22 08:08:40] [INFO ] After 2265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:08:40] [INFO ] [Nat]Absence check using 1100 positive place invariants in 233 ms returned sat
[2023-03-22 08:08:42] [INFO ] After 1346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:08:42] [INFO ] After 97ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:42] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-22 08:08:42] [INFO ] After 2370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 96 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2499/2499 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 85 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-22 08:08:42] [INFO ] Invariant cache hit.
[2023-03-22 08:08:45] [INFO ] Implicit Places using invariants in 2479 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2483 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2497/2499 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 196 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:08:45] [INFO ] Computed 1098 place invariants in 33 ms
[2023-03-22 08:08:48] [INFO ] Implicit Places using invariants in 2725 ms returned []
[2023-03-22 08:08:48] [INFO ] Invariant cache hit.
[2023-03-22 08:08:52] [INFO ] Implicit Places using invariants and state equation in 4894 ms returned []
Implicit Place search using SMT with State Equation took 7633 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2495/2499 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10397 ms. Remains : 2495/2499 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75431 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75431 steps, saw 51738 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:08:56] [INFO ] Invariant cache hit.
[2023-03-22 08:08:57] [INFO ] [Real]Absence check using 1098 positive place invariants in 276 ms returned sat
[2023-03-22 08:08:58] [INFO ] After 2199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:08:59] [INFO ] [Nat]Absence check using 1098 positive place invariants in 296 ms returned sat
[2023-03-22 08:09:00] [INFO ] After 1333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:00] [INFO ] After 1542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-22 08:09:00] [INFO ] After 2400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 91 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 86 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-22 08:09:01] [INFO ] Invariant cache hit.
[2023-03-22 08:09:03] [INFO ] Implicit Places using invariants in 2521 ms returned []
[2023-03-22 08:09:03] [INFO ] Invariant cache hit.
[2023-03-22 08:09:08] [INFO ] Implicit Places using invariants and state equation in 4468 ms returned []
Implicit Place search using SMT with State Equation took 7007 ms to find 0 implicit places.
[2023-03-22 08:09:08] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-22 08:09:08] [INFO ] Invariant cache hit.
[2023-03-22 08:09:10] [INFO ] Dead Transitions using invariants and state equation in 2337 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9516 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 227 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:09:10] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:09:11] [INFO ] [Real]Absence check using 1098 positive place invariants in 264 ms returned sat
[2023-03-22 08:09:12] [INFO ] After 2000ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:09:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 227 ms returned sat
[2023-03-22 08:09:14] [INFO ] After 1430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:14] [INFO ] State equation strengthened by 592 read => feed constraints.
[2023-03-22 08:09:15] [INFO ] After 305ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:15] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-22 08:09:15] [INFO ] After 2750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 396 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1183 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-22 08:09:17] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-22 08:09:20] [INFO ] Implicit Places using invariants in 3056 ms returned []
[2023-03-22 08:09:20] [INFO ] Invariant cache hit.
[2023-03-22 08:09:21] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 3939 ms to find 0 implicit places.
[2023-03-22 08:09:21] [INFO ] Invariant cache hit.
[2023-03-22 08:09:27] [INFO ] Dead Transitions using invariants and state equation in 6036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11177 ms. Remains : 6702/6702 places, 6002/6002 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 285 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 144370 steps, run timeout after 3002 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144370 steps, saw 142338 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 08:09:31] [INFO ] Invariant cache hit.
[2023-03-22 08:09:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 780 ms returned sat
[2023-03-22 08:09:33] [INFO ] After 2089ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 08:09:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 738 ms returned sat
[2023-03-22 08:09:42] [INFO ] After 5981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 08:09:45] [INFO ] Deduced a trap composed of 24 places in 2770 ms of which 3 ms to minimize.
[2023-03-22 08:09:48] [INFO ] Deduced a trap composed of 22 places in 2800 ms of which 4 ms to minimize.
[2023-03-22 08:09:51] [INFO ] Deduced a trap composed of 25 places in 2769 ms of which 4 ms to minimize.
[2023-03-22 08:09:54] [INFO ] Deduced a trap composed of 21 places in 2573 ms of which 3 ms to minimize.
[2023-03-22 08:09:58] [INFO ] Deduced a trap composed of 24 places in 3870 ms of which 4 ms to minimize.
[2023-03-22 08:10:01] [INFO ] Deduced a trap composed of 18 places in 2668 ms of which 29 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-22 08:10:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:10:01] [INFO ] After 27169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 654 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3804
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 6 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7801 place count 2802 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8003 place count 2701 transition count 2101
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8205 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8697 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8698 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2098
Applied a total of 8702 rules in 1786 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2098/6002 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1786 ms. Remains : 2500/6702 places, 2098/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 81560 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 81560 steps, saw 64143 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-22 08:10:07] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 08:10:07] [INFO ] [Real]Absence check using 1100 positive place invariants in 326 ms returned sat
[2023-03-22 08:10:09] [INFO ] After 2393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:10] [INFO ] [Nat]Absence check using 1100 positive place invariants in 216 ms returned sat
[2023-03-22 08:10:11] [INFO ] After 1282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:10:11] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:11] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-22 08:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-22 08:10:12] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-22 08:10:12] [INFO ] After 2581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2097
Applied a total of 2 rules in 162 ms. Remains 2499 /2500 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 2499/2500 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 72530 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72530 steps, saw 48561 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-22 08:10:15] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:10:16] [INFO ] [Real]Absence check using 1100 positive place invariants in 288 ms returned sat
[2023-03-22 08:10:17] [INFO ] After 1910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:18] [INFO ] [Nat]Absence check using 1100 positive place invariants in 313 ms returned sat
[2023-03-22 08:10:19] [INFO ] After 1305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:10:19] [INFO ] After 137ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:20] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-22 08:10:20] [INFO ] After 2567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 90 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2499/2499 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 86 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-22 08:10:20] [INFO ] Invariant cache hit.
[2023-03-22 08:10:22] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2023-03-22 08:10:22] [INFO ] Invariant cache hit.
[2023-03-22 08:10:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:10:26] [INFO ] Implicit Places using invariants and state equation in 4531 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6201 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2497/2499 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 184 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:10:26] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:10:28] [INFO ] Implicit Places using invariants in 2031 ms returned []
[2023-03-22 08:10:28] [INFO ] Invariant cache hit.
[2023-03-22 08:10:33] [INFO ] Implicit Places using invariants and state equation in 4195 ms returned []
Implicit Place search using SMT with State Equation took 6268 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2495/2499 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12739 ms. Remains : 2495/2499 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75347 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75347 steps, saw 51679 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:10:36] [INFO ] Invariant cache hit.
[2023-03-22 08:10:37] [INFO ] [Real]Absence check using 1098 positive place invariants in 395 ms returned sat
[2023-03-22 08:10:38] [INFO ] After 2109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 248 ms returned sat
[2023-03-22 08:10:40] [INFO ] After 1311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:40] [INFO ] After 1476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-22 08:10:40] [INFO ] After 2224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 99 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 94 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-22 08:10:40] [INFO ] Invariant cache hit.
[2023-03-22 08:10:42] [INFO ] Implicit Places using invariants in 1999 ms returned []
[2023-03-22 08:10:42] [INFO ] Invariant cache hit.
[2023-03-22 08:10:47] [INFO ] Implicit Places using invariants and state equation in 4401 ms returned []
Implicit Place search using SMT with State Equation took 6418 ms to find 0 implicit places.
[2023-03-22 08:10:47] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-22 08:10:47] [INFO ] Invariant cache hit.
[2023-03-22 08:10:49] [INFO ] Dead Transitions using invariants and state equation in 2072 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8670 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 237 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-22 08:10:49] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:10:50] [INFO ] [Real]Absence check using 1098 positive place invariants in 212 ms returned sat
[2023-03-22 08:10:51] [INFO ] After 1858ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:52] [INFO ] [Nat]Absence check using 1098 positive place invariants in 238 ms returned sat
[2023-03-22 08:10:53] [INFO ] After 1448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:53] [INFO ] State equation strengthened by 592 read => feed constraints.
[2023-03-22 08:10:54] [INFO ] After 298ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:54] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-22 08:10:54] [INFO ] After 2845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 284 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1810 ms.
Product exploration explored 100000 steps with 0 reset in 2212 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6702 transition count 6002
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1399 place count 6702 transition count 6401
Deduced a syphon composed of 1899 places in 23 ms
Iterating global reduction 1 with 500 rules applied. Total rules applied 1899 place count 6702 transition count 6401
Performed 1900 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3799 places in 29 ms
Iterating global reduction 1 with 1900 rules applied. Total rules applied 3799 place count 6702 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3800 place count 6702 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 2 with 702 rule applications. Total rules 4502 place count 6000 transition count 5698
Deduced a syphon composed of 3097 places in 23 ms
Iterating global reduction 2 with 702 rules applied. Total rules applied 5204 place count 6000 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3098 places in 29 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5205 place count 6000 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5207 place count 5998 transition count 5696
Deduced a syphon composed of 3096 places in 21 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5209 place count 5998 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3197 places in 27 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5310 place count 5998 transition count 6123
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5411 place count 5897 transition count 5921
Deduced a syphon composed of 3096 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5512 place count 5897 transition count 5921
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3197 places in 20 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5613 place count 5897 transition count 6351
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5714 place count 5796 transition count 6149
Deduced a syphon composed of 3096 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5815 place count 5796 transition count 6149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3197 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5916 place count 5796 transition count 6579
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6017 place count 5695 transition count 6377
Deduced a syphon composed of 3096 places in 16 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6118 place count 5695 transition count 6377
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -401
Deduced a syphon composed of 3191 places in 18 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6213 place count 5695 transition count 6778
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6308 place count 5600 transition count 6588
Deduced a syphon composed of 3096 places in 18 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6403 place count 5600 transition count 6588
Deduced a syphon composed of 3096 places in 17 ms
Applied a total of 6403 rules in 9041 ms. Remains 5600 /6702 variables (removed 1102) and now considering 6588/6002 (removed -586) transitions.
[2023-03-22 08:11:09] [INFO ] Redundant transitions in 345 ms returned []
// Phase 1: matrix 6588 rows 5600 cols
[2023-03-22 08:11:09] [INFO ] Computed 1101 place invariants in 169 ms
[2023-03-22 08:11:15] [INFO ] Dead Transitions using invariants and state equation in 6233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/6702 places, 6588/6002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15653 ms. Remains : 5600/6702 places, 6588/6002 transitions.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1044 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-22 08:11:16] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-22 08:11:19] [INFO ] Implicit Places using invariants in 3019 ms returned []
[2023-03-22 08:11:19] [INFO ] Invariant cache hit.
[2023-03-22 08:11:22] [INFO ] Implicit Places using invariants and state equation in 2811 ms returned []
Implicit Place search using SMT with State Equation took 5846 ms to find 0 implicit places.
[2023-03-22 08:11:22] [INFO ] Invariant cache hit.
[2023-03-22 08:11:27] [INFO ] Dead Transitions using invariants and state equation in 5426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12343 ms. Remains : 6702/6702 places, 6002/6002 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-13 finished in 231991 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)||G(p1))))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6708 transition count 4609
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5309 transition count 4609
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2798 place count 5309 transition count 3812
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4392 place count 4512 transition count 3812
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 4398 place count 4506 transition count 3806
Iterating global reduction 2 with 6 rules applied. Total rules applied 4404 place count 4506 transition count 3806
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4404 place count 4506 transition count 3801
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4414 place count 4501 transition count 3801
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7804 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7805 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7807 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8009 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8211 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8405 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8407 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8408 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8408 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8412 place count 2501 transition count 2100
Applied a total of 8412 rules in 2245 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2100/6009 (removed 3909) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-22 08:11:30] [INFO ] Computed 1100 place invariants in 3 ms
[2023-03-22 08:11:32] [INFO ] Implicit Places using invariants in 1989 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1993 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2100/6009 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 208 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:11:32] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-22 08:11:34] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2023-03-22 08:11:34] [INFO ] Invariant cache hit.
[2023-03-22 08:11:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:11:39] [INFO ] Implicit Places using invariants and state equation in 4298 ms returned []
Implicit Place search using SMT with State Equation took 6369 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6709 places, 2098/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10815 ms. Remains : 2497/6709 places, 2098/6009 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s728 1), p1:(AND (EQ s1067 1) (EQ s1102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1702 ms.
Product exploration explored 100000 steps with 1 reset in 1943 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/2497 stabilizing places and 3/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 609 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:11:44] [INFO ] Invariant cache hit.
[2023-03-22 08:11:44] [INFO ] [Real]Absence check using 1098 positive place invariants in 267 ms returned sat
[2023-03-22 08:11:45] [INFO ] After 1958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:11:46] [INFO ] [Nat]Absence check using 1098 positive place invariants in 280 ms returned sat
[2023-03-22 08:11:48] [INFO ] After 1371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:11:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:11:48] [INFO ] After 194ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:11:48] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-22 08:11:49] [INFO ] After 3052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 129 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 2497 transition count 2098
Applied a total of 5 rules in 193 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 77333 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77333 steps, saw 56460 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:11:52] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:11:53] [INFO ] [Real]Absence check using 1098 positive place invariants in 235 ms returned sat
[2023-03-22 08:11:55] [INFO ] After 2096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:11:55] [INFO ] [Nat]Absence check using 1098 positive place invariants in 307 ms returned sat
[2023-03-22 08:11:59] [INFO ] After 3124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:11:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:11:59] [INFO ] After 227ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:11:59] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2023-03-22 08:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-22 08:11:59] [INFO ] After 783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-22 08:12:00] [INFO ] After 5023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 129 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 89 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 88 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-22 08:12:00] [INFO ] Invariant cache hit.
[2023-03-22 08:12:02] [INFO ] Implicit Places using invariants in 1999 ms returned []
[2023-03-22 08:12:02] [INFO ] Invariant cache hit.
[2023-03-22 08:12:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:12:06] [INFO ] Implicit Places using invariants and state equation in 4593 ms returned []
Implicit Place search using SMT with State Equation took 6629 ms to find 0 implicit places.
[2023-03-22 08:12:07] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 08:12:07] [INFO ] Invariant cache hit.
[2023-03-22 08:12:08] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8514 ms. Remains : 2497/2497 places, 2098/2098 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 2497 transition count 2098
Applied a total of 598 rules in 226 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:12:09] [INFO ] Computed 1098 place invariants in 18 ms
[2023-03-22 08:12:09] [INFO ] [Real]Absence check using 1098 positive place invariants in 240 ms returned sat
[2023-03-22 08:12:11] [INFO ] After 1968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:12:11] [INFO ] [Nat]Absence check using 1098 positive place invariants in 226 ms returned sat
[2023-03-22 08:12:12] [INFO ] After 1287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 08:12:13] [INFO ] After 232ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:13] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 08:12:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 4 ms to minimize.
[2023-03-22 08:12:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2023-03-22 08:12:14] [INFO ] After 1057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-22 08:12:14] [INFO ] After 3262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 651 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 113 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:12:15] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:12:17] [INFO ] Implicit Places using invariants in 2294 ms returned []
[2023-03-22 08:12:17] [INFO ] Invariant cache hit.
[2023-03-22 08:12:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:12:22] [INFO ] Implicit Places using invariants and state equation in 4537 ms returned []
Implicit Place search using SMT with State Equation took 6859 ms to find 0 implicit places.
[2023-03-22 08:12:22] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-22 08:12:22] [INFO ] Invariant cache hit.
[2023-03-22 08:12:24] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9032 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/2497 stabilizing places and 3/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 622 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:12:25] [INFO ] Invariant cache hit.
[2023-03-22 08:12:26] [INFO ] [Real]Absence check using 1098 positive place invariants in 293 ms returned sat
[2023-03-22 08:12:27] [INFO ] After 2065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:12:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 332 ms returned sat
[2023-03-22 08:12:30] [INFO ] After 1491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:12:30] [INFO ] After 266ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:30] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-22 08:12:31] [INFO ] After 3524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 107 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 2497 transition count 2098
Applied a total of 5 rules in 170 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 83597 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83597 steps, saw 60797 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:12:34] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-22 08:12:35] [INFO ] [Real]Absence check using 1098 positive place invariants in 216 ms returned sat
[2023-03-22 08:12:36] [INFO ] After 1710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:12:37] [INFO ] [Nat]Absence check using 1098 positive place invariants in 243 ms returned sat
[2023-03-22 08:12:38] [INFO ] After 1316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:12:38] [INFO ] After 302ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:39] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2023-03-22 08:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2023-03-22 08:12:39] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-22 08:12:39] [INFO ] After 3246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 153 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 85 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 89 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-22 08:12:40] [INFO ] Invariant cache hit.
[2023-03-22 08:12:42] [INFO ] Implicit Places using invariants in 2098 ms returned []
[2023-03-22 08:12:42] [INFO ] Invariant cache hit.
[2023-03-22 08:12:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:12:46] [INFO ] Implicit Places using invariants and state equation in 4100 ms returned []
Implicit Place search using SMT with State Equation took 6199 ms to find 0 implicit places.
[2023-03-22 08:12:46] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-22 08:12:46] [INFO ] Invariant cache hit.
[2023-03-22 08:12:48] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8527 ms. Remains : 2497/2497 places, 2098/2098 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 2497 transition count 2098
Applied a total of 598 rules in 221 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:12:48] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:12:49] [INFO ] [Real]Absence check using 1098 positive place invariants in 238 ms returned sat
[2023-03-22 08:12:50] [INFO ] After 1926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:12:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 243 ms returned sat
[2023-03-22 08:12:52] [INFO ] After 1337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 08:12:52] [INFO ] After 254ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:12:53] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-22 08:12:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 14 ms to minimize.
[2023-03-22 08:12:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2023-03-22 08:12:53] [INFO ] After 1091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-22 08:12:54] [INFO ] After 3423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 522 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1636 ms.
Product exploration explored 100000 steps with 0 reset in 2096 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 94 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:12:58] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:13:00] [INFO ] Implicit Places using invariants in 2187 ms returned []
[2023-03-22 08:13:00] [INFO ] Invariant cache hit.
[2023-03-22 08:13:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 08:13:05] [INFO ] Implicit Places using invariants and state equation in 4785 ms returned []
Implicit Place search using SMT with State Equation took 6987 ms to find 0 implicit places.
[2023-03-22 08:13:05] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 08:13:05] [INFO ] Invariant cache hit.
[2023-03-22 08:13:07] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8789 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-14 finished in 99309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F((p1 U (p2||G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||(p1&&X(p2))) U X(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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((G(p0)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-22 08:13:08] [INFO ] Flatten gal took : 234 ms
[2023-03-22 08:13:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 08:13:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6709 places, 6009 transitions and 15618 arcs took 64 ms.
Total runtime 921489 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2321/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2321/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2321/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2321/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2321/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLFireability-01
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLFireability-03
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLFireability-09
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLFireability-13
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLFireability-14

BK_STOP 1679472814314

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
ltl formula name ShieldPPPt-PT-100B-LTLFireability-01
ltl formula formula --ltl=/tmp/2321/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 6709 places, 6009 transitions and 15618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.520 real 0.420 user 0.560 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2321/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2321/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2321/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2321/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPt-PT-100B-LTLFireability-03
ltl formula formula --ltl=/tmp/2321/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 6709 places, 6009 transitions and 15618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.990 real 0.280 user 0.520 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2321/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2321/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2321/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2321/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f38095b3f4]
1: pnml2lts-mc(+0xa2496) [0x55f38095b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f89fe867140]
3: pnml2lts-mc(+0x405be5) [0x55f380cbebe5]
4: pnml2lts-mc(+0x16b3f9) [0x55f380a243f9]
5: pnml2lts-mc(+0x164ac4) [0x55f380a1dac4]
6: pnml2lts-mc(+0x272e0a) [0x55f380b2be0a]
7: pnml2lts-mc(+0xb61f0) [0x55f38096f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f89fe6ba4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f89fe6ba67a]
10: pnml2lts-mc(+0xa1581) [0x55f38095a581]
11: pnml2lts-mc(+0xa1910) [0x55f38095a910]
12: pnml2lts-mc(+0xa32a2) [0x55f38095c2a2]
13: pnml2lts-mc(+0xa50f4) [0x55f38095e0f4]
14: pnml2lts-mc(+0xa516b) [0x55f38095e16b]
15: pnml2lts-mc(+0x3f34b3) [0x55f380cac4b3]
16: pnml2lts-mc(+0x7c63d) [0x55f38093563d]
17: pnml2lts-mc(+0x67d86) [0x55f380920d86]
18: pnml2lts-mc(+0x60a8a) [0x55f380919a8a]
19: pnml2lts-mc(+0x5eb15) [0x55f380917b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f89fe6a2d0a]
21: pnml2lts-mc(+0x6075e) [0x55f38091975e]
ltl formula name ShieldPPPt-PT-100B-LTLFireability-13
ltl formula formula --ltl=/tmp/2321/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 6709 places, 6009 transitions and 15618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.080 real 0.380 user 0.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2321/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2321/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2321/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2321/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPt-PT-100B-LTLFireability-14
ltl formula formula --ltl=/tmp/2321/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 6709 places, 6009 transitions and 15618 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.330 user 0.430 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2321/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2321/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2321/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2321/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-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 r393-oct2-167903717300700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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