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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679431776422

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:49:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 20:49:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:49:39] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-21 20:49:39] [INFO ] Transformed 6003 places.
[2023-03-21 20:49:39] [INFO ] Transformed 5903 transitions.
[2023-03-21 20:49:39] [INFO ] Found NUPN structural information;
[2023-03-21 20:49:39] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 592 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-100B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 689 places :
Symmetric choice reduction at 0 with 689 rule applications. Total rules 689 place count 5314 transition count 5214
Iterating global reduction 0 with 689 rules applied. Total rules applied 1378 place count 5314 transition count 5214
Applied a total of 1378 rules in 1477 ms. Remains 5314 /6003 variables (removed 689) and now considering 5214/5903 (removed 689) transitions.
// Phase 1: matrix 5214 rows 5314 cols
[2023-03-21 20:49:41] [INFO ] Computed 901 place invariants in 115 ms
[2023-03-21 20:49:45] [INFO ] Implicit Places using invariants in 4235 ms returned []
[2023-03-21 20:49:45] [INFO ] Invariant cache hit.
[2023-03-21 20:49:48] [INFO ] Implicit Places using invariants and state equation in 2980 ms returned []
Implicit Place search using SMT with State Equation took 7279 ms to find 0 implicit places.
[2023-03-21 20:49:48] [INFO ] Invariant cache hit.
[2023-03-21 20:49:54] [INFO ] Dead Transitions using invariants and state equation in 5883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5314/6003 places, 5214/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14658 ms. Remains : 5314/6003 places, 5214/5903 transitions.
Support contains 61 out of 5314 places after structural reductions.
[2023-03-21 20:49:55] [INFO ] Flatten gal took : 384 ms
[2023-03-21 20:49:55] [INFO ] Flatten gal took : 224 ms
[2023-03-21 20:49:55] [INFO ] Input system was already deterministic with 5214 transitions.
Support contains 59 out of 5314 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 39) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-21 20:49:56] [INFO ] Invariant cache hit.
[2023-03-21 20:50:01] [INFO ] [Real]Absence check using 901 positive place invariants in 911 ms returned sat
[2023-03-21 20:50:01] [INFO ] After 4568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-21 20:50:05] [INFO ] [Nat]Absence check using 901 positive place invariants in 694 ms returned sat
[2023-03-21 20:50:19] [INFO ] After 11571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-21 20:50:22] [INFO ] Deduced a trap composed of 29 places in 2524 ms of which 39 ms to minimize.
[2023-03-21 20:50:24] [INFO ] Deduced a trap composed of 24 places in 2187 ms of which 29 ms to minimize.
[2023-03-21 20:50:27] [INFO ] Deduced a trap composed of 28 places in 2245 ms of which 15 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-21 20:50:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:50:27] [INFO ] After 25793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Parikh walk visited 1 properties in 9987 ms.
Support contains 41 out of 5314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 494 place count 5314 transition count 4720
Reduce places removed 494 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 495 rules applied. Total rules applied 989 place count 4820 transition count 4719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 990 place count 4819 transition count 4719
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 498 Pre rules applied. Total rules applied 990 place count 4819 transition count 4221
Deduced a syphon composed of 498 places in 23 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 3 with 996 rules applied. Total rules applied 1986 place count 4321 transition count 4221
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1993 place count 4314 transition count 4214
Iterating global reduction 3 with 7 rules applied. Total rules applied 2000 place count 4314 transition count 4214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2000 place count 4314 transition count 4211
Deduced a syphon composed of 3 places in 22 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2006 place count 4311 transition count 4211
Performed 1787 Post agglomeration using F-continuation condition.Transition count delta: 1787
Deduced a syphon composed of 1787 places in 36 ms
Reduce places removed 1787 places and 0 transitions.
Iterating global reduction 3 with 3574 rules applied. Total rules applied 5580 place count 2524 transition count 2424
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 676 times.
Drop transitions removed 676 transitions
Iterating global reduction 3 with 676 rules applied. Total rules applied 6256 place count 2524 transition count 2424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6257 place count 2523 transition count 2423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6258 place count 2522 transition count 2423
Applied a total of 6258 rules in 2070 ms. Remains 2522 /5314 variables (removed 2792) and now considering 2423/5214 (removed 2791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2071 ms. Remains : 2522/5314 places, 2423/5214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 23) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2423 rows 2522 cols
[2023-03-21 20:50:41] [INFO ] Computed 900 place invariants in 158 ms
[2023-03-21 20:50:43] [INFO ] [Real]Absence check using 889 positive place invariants in 186 ms returned sat
[2023-03-21 20:50:43] [INFO ] [Real]Absence check using 889 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-21 20:50:43] [INFO ] After 1328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-21 20:50:44] [INFO ] [Nat]Absence check using 889 positive place invariants in 272 ms returned sat
[2023-03-21 20:50:44] [INFO ] [Nat]Absence check using 889 positive and 11 generalized place invariants in 29 ms returned sat
[2023-03-21 20:50:48] [INFO ] After 2651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-21 20:50:48] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 13 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 26 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-21 20:50:49] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 0 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-21 20:50:50] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-21 20:50:51] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-21 20:50:51] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-21 20:50:51] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2023-03-21 20:50:52] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 1 ms to minimize.
[2023-03-21 20:50:52] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-21 20:50:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3961 ms
[2023-03-21 20:50:53] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-21 20:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2023-03-21 20:50:54] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-21 20:50:54] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 1 ms to minimize.
[2023-03-21 20:50:54] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 1 ms to minimize.
[2023-03-21 20:50:55] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2023-03-21 20:50:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1372 ms
[2023-03-21 20:50:55] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 1 ms to minimize.
[2023-03-21 20:50:55] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 14 ms to minimize.
[2023-03-21 20:50:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 877 ms
[2023-03-21 20:50:56] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2023-03-21 20:50:56] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 0 ms to minimize.
[2023-03-21 20:50:57] [INFO ] Deduced a trap composed of 11 places in 438 ms of which 1 ms to minimize.
[2023-03-21 20:50:57] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-21 20:50:58] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2023-03-21 20:50:58] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 28 ms to minimize.
[2023-03-21 20:50:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2318 ms
[2023-03-21 20:50:59] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 0 ms to minimize.
[2023-03-21 20:50:59] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 0 ms to minimize.
[2023-03-21 20:50:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 836 ms
[2023-03-21 20:51:00] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-21 20:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-21 20:51:00] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2023-03-21 20:51:01] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 1 ms to minimize.
[2023-03-21 20:51:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 767 ms
[2023-03-21 20:51:01] [INFO ] After 15634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1651 ms.
[2023-03-21 20:51:03] [INFO ] After 19719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1403 ms.
Support contains 29 out of 2522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2522/2522 places, 2423/2423 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 2522 transition count 2420
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2519 transition count 2420
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 20 place count 2512 transition count 2413
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 2512 transition count 2413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 2511 transition count 2412
Applied a total of 27 rules in 384 ms. Remains 2511 /2522 variables (removed 11) and now considering 2412/2423 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 2511/2522 places, 2412/2423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) 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 13) seen :0
Interrupted probabilistic random walk after 101938 steps, run timeout after 6002 ms. (steps per millisecond=16 ) properties seen :{1=1, 10=1}
Probabilistic random walk after 101938 steps, saw 100279 distinct states, run finished after 6003 ms. (steps per millisecond=16 ) properties seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 2412 rows 2511 cols
[2023-03-21 20:51:13] [INFO ] Computed 900 place invariants in 57 ms
[2023-03-21 20:51:14] [INFO ] [Real]Absence check using 891 positive place invariants in 340 ms returned sat
[2023-03-21 20:51:14] [INFO ] [Real]Absence check using 891 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-21 20:51:16] [INFO ] After 3511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 20:51:18] [INFO ] [Nat]Absence check using 891 positive place invariants in 326 ms returned sat
[2023-03-21 20:51:18] [INFO ] [Nat]Absence check using 891 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-21 20:51:22] [INFO ] After 3165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3740 ms
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 28 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1839 ms
[2023-03-21 20:51:28] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-21 20:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2023-03-21 20:51:29] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2023-03-21 20:51:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-21 20:51:30] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 27 ms to minimize.
[2023-03-21 20:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-21 20:51:30] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-21 20:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-21 20:51:31] [INFO ] After 12149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1781 ms.
[2023-03-21 20:51:32] [INFO ] After 16173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1129 ms.
Support contains 22 out of 2511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2511/2511 places, 2412/2412 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2508 transition count 2409
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 2508 transition count 2409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2507 transition count 2408
Applied a total of 12 rules in 354 ms. Remains 2507 /2511 variables (removed 4) and now considering 2408/2412 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 2507/2511 places, 2408/2412 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 107738 steps, run timeout after 6008 ms. (steps per millisecond=17 ) properties seen :{0=1}
Probabilistic random walk after 107738 steps, saw 106143 distinct states, run finished after 6008 ms. (steps per millisecond=17 ) properties seen :1
Running SMT prover for 10 properties.
// Phase 1: matrix 2408 rows 2507 cols
[2023-03-21 20:51:42] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-21 20:51:43] [INFO ] [Real]Absence check using 894 positive place invariants in 265 ms returned sat
[2023-03-21 20:51:43] [INFO ] [Real]Absence check using 894 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-21 20:51:47] [INFO ] After 4917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 20:51:48] [INFO ] [Nat]Absence check using 894 positive place invariants in 254 ms returned sat
[2023-03-21 20:51:48] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 17 ms returned sat
[2023-03-21 20:51:52] [INFO ] After 3016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 10 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 5 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 0 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 22 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 1 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4780 ms
[2023-03-21 20:51:57] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-21 20:51:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2023-03-21 20:51:59] [INFO ] After 10075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1155 ms.
[2023-03-21 20:52:00] [INFO ] After 13060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 999 ms.
Support contains 21 out of 2507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2507/2507 places, 2408/2408 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2507 transition count 2408
Applied a total of 1 rules in 234 ms. Remains 2507 /2507 variables (removed 0) and now considering 2408/2408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 2507/2507 places, 2408/2408 transitions.
Computed a total of 1207 stabilizing places and 1207 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' '!(((p0 U G(p1))&&X((!p0&&G(F(p2))))))'
Support contains 3 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 1552 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-21 20:52:04] [INFO ] Computed 901 place invariants in 34 ms
[2023-03-21 20:52:07] [INFO ] Implicit Places using invariants in 2647 ms returned []
[2023-03-21 20:52:07] [INFO ] Invariant cache hit.
[2023-03-21 20:52:09] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 5076 ms to find 0 implicit places.
[2023-03-21 20:52:09] [INFO ] Invariant cache hit.
[2023-03-21 20:52:14] [INFO ] Dead Transitions using invariants and state equation in 5205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11849 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 675 ms :[(OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p1), (OR (NOT p2) p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1379 1), p0:(NEQ s4785 1), p2:(EQ s2315 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-00 finished in 12670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1||G(p2))))))'
Support contains 6 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1057 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:52:16] [INFO ] Computed 901 place invariants in 43 ms
[2023-03-21 20:52:19] [INFO ] Implicit Places using invariants in 2766 ms returned []
[2023-03-21 20:52:19] [INFO ] Invariant cache hit.
[2023-03-21 20:52:21] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned []
Implicit Place search using SMT with State Equation took 4941 ms to find 0 implicit places.
[2023-03-21 20:52:21] [INFO ] Invariant cache hit.
[2023-03-21 20:52:26] [INFO ] Dead Transitions using invariants and state equation in 5250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11266 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 7}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=7 dest: 7}]], initial=2, aps=[p1:(NEQ s1538 1), p2:(OR (NEQ s548 1) (EQ s5205 1)), p0:(AND (EQ s4988 1) (EQ s4433 1) (EQ s4449 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11508 steps with 0 reset in 338 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-01 finished in 12104 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 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 23 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2024 place count 4301 transition count 4197
Deduced a syphon composed of 4 places in 24 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2032 place count 4297 transition count 4197
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 14 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5622 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2500 transition count 2401
Applied a total of 5623 rules in 1588 ms. Remains 2500 /5314 variables (removed 2814) and now considering 2401/5214 (removed 2813) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:52:29] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 20:52:31] [INFO ] Implicit Places using invariants in 2377 ms returned []
[2023-03-21 20:52:31] [INFO ] Invariant cache hit.
[2023-03-21 20:52:35] [INFO ] Implicit Places using invariants and state equation in 4237 ms returned []
Implicit Place search using SMT with State Equation took 6620 ms to find 0 implicit places.
[2023-03-21 20:52:36] [INFO ] Redundant transitions in 778 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:52:36] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-21 20:52:38] [INFO ] Dead Transitions using invariants and state equation in 2203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5314 places, 2400/5214 transitions.
Applied a total of 0 rules in 94 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11306 ms. Remains : 2500/5314 places, 2400/5214 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s412 1) (EQ s421 1) (EQ s427 1)), p0:(EQ s1616 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5091 steps with 0 reset in 85 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-02 finished in 11566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 935 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-21 20:52:40] [INFO ] Computed 901 place invariants in 38 ms
[2023-03-21 20:52:42] [INFO ] Implicit Places using invariants in 2433 ms returned []
[2023-03-21 20:52:42] [INFO ] Invariant cache hit.
[2023-03-21 20:52:44] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 4619 ms to find 0 implicit places.
[2023-03-21 20:52:44] [INFO ] Invariant cache hit.
[2023-03-21 20:52:49] [INFO ] Dead Transitions using invariants and state equation in 4819 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10399 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 410 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s3696 1), p1:(AND (EQ s438 1) (EQ s454 1) (EQ s463 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-03 finished in 10867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5304 transition count 5204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5304 transition count 5204
Applied a total of 20 rules in 957 ms. Remains 5304 /5314 variables (removed 10) and now considering 5204/5214 (removed 10) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2023-03-21 20:52:50] [INFO ] Computed 901 place invariants in 41 ms
[2023-03-21 20:52:53] [INFO ] Implicit Places using invariants in 2726 ms returned []
[2023-03-21 20:52:53] [INFO ] Invariant cache hit.
[2023-03-21 20:52:56] [INFO ] Implicit Places using invariants and state equation in 2671 ms returned []
Implicit Place search using SMT with State Equation took 5421 ms to find 0 implicit places.
[2023-03-21 20:52:56] [INFO ] Invariant cache hit.
[2023-03-21 20:53:01] [INFO ] Dead Transitions using invariants and state equation in 4977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5314 places, 5204/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11356 ms. Remains : 5304/5314 places, 5204/5214 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s291 1), p0:(AND (EQ s4420 0) (EQ s2684 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1687 ms.
Product exploration explored 100000 steps with 50000 reset in 1535 ms.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Computed a total of 1201 stabilizing places and 1201 stable transitions
Detected a total of 1201/5304 stabilizing places and 1201/5204 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 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-05 finished in 15313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((G((p1||G(p2))) U (!p3&&G((p1||G(p2))))))||p0))))'
Support contains 8 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1016 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:53:06] [INFO ] Computed 901 place invariants in 50 ms
[2023-03-21 20:53:08] [INFO ] Implicit Places using invariants in 2414 ms returned []
[2023-03-21 20:53:08] [INFO ] Invariant cache hit.
[2023-03-21 20:53:10] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 4639 ms to find 0 implicit places.
[2023-03-21 20:53:10] [INFO ] Invariant cache hit.
[2023-03-21 20:53:16] [INFO ] Dead Transitions using invariants and state equation in 5121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10805 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={1} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s3974 1) (NEQ s3992 1) (NEQ s3999 1) (NEQ s695 1) (NEQ s705 1) (NEQ s724 1)), p3:(AND (EQ s3974 1) (EQ s3992 1) (EQ s3999 1) (EQ s695 1) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1557 ms.
Product exploration explored 100000 steps with 50000 reset in 1622 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-06 finished in 14734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 988 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-21 20:53:21] [INFO ] Computed 901 place invariants in 50 ms
[2023-03-21 20:53:23] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2023-03-21 20:53:23] [INFO ] Invariant cache hit.
[2023-03-21 20:53:25] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 4498 ms to find 0 implicit places.
[2023-03-21 20:53:25] [INFO ] Invariant cache hit.
[2023-03-21 20:53:31] [INFO ] Dead Transitions using invariants and state equation in 5694 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11193 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s4754 1) (EQ s4770 1) (EQ s4779 1)), p1:(EQ s4031 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3417 steps with 0 reset in 67 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-07 finished in 11624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 1014 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
[2023-03-21 20:53:32] [INFO ] Invariant cache hit.
[2023-03-21 20:53:35] [INFO ] Implicit Places using invariants in 3020 ms returned []
[2023-03-21 20:53:35] [INFO ] Invariant cache hit.
[2023-03-21 20:53:38] [INFO ] Implicit Places using invariants and state equation in 2652 ms returned []
Implicit Place search using SMT with State Equation took 5704 ms to find 0 implicit places.
[2023-03-21 20:53:38] [INFO ] Invariant cache hit.
[2023-03-21 20:53:45] [INFO ] Dead Transitions using invariants and state equation in 6802 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13526 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4849 1) (EQ s4864 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12210 steps with 0 reset in 227 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-08 finished in 13958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 951 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:53:46] [INFO ] Computed 901 place invariants in 51 ms
[2023-03-21 20:53:51] [INFO ] Implicit Places using invariants in 4501 ms returned []
[2023-03-21 20:53:51] [INFO ] Invariant cache hit.
[2023-03-21 20:53:54] [INFO ] Implicit Places using invariants and state equation in 3504 ms returned []
Implicit Place search using SMT with State Equation took 8022 ms to find 0 implicit places.
[2023-03-21 20:53:54] [INFO ] Invariant cache hit.
[2023-03-21 20:54:00] [INFO ] Dead Transitions using invariants and state equation in 5921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14916 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2768 1) (EQ s254 1)), p1:(AND (EQ s2199 1) (EQ s2201 1)), p2:(EQ s2768 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12560 steps with 0 reset in 223 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-09 finished in 15659 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))||G(p1)||(X(F(p2))&&G(p3))))'
Support contains 6 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5304 transition count 5204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5304 transition count 5204
Applied a total of 20 rules in 949 ms. Remains 5304 /5314 variables (removed 10) and now considering 5204/5214 (removed 10) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2023-03-21 20:54:02] [INFO ] Computed 901 place invariants in 31 ms
[2023-03-21 20:54:05] [INFO ] Implicit Places using invariants in 2892 ms returned []
[2023-03-21 20:54:05] [INFO ] Invariant cache hit.
[2023-03-21 20:54:09] [INFO ] Implicit Places using invariants and state equation in 4275 ms returned []
Implicit Place search using SMT with State Equation took 7203 ms to find 0 implicit places.
[2023-03-21 20:54:09] [INFO ] Invariant cache hit.
[2023-03-21 20:54:15] [INFO ] Dead Transitions using invariants and state equation in 5774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5314 places, 5204/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13931 ms. Remains : 5304/5314 places, 5204/5214 transitions.
Stuttering acceptance computed with spot in 1049 ms :[true, (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND p1 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p3 p0 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p3 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p3 p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p0) p2), acceptance={} source=4 dest: 8}, { cond=(AND p1 p3 p0 p2), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=4 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=4 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 p2), acceptance={} source=7 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p3 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=9 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=9 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=9 dest: 12}], [{ cond=(NOT p0), acceptance={} source=10 dest: 0}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(AND p1 p0), acceptance={} source=11 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p1), acceptance={} source=12 dest: 0}, { cond=p1, acceptance={} source=12 dest: 12}]], initial=2, aps=[p3:(EQ s3413 1), p2:(AND (EQ s1788 1) (EQ s1856 1)), p1:(OR (EQ s3406 0) (EQ s3451 0)), p0:(EQ s3215 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5258 steps with 0 reset in 112 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-10 finished in 15194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5313 transition count 4713
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4813 transition count 4713
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4813 transition count 4213
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2024 place count 4301 transition count 4197
Deduced a syphon composed of 4 places in 24 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2032 place count 4297 transition count 4197
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 16 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5622 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2500 transition count 2401
Applied a total of 5623 rules in 1719 ms. Remains 2500 /5314 variables (removed 2814) and now considering 2401/5214 (removed 2813) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:54:18] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:54:20] [INFO ] Implicit Places using invariants in 2449 ms returned []
[2023-03-21 20:54:20] [INFO ] Invariant cache hit.
[2023-03-21 20:54:25] [INFO ] Implicit Places using invariants and state equation in 4613 ms returned []
Implicit Place search using SMT with State Equation took 7080 ms to find 0 implicit places.
[2023-03-21 20:54:25] [INFO ] Redundant transitions in 566 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:54:25] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-21 20:54:27] [INFO ] Dead Transitions using invariants and state equation in 2158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5314 places, 2400/5214 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11617 ms. Remains : 2500/5314 places, 2400/5214 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-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:(AND (EQ s1328 1) (EQ s1344 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 45 reset in 1535 ms.
Product exploration explored 100000 steps with 44 reset in 1832 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 173 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 110 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2218 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 244 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
[2023-03-21 20:54:32] [INFO ] Invariant cache hit.
[2023-03-21 20:54:38] [INFO ] [Real]Absence check using 900 positive place invariants in 2485 ms returned sat
[2023-03-21 20:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:54:47] [INFO ] [Real]Absence check using state equation in 9302 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:54:47] [INFO ] Invariant cache hit.
[2023-03-21 20:54:49] [INFO ] Implicit Places using invariants in 1980 ms returned []
[2023-03-21 20:54:49] [INFO ] Invariant cache hit.
[2023-03-21 20:54:53] [INFO ] Implicit Places using invariants and state equation in 4149 ms returned []
Implicit Place search using SMT with State Equation took 6131 ms to find 0 implicit places.
[2023-03-21 20:54:54] [INFO ] Redundant transitions in 268 ms returned []
[2023-03-21 20:54:54] [INFO ] Invariant cache hit.
[2023-03-21 20:54:56] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8415 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 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 137 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2118 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=48 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
[2023-03-21 20:54:56] [INFO ] Invariant cache hit.
[2023-03-21 20:55:00] [INFO ] [Real]Absence check using 900 positive place invariants in 888 ms returned sat
[2023-03-21 20:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:55:11] [INFO ] [Real]Absence check using state equation in 11460 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 45 reset in 1623 ms.
Product exploration explored 100000 steps with 45 reset in 2083 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:55:15] [INFO ] Invariant cache hit.
[2023-03-21 20:55:17] [INFO ] Implicit Places using invariants in 1685 ms returned []
[2023-03-21 20:55:17] [INFO ] Invariant cache hit.
[2023-03-21 20:55:22] [INFO ] Implicit Places using invariants and state equation in 4900 ms returned []
Implicit Place search using SMT with State Equation took 6605 ms to find 0 implicit places.
[2023-03-21 20:55:23] [INFO ] Redundant transitions in 939 ms returned []
[2023-03-21 20:55:23] [INFO ] Invariant cache hit.
[2023-03-21 20:55:26] [INFO ] Dead Transitions using invariants and state equation in 3152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10817 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLFireability-11 finished in 70692 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 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 998 place count 4814 transition count 4214
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1998 place count 4314 transition count 4214
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2010 place count 4302 transition count 4202
Iterating global reduction 2 with 12 rules applied. Total rules applied 2022 place count 4302 transition count 4202
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2022 place count 4302 transition count 4198
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2030 place count 4298 transition count 4198
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 12 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5614 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5616 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 2503 transition count 2404
Applied a total of 5617 rules in 1383 ms. Remains 2503 /5314 variables (removed 2811) and now considering 2404/5214 (removed 2810) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-21 20:55:28] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:55:31] [INFO ] Implicit Places using invariants in 2764 ms returned []
[2023-03-21 20:55:31] [INFO ] Invariant cache hit.
[2023-03-21 20:55:36] [INFO ] Implicit Places using invariants and state equation in 5415 ms returned []
Implicit Place search using SMT with State Equation took 8209 ms to find 0 implicit places.
[2023-03-21 20:55:37] [INFO ] Redundant transitions in 526 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:55:37] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 20:55:40] [INFO ] Dead Transitions using invariants and state equation in 3246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5314 places, 2403/5214 transitions.
Applied a total of 0 rules in 117 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13505 ms. Remains : 2503/5314 places, 2403/5214 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2230 0), p1:(NEQ s2230 1), p0:(NEQ s349 1), p3:(EQ s349 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 387 reset in 1578 ms.
Product exploration explored 100000 steps with 474 reset in 2082 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 1489 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 354 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 20:55:47] [INFO ] Invariant cache hit.
[2023-03-21 20:55:48] [INFO ] [Real]Absence check using 900 positive place invariants in 284 ms returned sat
[2023-03-21 20:55:48] [INFO ] After 818ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:55:49] [INFO ] [Nat]Absence check using 900 positive place invariants in 223 ms returned sat
[2023-03-21 20:55:49] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 15 factoid took 2129 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 118 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:55:52] [INFO ] Invariant cache hit.
[2023-03-21 20:55:54] [INFO ] Implicit Places using invariants in 2077 ms returned []
[2023-03-21 20:55:54] [INFO ] Invariant cache hit.
[2023-03-21 20:55:58] [INFO ] Implicit Places using invariants and state equation in 4634 ms returned []
Implicit Place search using SMT with State Equation took 6731 ms to find 0 implicit places.
[2023-03-21 20:55:59] [INFO ] Redundant transitions in 646 ms returned []
[2023-03-21 20:55:59] [INFO ] Invariant cache hit.
[2023-03-21 20:56:01] [INFO ] Dead Transitions using invariants and state equation in 2038 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9570 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 560 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Finished random walk after 6671 steps, including 2 resets, run visited all 4 properties in 114 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0))), (F (OR (AND p3 (NOT p2)) (AND (NOT p2) (NOT p0)))), (F (AND p3 (NOT p2) p0)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 704 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 420 reset in 1533 ms.
Product exploration explored 100000 steps with 373 reset in 1896 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:56:07] [INFO ] Invariant cache hit.
[2023-03-21 20:56:13] [INFO ] Implicit Places using invariants in 5847 ms returned []
[2023-03-21 20:56:13] [INFO ] Invariant cache hit.
[2023-03-21 20:56:18] [INFO ] Implicit Places using invariants and state equation in 4605 ms returned []
Implicit Place search using SMT with State Equation took 10459 ms to find 0 implicit places.
[2023-03-21 20:56:18] [INFO ] Redundant transitions in 458 ms returned []
[2023-03-21 20:56:18] [INFO ] Invariant cache hit.
[2023-03-21 20:56:21] [INFO ] Dead Transitions using invariants and state equation in 2598 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13627 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLFireability-12 finished in 54417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||X((p2||G(p3)))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1024 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:56:22] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-21 20:56:25] [INFO ] Implicit Places using invariants in 2604 ms returned []
[2023-03-21 20:56:25] [INFO ] Invariant cache hit.
[2023-03-21 20:56:27] [INFO ] Implicit Places using invariants and state equation in 2746 ms returned []
Implicit Place search using SMT with State Equation took 5353 ms to find 0 implicit places.
[2023-03-21 20:56:27] [INFO ] Invariant cache hit.
[2023-03-21 20:56:33] [INFO ] Dead Transitions using invariants and state equation in 5840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12222 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 518 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s2239 1), p1:(EQ s101 1), p2:(EQ s1123 1), p3:(EQ s3946 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-13 finished in 12830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 5 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 1063 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-21 20:56:35] [INFO ] Computed 901 place invariants in 27 ms
[2023-03-21 20:56:38] [INFO ] Implicit Places using invariants in 2801 ms returned []
[2023-03-21 20:56:38] [INFO ] Invariant cache hit.
[2023-03-21 20:56:40] [INFO ] Implicit Places using invariants and state equation in 2516 ms returned []
Implicit Place search using SMT with State Equation took 5345 ms to find 0 implicit places.
[2023-03-21 20:56:40] [INFO ] Invariant cache hit.
[2023-03-21 20:56:46] [INFO ] Dead Transitions using invariants and state equation in 6008 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12430 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s464 1), p1:(OR (EQ s2576 1) (AND (EQ s4183 1) (EQ s4199 1) (EQ s4208 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-14 finished in 12826 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)||G(p1)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 27 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2010 place count 4303 transition count 4203
Iterating global reduction 2 with 10 rules applied. Total rules applied 2020 place count 4303 transition count 4203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2020 place count 4303 transition count 4201
Deduced a syphon composed of 2 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 17 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5614 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5616 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 2503 transition count 2404
Applied a total of 5617 rules in 1763 ms. Remains 2503 /5314 variables (removed 2811) and now considering 2404/5214 (removed 2810) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-21 20:56:49] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-21 20:56:55] [INFO ] Implicit Places using invariants in 6348 ms returned []
[2023-03-21 20:56:55] [INFO ] Invariant cache hit.
[2023-03-21 20:57:01] [INFO ] Implicit Places using invariants and state equation in 5799 ms returned []
Implicit Place search using SMT with State Equation took 12169 ms to find 0 implicit places.
[2023-03-21 20:57:01] [INFO ] Redundant transitions in 615 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:57:01] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:57:04] [INFO ] Dead Transitions using invariants and state equation in 2377 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5314 places, 2403/5214 transitions.
Applied a total of 0 rules in 124 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17084 ms. Remains : 2503/5314 places, 2403/5214 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s1693 1), p1:(EQ s2489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27050 reset in 1683 ms.
Product exploration explored 100000 steps with 27090 reset in 2044 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT 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 (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 526 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT 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 (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 651 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-21 20:57:09] [INFO ] Invariant cache hit.
[2023-03-21 20:57:14] [INFO ] [Real]Absence check using 900 positive place invariants in 1036 ms returned sat
[2023-03-21 20:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:57:24] [INFO ] [Real]Absence check using state equation in 10627 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 135 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:57:24] [INFO ] Invariant cache hit.
[2023-03-21 20:57:27] [INFO ] Implicit Places using invariants in 2415 ms returned []
[2023-03-21 20:57:27] [INFO ] Invariant cache hit.
[2023-03-21 20:57:31] [INFO ] Implicit Places using invariants and state equation in 3867 ms returned []
Implicit Place search using SMT with State Equation took 6295 ms to find 0 implicit places.
[2023-03-21 20:57:31] [INFO ] Redundant transitions in 749 ms returned []
[2023-03-21 20:57:31] [INFO ] Invariant cache hit.
[2023-03-21 20:57:34] [INFO ] Dead Transitions using invariants and state equation in 2922 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10118 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 275 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 338 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
[2023-03-21 20:57:35] [INFO ] Invariant cache hit.
[2023-03-21 20:57:40] [INFO ] [Real]Absence check using 900 positive place invariants in 908 ms returned sat
[2023-03-21 20:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:57:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27207 reset in 1809 ms.
Product exploration explored 100000 steps with 27165 reset in 1919 ms.
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 200 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:57:54] [INFO ] Computed 900 place invariants in 12 ms
[2023-03-21 20:57:59] [INFO ] Implicit Places using invariants in 4926 ms returned []
[2023-03-21 20:57:59] [INFO ] Invariant cache hit.
[2023-03-21 20:58:06] [INFO ] Implicit Places using invariants and state equation in 7025 ms returned []
Implicit Place search using SMT with State Equation took 11972 ms to find 0 implicit places.
[2023-03-21 20:58:07] [INFO ] Redundant transitions in 763 ms returned []
[2023-03-21 20:58:07] [INFO ] Invariant cache hit.
[2023-03-21 20:58:09] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14893 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLFireability-15 finished in 82557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2023-03-21 20:58:10] [INFO ] Flatten gal took : 175 ms
[2023-03-21 20:58:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 20:58:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5314 places, 5214 transitions and 16428 arcs took 29 ms.
Total runtime 511751 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1963/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1963/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1963/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-100B-LTLFireability-11
Could not compute solution for formula : ShieldIIPs-PT-100B-LTLFireability-12
Could not compute solution for formula : ShieldIIPs-PT-100B-LTLFireability-15

BK_STOP 1679432302580

--------------------
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 ShieldIIPs-PT-100B-LTLFireability-11
ltl formula formula --ltl=/tmp/1963/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 5314 places, 5214 transitions and 16428 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.090 real 0.370 user 0.460 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1963/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1963/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1963/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1963/ltl_0_
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
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-100B-LTLFireability-12
ltl formula formula --ltl=/tmp/1963/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5314 places, 5214 transitions and 16428 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.310 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1963/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1963/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1963/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1963/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-100B-LTLFireability-15
ltl formula formula --ltl=/tmp/1963/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 5314 places, 5214 transitions and 16428 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.220 real 0.340 user 0.530 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1963/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1963/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1963/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1963/ltl_2_
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)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-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 ShieldIIPs-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-167903716700172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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