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-167903717100508.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 ShieldPPPs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679456373371

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=ShieldPPPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:39:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:39:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:39:35] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-22 03:39:36] [INFO ] Transformed 3403 places.
[2023-03-22 03:39:36] [INFO ] Transformed 3153 transitions.
[2023-03-22 03:39:36] [INFO ] Found NUPN structural information;
[2023-03-22 03:39:36] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 60 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 342 places :
Symmetric choice reduction at 0 with 342 rule applications. Total rules 342 place count 3061 transition count 2811
Iterating global reduction 0 with 342 rules applied. Total rules applied 684 place count 3061 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 3060 transition count 2810
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 3060 transition count 2810
Applied a total of 686 rules in 1159 ms. Remains 3060 /3403 variables (removed 343) and now considering 2810/3153 (removed 343) transitions.
// Phase 1: matrix 2810 rows 3060 cols
[2023-03-22 03:39:37] [INFO ] Computed 551 place invariants in 33 ms
[2023-03-22 03:39:39] [INFO ] Implicit Places using invariants in 2416 ms returned []
[2023-03-22 03:39:39] [INFO ] Invariant cache hit.
[2023-03-22 03:39:45] [INFO ] Implicit Places using invariants and state equation in 5772 ms returned []
Implicit Place search using SMT with State Equation took 8225 ms to find 0 implicit places.
[2023-03-22 03:39:45] [INFO ] Invariant cache hit.
[2023-03-22 03:39:48] [INFO ] Dead Transitions using invariants and state equation in 2575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3060/3403 places, 2810/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11974 ms. Remains : 3060/3403 places, 2810/3153 transitions.
Support contains 60 out of 3060 places after structural reductions.
[2023-03-22 03:39:48] [INFO ] Flatten gal took : 324 ms
[2023-03-22 03:39:48] [INFO ] Flatten gal took : 121 ms
[2023-03-22 03:39:49] [INFO ] Input system was already deterministic with 2810 transitions.
Support contains 57 out of 3060 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 37) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-22 03:39:50] [INFO ] Invariant cache hit.
[2023-03-22 03:39:51] [INFO ] [Real]Absence check using 551 positive place invariants in 354 ms returned sat
[2023-03-22 03:39:52] [INFO ] After 1830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 03:39:53] [INFO ] [Nat]Absence check using 551 positive place invariants in 406 ms returned sat
[2023-03-22 03:39:58] [INFO ] After 3897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 03:39:59] [INFO ] Deduced a trap composed of 18 places in 1267 ms of which 15 ms to minimize.
[2023-03-22 03:40:01] [INFO ] Deduced a trap composed of 26 places in 1332 ms of which 2 ms to minimize.
[2023-03-22 03:40:02] [INFO ] Deduced a trap composed of 25 places in 1207 ms of which 15 ms to minimize.
[2023-03-22 03:40:04] [INFO ] Deduced a trap composed of 23 places in 1442 ms of which 4 ms to minimize.
[2023-03-22 03:40:05] [INFO ] Deduced a trap composed of 22 places in 1147 ms of which 3 ms to minimize.
[2023-03-22 03:40:06] [INFO ] Deduced a trap composed of 35 places in 1177 ms of which 2 ms to minimize.
[2023-03-22 03:40:07] [INFO ] Deduced a trap composed of 20 places in 1097 ms of which 15 ms to minimize.
[2023-03-22 03:40:09] [INFO ] Deduced a trap composed of 31 places in 969 ms of which 2 ms to minimize.
[2023-03-22 03:40:10] [INFO ] Deduced a trap composed of 36 places in 928 ms of which 1 ms to minimize.
[2023-03-22 03:40:11] [INFO ] Deduced a trap composed of 20 places in 992 ms of which 3 ms to minimize.
[2023-03-22 03:40:12] [INFO ] Deduced a trap composed of 28 places in 828 ms of which 2 ms to minimize.
[2023-03-22 03:40:13] [INFO ] Deduced a trap composed of 24 places in 841 ms of which 2 ms to minimize.
[2023-03-22 03:40:14] [INFO ] Deduced a trap composed of 16 places in 974 ms of which 2 ms to minimize.
[2023-03-22 03:40:15] [INFO ] Deduced a trap composed of 25 places in 946 ms of which 2 ms to minimize.
[2023-03-22 03:40:16] [INFO ] Deduced a trap composed of 26 places in 969 ms of which 1 ms to minimize.
[2023-03-22 03:40:17] [INFO ] Deduced a trap composed of 16 places in 898 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:40:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:40:17] [INFO ] After 25381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 2310 ms.
Support contains 24 out of 3060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3060 transition count 2465
Reduce places removed 345 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 346 rules applied. Total rules applied 691 place count 2715 transition count 2464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 692 place count 2714 transition count 2464
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 692 place count 2714 transition count 2212
Deduced a syphon composed of 252 places in 9 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1196 place count 2462 transition count 2212
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1201 place count 2457 transition count 2207
Iterating global reduction 3 with 5 rules applied. Total rules applied 1206 place count 2457 transition count 2207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1206 place count 2457 transition count 2204
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1212 place count 2454 transition count 2204
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 3 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 3 with 1772 rules applied. Total rules applied 2984 place count 1568 transition count 1318
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 3 with 436 rules applied. Total rules applied 3420 place count 1568 transition count 1318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3421 place count 1567 transition count 1317
Applied a total of 3421 rules in 933 ms. Remains 1567 /3060 variables (removed 1493) and now considering 1317/2810 (removed 1493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 1567/3060 places, 1317/2810 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1317 rows 1567 cols
[2023-03-22 03:40:21] [INFO ] Computed 551 place invariants in 49 ms
[2023-03-22 03:40:22] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 03:40:22] [INFO ] [Nat]Absence check using 522 positive place invariants in 250 ms returned sat
[2023-03-22 03:40:22] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-22 03:40:24] [INFO ] After 1284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 03:40:24] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 0 ms to minimize.
[2023-03-22 03:40:25] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2023-03-22 03:40:25] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-22 03:40:25] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2023-03-22 03:40:26] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-22 03:40:26] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 3 ms to minimize.
[2023-03-22 03:40:26] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-22 03:40:26] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-22 03:40:27] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-22 03:40:27] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2023-03-22 03:40:27] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-22 03:40:27] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-22 03:40:28] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-22 03:40:28] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-22 03:40:28] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-22 03:40:29] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2023-03-22 03:40:29] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2023-03-22 03:40:29] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 5 ms to minimize.
[2023-03-22 03:40:29] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:40:30] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 2 ms to minimize.
[2023-03-22 03:40:30] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-22 03:40:30] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-22 03:40:30] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-22 03:40:31] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 14 ms to minimize.
[2023-03-22 03:40:31] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 0 ms to minimize.
[2023-03-22 03:40:31] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-22 03:40:31] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 14 ms to minimize.
[2023-03-22 03:40:31] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-22 03:40:32] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-22 03:40:32] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7694 ms
[2023-03-22 03:40:32] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2023-03-22 03:40:32] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-22 03:40:32] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 03:40:33] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-22 03:40:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 919 ms
[2023-03-22 03:40:33] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 03:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-22 03:40:33] [INFO ] After 10737ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 559 ms.
[2023-03-22 03:40:34] [INFO ] After 12232ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 9 out of 1567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1317/1317 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1567 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1566 transition count 1316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1566 transition count 1315
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1565 transition count 1315
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 1558 transition count 1308
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1558 transition count 1308
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 1556 transition count 1306
Applied a total of 26 rules in 315 ms. Remains 1556 /1567 variables (removed 11) and now considering 1306/1317 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 1556/1567 places, 1306/1317 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1306 rows 1556 cols
[2023-03-22 03:40:35] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-22 03:40:35] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:40:36] [INFO ] [Nat]Absence check using 528 positive place invariants in 305 ms returned sat
[2023-03-22 03:40:36] [INFO ] [Nat]Absence check using 528 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-22 03:40:36] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:40:37] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2023-03-22 03:40:37] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-22 03:40:37] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-22 03:40:37] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 0 ms to minimize.
[2023-03-22 03:40:38] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 21 ms to minimize.
[2023-03-22 03:40:38] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 6 ms to minimize.
[2023-03-22 03:40:38] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-22 03:40:38] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
[2023-03-22 03:40:39] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-22 03:40:39] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-22 03:40:39] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2023-03-22 03:40:39] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-22 03:40:40] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 5 ms to minimize.
[2023-03-22 03:40:40] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2023-03-22 03:40:40] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 3 ms to minimize.
[2023-03-22 03:40:40] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 2 ms to minimize.
[2023-03-22 03:40:41] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 26 ms to minimize.
[2023-03-22 03:40:41] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 14 ms to minimize.
[2023-03-22 03:40:41] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 13 ms to minimize.
[2023-03-22 03:40:41] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-22 03:40:42] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-22 03:40:42] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2023-03-22 03:40:42] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-22 03:40:42] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-22 03:40:42] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2023-03-22 03:40:43] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-22 03:40:43] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-22 03:40:43] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-22 03:40:43] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2023-03-22 03:40:43] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-22 03:40:44] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 03:40:44] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-22 03:40:44] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-22 03:40:44] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 7797 ms
[2023-03-22 03:40:44] [INFO ] After 8665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-22 03:40:45] [INFO ] After 9481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 1556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1556/1556 places, 1306/1306 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1556 transition count 1305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1555 transition count 1305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1555 transition count 1304
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1554 transition count 1304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1552 transition count 1302
Applied a total of 8 rules in 135 ms. Remains 1552 /1556 variables (removed 4) and now considering 1302/1306 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1552/1556 places, 1302/1306 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 87466 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87466 steps, saw 81789 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-22 03:40:48] [INFO ] Computed 551 place invariants in 18 ms
[2023-03-22 03:40:48] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:40:49] [INFO ] [Nat]Absence check using 525 positive place invariants in 163 ms returned sat
[2023-03-22 03:40:49] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 33 ms returned sat
[2023-03-22 03:40:50] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:40:50] [INFO ] Deduced a trap composed of 5 places in 383 ms of which 0 ms to minimize.
[2023-03-22 03:40:51] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 0 ms to minimize.
[2023-03-22 03:40:51] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 1 ms to minimize.
[2023-03-22 03:40:52] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 1 ms to minimize.
[2023-03-22 03:40:52] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 1 ms to minimize.
[2023-03-22 03:40:52] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2023-03-22 03:40:53] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-22 03:40:53] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-22 03:40:53] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2023-03-22 03:40:53] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-22 03:40:54] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-22 03:40:54] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-22 03:40:54] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-22 03:40:54] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-22 03:40:55] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-22 03:40:55] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-22 03:40:55] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2023-03-22 03:40:55] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-22 03:40:56] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-22 03:40:56] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-22 03:40:56] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-22 03:40:56] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-22 03:40:57] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2023-03-22 03:40:57] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-22 03:40:57] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-22 03:40:57] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-22 03:40:57] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-22 03:40:58] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2023-03-22 03:40:58] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-22 03:40:58] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-22 03:40:58] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2023-03-22 03:40:58] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2023-03-22 03:40:59] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2023-03-22 03:40:59] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-22 03:40:59] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2023-03-22 03:40:59] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-22 03:40:59] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-22 03:41:00] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 2 ms to minimize.
[2023-03-22 03:41:00] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2023-03-22 03:41:00] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 1 ms to minimize.
[2023-03-22 03:41:00] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2023-03-22 03:41:00] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10359 ms
[2023-03-22 03:41:00] [INFO ] After 11380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-22 03:41:01] [INFO ] After 12071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 96 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 82 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-22 03:41:01] [INFO ] Invariant cache hit.
[2023-03-22 03:41:02] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-22 03:41:02] [INFO ] Invariant cache hit.
[2023-03-22 03:41:05] [INFO ] Implicit Places using invariants and state equation in 3010 ms returned []
Implicit Place search using SMT with State Equation took 3989 ms to find 0 implicit places.
[2023-03-22 03:41:05] [INFO ] Redundant transitions in 161 ms returned []
[2023-03-22 03:41:05] [INFO ] Invariant cache hit.
[2023-03-22 03:41:06] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5125 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 71 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 03:41:06] [INFO ] Invariant cache hit.
[2023-03-22 03:41:06] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:41:07] [INFO ] [Nat]Absence check using 525 positive place invariants in 126 ms returned sat
[2023-03-22 03:41:07] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 32 ms returned sat
[2023-03-22 03:41:08] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:41:08] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2023-03-22 03:41:08] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2023-03-22 03:41:08] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-22 03:41:08] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-22 03:41:09] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-22 03:41:09] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-22 03:41:09] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2023-03-22 03:41:09] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-22 03:41:09] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-22 03:41:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1774 ms
[2023-03-22 03:41:09] [INFO ] After 2861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-22 03:41:10] [INFO ] After 3428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldPPPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 604 stabilizing places and 604 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1 U G(p2))))))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 428 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:41:11] [INFO ] Computed 551 place invariants in 13 ms
[2023-03-22 03:41:12] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2023-03-22 03:41:12] [INFO ] Invariant cache hit.
[2023-03-22 03:41:16] [INFO ] Implicit Places using invariants and state equation in 4191 ms returned []
Implicit Place search using SMT with State Equation took 5632 ms to find 0 implicit places.
[2023-03-22 03:41:16] [INFO ] Invariant cache hit.
[2023-03-22 03:41:18] [INFO ] Dead Transitions using invariants and state equation in 1858 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7919 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2081 1), p2:(AND (EQ s1941 1) (EQ s1971 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 16746 steps with 3 reset in 276 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-00 finished in 8519 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((X(p0)||(p1&&X(p1))))&&X(G(p2))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3054 transition count 2804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3054 transition count 2804
Applied a total of 12 rules in 427 ms. Remains 3054 /3060 variables (removed 6) and now considering 2804/2810 (removed 6) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-22 03:41:19] [INFO ] Computed 551 place invariants in 28 ms
[2023-03-22 03:41:20] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2023-03-22 03:41:20] [INFO ] Invariant cache hit.
[2023-03-22 03:41:25] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 5437 ms to find 0 implicit places.
[2023-03-22 03:41:25] [INFO ] Invariant cache hit.
[2023-03-22 03:41:27] [INFO ] Dead Transitions using invariants and state equation in 2827 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3060 places, 2804/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8696 ms. Remains : 3054/3060 places, 2804/2810 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(OR (EQ s364 0) (EQ s394 0)), p0:(EQ s813 1), p1:(EQ s1058 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6364 steps with 0 reset in 64 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-01 finished in 9042 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 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3059 transition count 2458
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 2 with 8 rules applied. Total rules applied 1218 place count 2450 transition count 2200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1218 place count 2450 transition count 2196
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1226 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3010 place count 1554 transition count 1304
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 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 727 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-22 03:41:28] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-22 03:41:29] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-22 03:41:29] [INFO ] Invariant cache hit.
[2023-03-22 03:41:31] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
[2023-03-22 03:41:31] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 03:41:31] [INFO ] Invariant cache hit.
[2023-03-22 03:41:32] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3060 places, 1302/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4175 ms. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1344 0) (EQ s1357 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 180 reset in 1049 ms.
Product exploration explored 100000 steps with 185 reset in 1332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3649 steps, including 1 resets, run visited all 1 properties in 37 ms. (steps per millisecond=98 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 95 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-22 03:41:35] [INFO ] Invariant cache hit.
[2023-03-22 03:41:36] [INFO ] Implicit Places using invariants in 822 ms returned []
[2023-03-22 03:41:36] [INFO ] Invariant cache hit.
[2023-03-22 03:41:38] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2919 ms to find 0 implicit places.
[2023-03-22 03:41:38] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 03:41:38] [INFO ] Invariant cache hit.
[2023-03-22 03:41:39] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3937 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 223 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 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 369 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=28 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 200 reset in 874 ms.
Product exploration explored 100000 steps with 189 reset in 1122 ms.
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 53 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-22 03:41:42] [INFO ] Invariant cache hit.
[2023-03-22 03:41:43] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-22 03:41:43] [INFO ] Invariant cache hit.
[2023-03-22 03:41:45] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
[2023-03-22 03:41:45] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 03:41:45] [INFO ] Invariant cache hit.
[2023-03-22 03:41:46] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3639 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-02 finished in 18300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U ((p1 U p2)||G(p3)))))))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 467 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-22 03:41:46] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-22 03:41:48] [INFO ] Implicit Places using invariants in 1196 ms returned []
[2023-03-22 03:41:48] [INFO ] Invariant cache hit.
[2023-03-22 03:41:52] [INFO ] Implicit Places using invariants and state equation in 4476 ms returned []
Implicit Place search using SMT with State Equation took 5702 ms to find 0 implicit places.
[2023-03-22 03:41:52] [INFO ] Invariant cache hit.
[2023-03-22 03:41:54] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8305 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(NEQ s350 1), p1:(EQ s2750 1), p0:(AND (EQ s2948 1) (EQ s2950 1)), p3:(NEQ s1303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 84310 steps with 10 reset in 883 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-03 finished in 9612 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((X(p0)||(p0 U p1)))))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3054 transition count 2804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3054 transition count 2804
Applied a total of 12 rules in 430 ms. Remains 3054 /3060 variables (removed 6) and now considering 2804/2810 (removed 6) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-22 03:41:56] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 03:41:57] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2023-03-22 03:41:57] [INFO ] Invariant cache hit.
[2023-03-22 03:42:02] [INFO ] Implicit Places using invariants and state equation in 4688 ms returned []
Implicit Place search using SMT with State Equation took 5904 ms to find 0 implicit places.
[2023-03-22 03:42:02] [INFO ] Invariant cache hit.
[2023-03-22 03:42:04] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3060 places, 2804/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8303 ms. Remains : 3054/3060 places, 2804/2810 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s2514 1), p1:(OR (EQ s2012 1) (EQ s2324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-04 finished in 8553 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 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3059 transition count 2457
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2707 transition count 2457
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2707 transition count 2207
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2457 transition count 2207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1212 place count 2449 transition count 2199
Iterating global reduction 2 with 8 rules applied. Total rules applied 1220 place count 2449 transition count 2199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1220 place count 2449 transition count 2195
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1228 place count 2445 transition count 2195
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 1 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3012 place count 1553 transition count 1303
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 3014 place count 1551 transition count 1301
Applied a total of 3014 rules in 570 ms. Remains 1551 /3060 variables (removed 1509) and now considering 1301/2810 (removed 1509) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:42:05] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-22 03:42:06] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-22 03:42:06] [INFO ] Invariant cache hit.
[2023-03-22 03:42:08] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2023-03-22 03:42:08] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 03:42:08] [INFO ] Invariant cache hit.
[2023-03-22 03:42:08] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3060 places, 1301/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4337 ms. Remains : 1551/3060 places, 1301/2810 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-05 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:(OR (EQ s192 0) (EQ s209 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32 reset in 1062 ms.
Product exploration explored 100000 steps with 31 reset in 1193 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 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 99 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 149816 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149816 steps, saw 120529 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:42:14] [INFO ] Invariant cache hit.
[2023-03-22 03:42:15] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:42:15] [INFO ] [Nat]Absence check using 551 positive place invariants in 109 ms returned sat
[2023-03-22 03:42:15] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:42:16] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2023-03-22 03:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-22 03:42:16] [INFO ] After 903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 03:42:16] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 417 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 98 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:42:16] [INFO ] Invariant cache hit.
[2023-03-22 03:42:17] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-22 03:42:17] [INFO ] Invariant cache hit.
[2023-03-22 03:42:19] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2023-03-22 03:42:19] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 03:42:19] [INFO ] Invariant cache hit.
[2023-03-22 03:42:20] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4137 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5963 steps, including 1 resets, run visited all 1 properties in 76 ms. (steps per millisecond=78 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 203 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 31 reset in 1182 ms.
Product exploration explored 100000 steps with 31 reset in 1356 ms.
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 62 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:42:24] [INFO ] Invariant cache hit.
[2023-03-22 03:42:25] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-22 03:42:25] [INFO ] Invariant cache hit.
[2023-03-22 03:42:27] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2802 ms to find 0 implicit places.
[2023-03-22 03:42:27] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-22 03:42:27] [INFO ] Invariant cache hit.
[2023-03-22 03:42:27] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3630 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-05 finished in 23301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3059 transition count 2459
Reduce places removed 350 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 2709 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 9 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 3 with 8 rules applied. Total rules applied 1218 place count 2450 transition count 2200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1218 place count 2450 transition count 2196
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1226 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 3010 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 679 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-22 03:42:28] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-22 03:42:29] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-22 03:42:29] [INFO ] Invariant cache hit.
[2023-03-22 03:42:31] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2743 ms to find 0 implicit places.
[2023-03-22 03:42:31] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 03:42:31] [INFO ] Invariant cache hit.
[2023-03-22 03:42:32] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3060 places, 1302/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4291 ms. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s538 1) (EQ s551 1)) (AND (EQ s659 1) (EQ s661 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3199 steps with 0 reset in 33 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-06 finished in 4392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 415 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-22 03:42:32] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-22 03:42:34] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2023-03-22 03:42:34] [INFO ] Invariant cache hit.
[2023-03-22 03:42:38] [INFO ] Implicit Places using invariants and state equation in 4021 ms returned []
Implicit Place search using SMT with State Equation took 5258 ms to find 0 implicit places.
[2023-03-22 03:42:38] [INFO ] Invariant cache hit.
[2023-03-22 03:42:40] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7968 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1018 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1244 steps with 0 reset in 21 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-07 finished in 8142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 413 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-22 03:42:40] [INFO ] Invariant cache hit.
[2023-03-22 03:42:42] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-22 03:42:42] [INFO ] Invariant cache hit.
[2023-03-22 03:42:46] [INFO ] Implicit Places using invariants and state equation in 3951 ms returned []
Implicit Place search using SMT with State Equation took 5136 ms to find 0 implicit places.
[2023-03-22 03:42:46] [INFO ] Invariant cache hit.
[2023-03-22 03:42:48] [INFO ] Dead Transitions using invariants and state equation in 2081 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7633 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (EQ s2594 0) (EQ s2609 0)) (EQ s1770 0)), p0:(OR (EQ s189 0) (EQ s221 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1902 ms.
Product exploration explored 100000 steps with 50000 reset in 1855 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-09 finished in 11905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||((p1 U (p2||G(p3)))&&X(X(F(p2))))))'
Support contains 7 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 445 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-22 03:42:52] [INFO ] Invariant cache hit.
[2023-03-22 03:42:53] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2023-03-22 03:42:53] [INFO ] Invariant cache hit.
[2023-03-22 03:42:58] [INFO ] Implicit Places using invariants and state equation in 4413 ms returned []
Implicit Place search using SMT with State Equation took 5476 ms to find 0 implicit places.
[2023-03-22 03:42:58] [INFO ] Invariant cache hit.
[2023-03-22 03:43:00] [INFO ] Dead Transitions using invariants and state equation in 2210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8133 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s1218 1) (EQ s1298 1)), p3:(NEQ s199 1), p1:(AND (EQ s2884 1) (EQ s2914 1)), p0:(AND (EQ s2227 1) (EQ s2251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19423 steps with 3 reset in 240 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-10 finished in 8894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 440 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-22 03:43:01] [INFO ] Invariant cache hit.
[2023-03-22 03:43:03] [INFO ] Implicit Places using invariants in 1520 ms returned []
[2023-03-22 03:43:03] [INFO ] Invariant cache hit.
[2023-03-22 03:43:07] [INFO ] Implicit Places using invariants and state equation in 4705 ms returned []
Implicit Place search using SMT with State Equation took 6235 ms to find 0 implicit places.
[2023-03-22 03:43:07] [INFO ] Invariant cache hit.
[2023-03-22 03:43:10] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8850 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1149 1) (EQ s1181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13608 steps with 1 reset in 135 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-11 finished in 9171 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((F(p1)&&F(p2)&&p0)))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3059 transition count 2459
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2709 transition count 2459
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 700 place count 2709 transition count 2209
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1200 place count 2459 transition count 2209
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1208 place count 2451 transition count 2201
Iterating global reduction 2 with 8 rules applied. Total rules applied 1216 place count 2451 transition count 2201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1216 place count 2451 transition count 2197
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1224 place count 2447 transition count 2197
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 2 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 2 with 1782 rules applied. Total rules applied 3006 place count 1556 transition count 1306
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 3008 place count 1554 transition count 1304
Applied a total of 3008 rules in 703 ms. Remains 1554 /3060 variables (removed 1506) and now considering 1304/2810 (removed 1506) transitions.
// Phase 1: matrix 1304 rows 1554 cols
[2023-03-22 03:43:11] [INFO ] Computed 551 place invariants in 2 ms
[2023-03-22 03:43:12] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-22 03:43:12] [INFO ] Invariant cache hit.
[2023-03-22 03:43:14] [INFO ] Implicit Places using invariants and state equation in 2276 ms returned []
Implicit Place search using SMT with State Equation took 3166 ms to find 0 implicit places.
[2023-03-22 03:43:14] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 03:43:14] [INFO ] Invariant cache hit.
[2023-03-22 03:43:15] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1554/3060 places, 1304/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4637 ms. Remains : 1554/3060 places, 1304/2810 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s65 1)), p1:(EQ s1214 1), p2:(AND (EQ s47 1) (EQ s65 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3450 steps with 0 reset in 34 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-12 finished in 4825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(F(p1)))||(p2&&X((p2 U (!p0||G(p2)))))||G(F(p1))))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 481 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:43:15] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-22 03:43:17] [INFO ] Implicit Places using invariants in 1429 ms returned []
[2023-03-22 03:43:17] [INFO ] Invariant cache hit.
[2023-03-22 03:43:21] [INFO ] Implicit Places using invariants and state equation in 4520 ms returned []
Implicit Place search using SMT with State Equation took 5977 ms to find 0 implicit places.
[2023-03-22 03:43:21] [INFO ] Invariant cache hit.
[2023-03-22 03:43:23] [INFO ] Dead Transitions using invariants and state equation in 2155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8615 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2116 1) (EQ s2150 1)), p2:(NEQ s2734 1), p1:(NEQ s2781 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1238 ms.
Product exploration explored 100000 steps with 33333 reset in 1164 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 13 factoid took 533 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-13 finished in 11837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||G(p2)||p0))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 530 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-22 03:43:27] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-22 03:43:28] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2023-03-22 03:43:28] [INFO ] Invariant cache hit.
[2023-03-22 03:43:33] [INFO ] Implicit Places using invariants and state equation in 4723 ms returned []
Implicit Place search using SMT with State Equation took 6067 ms to find 0 implicit places.
[2023-03-22 03:43:33] [INFO ] Invariant cache hit.
[2023-03-22 03:43:36] [INFO ] Dead Transitions using invariants and state equation in 2297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8897 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s704 1), p0:(OR (NEQ s1576 1) (NEQ s1610 1)), p2:(EQ s1618 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1655 ms.
Product exploration explored 100000 steps with 50000 reset in 1711 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3052 stabilizing places and 599/2802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0 (NOT p2))
Knowledge based reduction with 11 factoid took 611 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-14 finished in 13016 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||G(!p1)) U X((p2||F(p3)))))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 470 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:43:40] [INFO ] Computed 551 place invariants in 34 ms
[2023-03-22 03:43:41] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2023-03-22 03:43:41] [INFO ] Invariant cache hit.
[2023-03-22 03:43:45] [INFO ] Implicit Places using invariants and state equation in 3870 ms returned []
Implicit Place search using SMT with State Equation took 5004 ms to find 0 implicit places.
[2023-03-22 03:43:45] [INFO ] Invariant cache hit.
[2023-03-22 03:43:47] [INFO ] Dead Transitions using invariants and state equation in 2222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7701 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s2008 1), p1:(OR (EQ s2159 1) (AND (EQ s2830 1) (EQ s2862 1))), p2:(NEQ s2756 1), p3:(EQ s2159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1689 ms.
Product exploration explored 100000 steps with 50000 reset in 1686 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3053 stabilizing places and 599/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3))))
Knowledge based reduction with 18 factoid took 456 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-15 finished in 11882 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)))'
[2023-03-22 03:43:52] [INFO ] Flatten gal took : 177 ms
[2023-03-22 03:43:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 03:43:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3060 places, 2810 transitions and 8020 arcs took 30 ms.
Total runtime 256951 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1761/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1761/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-050B-LTLFireability-02
Could not compute solution for formula : ShieldPPPs-PT-050B-LTLFireability-05

BK_STOP 1679456636709

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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 ShieldPPPs-PT-050B-LTLFireability-02
ltl formula formula --ltl=/tmp/1761/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 3060 places, 2810 transitions and 8020 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.190 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1761/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1761/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1761/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1761/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 ShieldPPPs-PT-050B-LTLFireability-05
ltl formula formula --ltl=/tmp/1761/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 3060 places, 2810 transitions and 8020 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.240 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1761/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1761/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1761/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1761/ltl_1_
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)

Sequence of Actions to be Executed by the VM

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

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

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