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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16: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:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 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 708K 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-040B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679454674457

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-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:11:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 03:11:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:11:16] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2023-03-22 03:11:16] [INFO ] Transformed 2723 places.
[2023-03-22 03:11:16] [INFO ] Transformed 2523 transitions.
[2023-03-22 03:11:16] [INFO ] Found NUPN structural information;
[2023-03-22 03:11:16] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-040B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 272 place count 2451 transition count 2251
Iterating global reduction 0 with 272 rules applied. Total rules applied 544 place count 2451 transition count 2251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 545 place count 2450 transition count 2250
Iterating global reduction 0 with 1 rules applied. Total rules applied 546 place count 2450 transition count 2250
Applied a total of 546 rules in 1081 ms. Remains 2450 /2723 variables (removed 273) and now considering 2250/2523 (removed 273) transitions.
// Phase 1: matrix 2250 rows 2450 cols
[2023-03-22 03:11:18] [INFO ] Computed 441 place invariants in 53 ms
[2023-03-22 03:11:19] [INFO ] Implicit Places using invariants in 1534 ms returned []
[2023-03-22 03:11:19] [INFO ] Invariant cache hit.
[2023-03-22 03:11:22] [INFO ] Implicit Places using invariants and state equation in 3176 ms returned []
Implicit Place search using SMT with State Equation took 4748 ms to find 0 implicit places.
[2023-03-22 03:11:22] [INFO ] Invariant cache hit.
[2023-03-22 03:11:24] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2450/2723 places, 2250/2523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7671 ms. Remains : 2450/2723 places, 2250/2523 transitions.
Support contains 39 out of 2450 places after structural reductions.
[2023-03-22 03:11:25] [INFO ] Flatten gal took : 182 ms
[2023-03-22 03:11:25] [INFO ] Flatten gal took : 115 ms
[2023-03-22 03:11:25] [INFO ] Input system was already deterministic with 2250 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-22 03:11:26] [INFO ] Invariant cache hit.
[2023-03-22 03:11:27] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 03:11:28] [INFO ] [Nat]Absence check using 441 positive place invariants in 212 ms returned sat
[2023-03-22 03:11:30] [INFO ] After 1909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 03:11:31] [INFO ] Deduced a trap composed of 20 places in 769 ms of which 11 ms to minimize.
[2023-03-22 03:11:32] [INFO ] Deduced a trap composed of 18 places in 606 ms of which 2 ms to minimize.
[2023-03-22 03:11:32] [INFO ] Deduced a trap composed of 18 places in 572 ms of which 2 ms to minimize.
[2023-03-22 03:11:33] [INFO ] Deduced a trap composed of 27 places in 539 ms of which 2 ms to minimize.
[2023-03-22 03:11:33] [INFO ] Deduced a trap composed of 30 places in 534 ms of which 1 ms to minimize.
[2023-03-22 03:11:34] [INFO ] Deduced a trap composed of 36 places in 610 ms of which 1 ms to minimize.
[2023-03-22 03:11:35] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 2 ms to minimize.
[2023-03-22 03:11:35] [INFO ] Deduced a trap composed of 28 places in 621 ms of which 2 ms to minimize.
[2023-03-22 03:11:36] [INFO ] Deduced a trap composed of 18 places in 623 ms of which 1 ms to minimize.
[2023-03-22 03:11:37] [INFO ] Deduced a trap composed of 26 places in 626 ms of which 1 ms to minimize.
[2023-03-22 03:11:37] [INFO ] Deduced a trap composed of 25 places in 571 ms of which 2 ms to minimize.
[2023-03-22 03:11:38] [INFO ] Deduced a trap composed of 28 places in 608 ms of which 2 ms to minimize.
[2023-03-22 03:11:39] [INFO ] Deduced a trap composed of 23 places in 680 ms of which 2 ms to minimize.
[2023-03-22 03:11:40] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 2 ms to minimize.
[2023-03-22 03:11:40] [INFO ] Deduced a trap composed of 48 places in 507 ms of which 1 ms to minimize.
[2023-03-22 03:11:41] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 1 ms to minimize.
[2023-03-22 03:11:41] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 2 ms to minimize.
[2023-03-22 03:11:42] [INFO ] Deduced a trap composed of 43 places in 503 ms of which 1 ms to minimize.
[2023-03-22 03:11:42] [INFO ] Deduced a trap composed of 40 places in 413 ms of which 1 ms to minimize.
[2023-03-22 03:11:43] [INFO ] Deduced a trap composed of 45 places in 411 ms of which 14 ms to minimize.
[2023-03-22 03:11:43] [INFO ] Deduced a trap composed of 28 places in 434 ms of which 1 ms to minimize.
[2023-03-22 03:11:44] [INFO ] Deduced a trap composed of 36 places in 452 ms of which 1 ms to minimize.
[2023-03-22 03:11:45] [INFO ] Deduced a trap composed of 41 places in 465 ms of which 1 ms to minimize.
[2023-03-22 03:11:45] [INFO ] Deduced a trap composed of 36 places in 479 ms of which 1 ms to minimize.
[2023-03-22 03:11:46] [INFO ] Deduced a trap composed of 30 places in 442 ms of which 1 ms to minimize.
[2023-03-22 03:11:46] [INFO ] Deduced a trap composed of 26 places in 417 ms of which 1 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 1 ms to minimize.
[2023-03-22 03:11:47] [INFO ] Deduced a trap composed of 31 places in 568 ms of which 1 ms to minimize.
[2023-03-22 03:11:48] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 1 ms to minimize.
[2023-03-22 03:11:48] [INFO ] Deduced a trap composed of 44 places in 444 ms of which 1 ms to minimize.
[2023-03-22 03:11:49] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 1 ms to minimize.
[2023-03-22 03:11:49] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 1 ms to minimize.
[2023-03-22 03:11:50] [INFO ] Deduced a trap composed of 67 places in 418 ms of which 1 ms to minimize.
[2023-03-22 03:11:50] [INFO ] Deduced a trap composed of 41 places in 459 ms of which 4 ms to minimize.
[2023-03-22 03:11:51] [INFO ] Deduced a trap composed of 43 places in 455 ms of which 1 ms to minimize.
[2023-03-22 03:11:51] [INFO ] Deduced a trap composed of 50 places in 378 ms of which 2 ms to minimize.
[2023-03-22 03:11:52] [INFO ] Deduced a trap composed of 42 places in 540 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:11:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:11:52] [INFO ] After 25135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 812 ms.
Support contains 17 out of 2450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 2450 transition count 1973
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 2173 transition count 1973
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 554 place count 2173 transition count 1771
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 958 place count 1971 transition count 1771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 964 place count 1965 transition count 1765
Iterating global reduction 2 with 6 rules applied. Total rules applied 970 place count 1965 transition count 1765
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 970 place count 1965 transition count 1762
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 976 place count 1962 transition count 1762
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 2 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2392 place count 1254 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 351 times.
Drop transitions removed 351 transitions
Iterating global reduction 2 with 351 rules applied. Total rules applied 2743 place count 1254 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2744 place count 1253 transition count 1053
Applied a total of 2744 rules in 558 ms. Remains 1253 /2450 variables (removed 1197) and now considering 1053/2250 (removed 1197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 1253/2450 places, 1053/2250 transitions.
Finished random walk after 3324 steps, including 0 resets, run visited all 9 properties in 85 ms. (steps per millisecond=39 )
FORMULA ShieldPPPs-PT-040B-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 486 stabilizing places and 486 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' '!((F((p0||(p1 U p2)))||(X(G(p3))&&G(p1))))'
Support contains 4 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2445 transition count 2245
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2445 transition count 2245
Applied a total of 10 rules in 225 ms. Remains 2445 /2450 variables (removed 5) and now considering 2245/2250 (removed 5) transitions.
// Phase 1: matrix 2245 rows 2445 cols
[2023-03-22 03:11:54] [INFO ] Computed 441 place invariants in 24 ms
[2023-03-22 03:11:55] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2023-03-22 03:11:55] [INFO ] Invariant cache hit.
[2023-03-22 03:11:58] [INFO ] Implicit Places using invariants and state equation in 2769 ms returned []
Implicit Place search using SMT with State Equation took 3806 ms to find 0 implicit places.
[2023-03-22 03:11:58] [INFO ] Invariant cache hit.
[2023-03-22 03:11:59] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2445/2450 places, 2245/2250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5402 ms. Remains : 2445/2450 places, 2245/2250 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1705 1), p2:(EQ s1847 1), p1:(EQ s454 1), p3:(EQ s1697 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]]
Product exploration explored 100000 steps with 843 reset in 516 ms.
Product exploration explored 100000 steps with 831 reset in 453 ms.
Computed a total of 482 stabilizing places and 482 stable transitions
Computed a total of 482 stabilizing places and 482 stable transitions
Detected a total of 482/2445 stabilizing places and 482/2245 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 623 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 144 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 524 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-22 03:12:02] [INFO ] Invariant cache hit.
[2023-03-22 03:12:04] [INFO ] [Real]Absence check using 441 positive place invariants in 724 ms returned sat
[2023-03-22 03:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:12:17] [INFO ] [Real]Absence check using state equation in 12736 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 2445 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2445/2445 places, 2245/2245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2444 transition count 1964
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2164 transition count 1964
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 560 place count 2164 transition count 1765
Deduced a syphon composed of 199 places in 8 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 958 place count 1965 transition count 1765
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2390 place count 1249 transition count 1049
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 2392 place count 1247 transition count 1047
Applied a total of 2392 rules in 466 ms. Remains 1247 /2445 variables (removed 1198) and now considering 1047/2245 (removed 1198) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2023-03-22 03:12:17] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-22 03:12:18] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-22 03:12:18] [INFO ] Invariant cache hit.
[2023-03-22 03:12:19] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
[2023-03-22 03:12:20] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-22 03:12:20] [INFO ] Invariant cache hit.
[2023-03-22 03:12:20] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/2445 places, 1047/2245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3323 ms. Remains : 1247/2445 places, 1047/2245 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1247 stabilizing places and 6/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-22 03:12:21] [INFO ] Invariant cache hit.
[2023-03-22 03:12:22] [INFO ] [Real]Absence check using 441 positive place invariants in 239 ms returned sat
[2023-03-22 03:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:12:26] [INFO ] [Real]Absence check using state equation in 3765 ms returned sat
[2023-03-22 03:12:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:12:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 252 ms returned sat
[2023-03-22 03:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:12:29] [INFO ] [Nat]Absence check using state equation in 2591 ms returned sat
[2023-03-22 03:12:30] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2023-03-22 03:12:30] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-22 03:12:30] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 21 ms to minimize.
[2023-03-22 03:12:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-22 03:12:30] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 9 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 3 ms to minimize.
[2023-03-22 03:12:31] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2023-03-22 03:12:32] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-03-22 03:12:32] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2023-03-22 03:12:32] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 13 ms to minimize.
[2023-03-22 03:12:32] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-22 03:12:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2717 ms
[2023-03-22 03:12:32] [INFO ] Computed and/alt/rep : 1042/2037/1042 causal constraints (skipped 0 transitions) in 86 ms.
[2023-03-22 03:12:41] [INFO ] Added : 365 causal constraints over 73 iterations in 8583 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28279 reset in 1210 ms.
Product exploration explored 100000 steps with 28253 reset in 1330 ms.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 1045
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1244 transition count 1044
Applied a total of 3 rules in 112 ms. Remains 1244 /1247 variables (removed 3) and now considering 1044/1047 (removed 3) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2023-03-22 03:12:44] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-22 03:12:44] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-22 03:12:44] [INFO ] Invariant cache hit.
[2023-03-22 03:12:46] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2023-03-22 03:12:46] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-22 03:12:46] [INFO ] Invariant cache hit.
[2023-03-22 03:12:46] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/1247 places, 1044/1047 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3097 ms. Remains : 1244/1247 places, 1044/1047 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-00 finished in 53060 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||X(X(X(p1))))))))'
Support contains 6 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2442 transition count 2242
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2442 transition count 2242
Applied a total of 16 rules in 269 ms. Remains 2442 /2450 variables (removed 8) and now considering 2242/2250 (removed 8) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2023-03-22 03:12:47] [INFO ] Computed 441 place invariants in 10 ms
[2023-03-22 03:12:48] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2023-03-22 03:12:48] [INFO ] Invariant cache hit.
[2023-03-22 03:12:50] [INFO ] Implicit Places using invariants and state equation in 2330 ms returned []
Implicit Place search using SMT with State Equation took 3508 ms to find 0 implicit places.
[2023-03-22 03:12:50] [INFO ] Invariant cache hit.
[2023-03-22 03:12:52] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2450 places, 2242/2250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5139 ms. Remains : 2442/2450 places, 2242/2250 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s598 0) (EQ s600 0)) (OR (EQ s2353 0) (EQ s2370 0))), p1:(OR (EQ s895 0) (EQ s1269 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 81 reset in 703 ms.
Product exploration explored 100000 steps with 58 reset in 1147 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:12:55] [INFO ] Invariant cache hit.
[2023-03-22 03:12:55] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:12:55] [INFO ] [Nat]Absence check using 441 positive place invariants in 160 ms returned sat
[2023-03-22 03:12:57] [INFO ] After 1134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:12:57] [INFO ] Deduced a trap composed of 30 places in 488 ms of which 1 ms to minimize.
[2023-03-22 03:12:58] [INFO ] Deduced a trap composed of 38 places in 504 ms of which 2 ms to minimize.
[2023-03-22 03:12:58] [INFO ] Deduced a trap composed of 26 places in 578 ms of which 1 ms to minimize.
[2023-03-22 03:12:59] [INFO ] Deduced a trap composed of 12 places in 627 ms of which 25 ms to minimize.
[2023-03-22 03:13:00] [INFO ] Deduced a trap composed of 29 places in 560 ms of which 2 ms to minimize.
[2023-03-22 03:13:00] [INFO ] Deduced a trap composed of 34 places in 470 ms of which 1 ms to minimize.
[2023-03-22 03:13:01] [INFO ] Deduced a trap composed of 20 places in 463 ms of which 1 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 20 places in 570 ms of which 1 ms to minimize.
[2023-03-22 03:13:02] [INFO ] Deduced a trap composed of 33 places in 606 ms of which 1 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 1 ms to minimize.
[2023-03-22 03:13:03] [INFO ] Deduced a trap composed of 40 places in 455 ms of which 1 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 34 places in 419 ms of which 1 ms to minimize.
[2023-03-22 03:13:04] [INFO ] Deduced a trap composed of 28 places in 542 ms of which 1 ms to minimize.
[2023-03-22 03:13:05] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 17 ms to minimize.
[2023-03-22 03:13:06] [INFO ] Deduced a trap composed of 29 places in 599 ms of which 2 ms to minimize.
[2023-03-22 03:13:06] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 13 ms to minimize.
[2023-03-22 03:13:07] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2023-03-22 03:13:07] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 14 ms to minimize.
[2023-03-22 03:13:08] [INFO ] Deduced a trap composed of 36 places in 526 ms of which 1 ms to minimize.
[2023-03-22 03:13:08] [INFO ] Deduced a trap composed of 38 places in 450 ms of which 1 ms to minimize.
[2023-03-22 03:13:09] [INFO ] Deduced a trap composed of 16 places in 398 ms of which 1 ms to minimize.
[2023-03-22 03:13:09] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 1 ms to minimize.
[2023-03-22 03:13:10] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 1 ms to minimize.
[2023-03-22 03:13:10] [INFO ] Deduced a trap composed of 38 places in 445 ms of which 1 ms to minimize.
[2023-03-22 03:13:11] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 1 ms to minimize.
[2023-03-22 03:13:11] [INFO ] Deduced a trap composed of 32 places in 447 ms of which 1 ms to minimize.
[2023-03-22 03:13:12] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 1 ms to minimize.
[2023-03-22 03:13:12] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 1 ms to minimize.
[2023-03-22 03:13:13] [INFO ] Deduced a trap composed of 49 places in 425 ms of which 1 ms to minimize.
[2023-03-22 03:13:13] [INFO ] Deduced a trap composed of 52 places in 414 ms of which 12 ms to minimize.
[2023-03-22 03:13:14] [INFO ] Deduced a trap composed of 18 places in 395 ms of which 1 ms to minimize.
[2023-03-22 03:13:14] [INFO ] Deduced a trap composed of 20 places in 473 ms of which 1 ms to minimize.
[2023-03-22 03:13:15] [INFO ] Deduced a trap composed of 42 places in 409 ms of which 1 ms to minimize.
[2023-03-22 03:13:15] [INFO ] Deduced a trap composed of 37 places in 411 ms of which 1 ms to minimize.
[2023-03-22 03:13:16] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 1 ms to minimize.
[2023-03-22 03:13:16] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 1 ms to minimize.
[2023-03-22 03:13:17] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 1 ms to minimize.
[2023-03-22 03:13:17] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 0 ms to minimize.
[2023-03-22 03:13:17] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 1 ms to minimize.
[2023-03-22 03:13:18] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 1 ms to minimize.
[2023-03-22 03:13:18] [INFO ] Deduced a trap composed of 50 places in 462 ms of which 1 ms to minimize.
[2023-03-22 03:13:19] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 1 ms to minimize.
[2023-03-22 03:13:19] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 1 ms to minimize.
[2023-03-22 03:13:20] [INFO ] Deduced a trap composed of 40 places in 398 ms of which 0 ms to minimize.
[2023-03-22 03:13:20] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:13:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:13:20] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2442 transition count 1962
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 560 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 960 place count 1962 transition count 1762
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2398 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 355 times.
Drop transitions removed 355 transitions
Iterating global reduction 2 with 355 rules applied. Total rules applied 2753 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2754 place count 1242 transition count 1042
Applied a total of 2754 rules in 373 ms. Remains 1242 /2442 variables (removed 1200) and now considering 1042/2242 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 1242/2442 places, 1042/2242 transitions.
Finished random walk after 2484 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 285 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 129 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
[2023-03-22 03:13:22] [INFO ] Invariant cache hit.
[2023-03-22 03:13:23] [INFO ] Implicit Places using invariants in 862 ms returned []
[2023-03-22 03:13:23] [INFO ] Invariant cache hit.
[2023-03-22 03:13:25] [INFO ] Implicit Places using invariants and state equation in 2802 ms returned []
Implicit Place search using SMT with State Equation took 3683 ms to find 0 implicit places.
[2023-03-22 03:13:25] [INFO ] Invariant cache hit.
[2023-03-22 03:13:27] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5152 ms. Remains : 2442/2442 places, 2242/2242 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:13:27] [INFO ] Invariant cache hit.
[2023-03-22 03:13:28] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:13:28] [INFO ] [Nat]Absence check using 441 positive place invariants in 163 ms returned sat
[2023-03-22 03:13:29] [INFO ] After 1348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:13:30] [INFO ] Deduced a trap composed of 30 places in 720 ms of which 1 ms to minimize.
[2023-03-22 03:13:31] [INFO ] Deduced a trap composed of 38 places in 528 ms of which 2 ms to minimize.
[2023-03-22 03:13:31] [INFO ] Deduced a trap composed of 26 places in 510 ms of which 1 ms to minimize.
[2023-03-22 03:13:32] [INFO ] Deduced a trap composed of 12 places in 471 ms of which 1 ms to minimize.
[2023-03-22 03:13:32] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 2 ms to minimize.
[2023-03-22 03:13:33] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 1 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 1 ms to minimize.
[2023-03-22 03:13:34] [INFO ] Deduced a trap composed of 20 places in 529 ms of which 2 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 1 ms to minimize.
[2023-03-22 03:13:35] [INFO ] Deduced a trap composed of 29 places in 408 ms of which 1 ms to minimize.
[2023-03-22 03:13:36] [INFO ] Deduced a trap composed of 40 places in 468 ms of which 1 ms to minimize.
[2023-03-22 03:13:36] [INFO ] Deduced a trap composed of 34 places in 555 ms of which 1 ms to minimize.
[2023-03-22 03:13:37] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 1 ms to minimize.
[2023-03-22 03:13:37] [INFO ] Deduced a trap composed of 26 places in 501 ms of which 1 ms to minimize.
[2023-03-22 03:13:38] [INFO ] Deduced a trap composed of 29 places in 463 ms of which 1 ms to minimize.
[2023-03-22 03:13:39] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 1 ms to minimize.
[2023-03-22 03:13:39] [INFO ] Deduced a trap composed of 25 places in 451 ms of which 1 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 26 places in 518 ms of which 2 ms to minimize.
[2023-03-22 03:13:40] [INFO ] Deduced a trap composed of 36 places in 520 ms of which 1 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 38 places in 440 ms of which 1 ms to minimize.
[2023-03-22 03:13:41] [INFO ] Deduced a trap composed of 16 places in 477 ms of which 1 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 1 ms to minimize.
[2023-03-22 03:13:42] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 1 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 38 places in 452 ms of which 1 ms to minimize.
[2023-03-22 03:13:43] [INFO ] Deduced a trap composed of 35 places in 433 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 32 places in 390 ms of which 1 ms to minimize.
[2023-03-22 03:13:44] [INFO ] Deduced a trap composed of 34 places in 382 ms of which 1 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 1 ms to minimize.
[2023-03-22 03:13:45] [INFO ] Deduced a trap composed of 49 places in 407 ms of which 1 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 52 places in 406 ms of which 1 ms to minimize.
[2023-03-22 03:13:46] [INFO ] Deduced a trap composed of 18 places in 417 ms of which 1 ms to minimize.
[2023-03-22 03:13:47] [INFO ] Deduced a trap composed of 20 places in 357 ms of which 1 ms to minimize.
[2023-03-22 03:13:47] [INFO ] Deduced a trap composed of 42 places in 506 ms of which 1 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 37 places in 379 ms of which 1 ms to minimize.
[2023-03-22 03:13:48] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2023-03-22 03:13:49] [INFO ] Deduced a trap composed of 37 places in 351 ms of which 0 ms to minimize.
[2023-03-22 03:13:49] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 1 ms to minimize.
[2023-03-22 03:13:49] [INFO ] Deduced a trap composed of 50 places in 335 ms of which 1 ms to minimize.
[2023-03-22 03:13:50] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 1 ms to minimize.
[2023-03-22 03:13:51] [INFO ] Deduced a trap composed of 32 places in 781 ms of which 1 ms to minimize.
[2023-03-22 03:13:51] [INFO ] Deduced a trap composed of 50 places in 350 ms of which 1 ms to minimize.
[2023-03-22 03:13:51] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 0 ms to minimize.
[2023-03-22 03:13:52] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 1 ms to minimize.
[2023-03-22 03:13:52] [INFO ] Deduced a trap composed of 40 places in 326 ms of which 1 ms to minimize.
[2023-03-22 03:13:53] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 1 ms to minimize.
[2023-03-22 03:13:54] [INFO ] Deduced a trap composed of 12 places in 1256 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:13:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:13:54] [INFO ] After 26274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2442 transition count 1962
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 560 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 7 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 960 place count 1962 transition count 1762
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2398 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 355 times.
Drop transitions removed 355 transitions
Iterating global reduction 2 with 355 rules applied. Total rules applied 2753 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2754 place count 1242 transition count 1042
Applied a total of 2754 rules in 408 ms. Remains 1242 /2442 variables (removed 1200) and now considering 1042/2242 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 1242/2442 places, 1042/2242 transitions.
Finished random walk after 2103 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 85 reset in 745 ms.
Product exploration explored 100000 steps with 96 reset in 836 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2442 transition count 2242
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 279 place count 2442 transition count 2243
Deduced a syphon composed of 360 places in 5 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 360 place count 2442 transition count 2243
Performed 838 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1198 places in 2 ms
Iterating global reduction 1 with 838 rules applied. Total rules applied 1198 place count 2442 transition count 2243
Renaming transitions due to excessive name length > 1024 char.
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 1480 place count 2160 transition count 1961
Deduced a syphon composed of 916 places in 2 ms
Iterating global reduction 1 with 282 rules applied. Total rules applied 1762 place count 2160 transition count 1961
Deduced a syphon composed of 916 places in 3 ms
Applied a total of 1762 rules in 881 ms. Remains 2160 /2442 variables (removed 282) and now considering 1961/2242 (removed 281) transitions.
[2023-03-22 03:13:59] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1961 rows 2160 cols
[2023-03-22 03:13:59] [INFO ] Computed 441 place invariants in 46 ms
[2023-03-22 03:14:00] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2160/2442 places, 1961/2242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2389 ms. Remains : 2160/2442 places, 1961/2242 transitions.
Support contains 6 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 139 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2023-03-22 03:14:00] [INFO ] Computed 441 place invariants in 8 ms
[2023-03-22 03:14:01] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-22 03:14:01] [INFO ] Invariant cache hit.
[2023-03-22 03:14:04] [INFO ] Implicit Places using invariants and state equation in 2848 ms returned []
Implicit Place search using SMT with State Equation took 3844 ms to find 0 implicit places.
[2023-03-22 03:14:04] [INFO ] Invariant cache hit.
[2023-03-22 03:14:06] [INFO ] Dead Transitions using invariants and state equation in 1568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5566 ms. Remains : 2442/2442 places, 2242/2242 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-02 finished in 79259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2449 transition count 1968
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2168 transition count 1968
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 562 place count 2168 transition count 1767
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 964 place count 1967 transition count 1767
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 972 place count 1959 transition count 1759
Iterating global reduction 2 with 8 rules applied. Total rules applied 980 place count 1959 transition count 1759
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 980 place count 1959 transition count 1754
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 990 place count 1954 transition count 1754
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 1 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2412 place count 1243 transition count 1043
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 2414 place count 1241 transition count 1041
Applied a total of 2414 rules in 457 ms. Remains 1241 /2450 variables (removed 1209) and now considering 1041/2250 (removed 1209) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2023-03-22 03:14:06] [INFO ] Computed 441 place invariants in 8 ms
[2023-03-22 03:14:07] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-22 03:14:07] [INFO ] Invariant cache hit.
[2023-03-22 03:14:09] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2023-03-22 03:14:09] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-22 03:14:09] [INFO ] Invariant cache hit.
[2023-03-22 03:14:09] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2450 places, 1041/2250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3113 ms. Remains : 1241/2450 places, 1041/2250 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 41 reset in 898 ms.
Product exploration explored 100000 steps with 41 reset in 1131 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Finished random walk after 2426 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2023-03-22 03:14:12] [INFO ] Invariant cache hit.
[2023-03-22 03:14:13] [INFO ] [Real]Absence check using 441 positive place invariants in 269 ms returned sat
[2023-03-22 03:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:14:15] [INFO ] [Real]Absence check using state equation in 2745 ms returned sat
[2023-03-22 03:14:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:14:17] [INFO ] [Nat]Absence check using 441 positive place invariants in 229 ms returned sat
[2023-03-22 03:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:14:19] [INFO ] [Nat]Absence check using state equation in 2580 ms returned sat
[2023-03-22 03:14:19] [INFO ] Computed and/alt/rep : 1038/1999/1038 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-22 03:14:31] [INFO ] Added : 465 causal constraints over 93 iterations in 11311 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 73 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-22 03:14:31] [INFO ] Invariant cache hit.
[2023-03-22 03:14:31] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-22 03:14:31] [INFO ] Invariant cache hit.
[2023-03-22 03:14:33] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2023-03-22 03:14:33] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-22 03:14:33] [INFO ] Invariant cache hit.
[2023-03-22 03:14:33] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2683 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 2447 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-22 03:14:34] [INFO ] Invariant cache hit.
[2023-03-22 03:14:35] [INFO ] [Real]Absence check using 441 positive place invariants in 246 ms returned sat
[2023-03-22 03:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:14:38] [INFO ] [Real]Absence check using state equation in 2858 ms returned sat
[2023-03-22 03:14:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:14:39] [INFO ] [Nat]Absence check using 441 positive place invariants in 280 ms returned sat
[2023-03-22 03:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:14:41] [INFO ] [Nat]Absence check using state equation in 2703 ms returned sat
[2023-03-22 03:14:42] [INFO ] Computed and/alt/rep : 1038/1999/1038 causal constraints (skipped 0 transitions) in 76 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:14:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 42 reset in 889 ms.
Product exploration explored 100000 steps with 42 reset in 1120 ms.
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 36 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2023-03-22 03:14:55] [INFO ] Invariant cache hit.
[2023-03-22 03:14:55] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-22 03:14:55] [INFO ] Invariant cache hit.
[2023-03-22 03:14:57] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2023-03-22 03:14:57] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:14:57] [INFO ] Invariant cache hit.
[2023-03-22 03:14:57] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2431 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-03 finished in 51209 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(F(p0))&&(p1||X(p2)))))'
Support contains 3 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2442 transition count 2242
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2442 transition count 2242
Applied a total of 16 rules in 349 ms. Remains 2442 /2450 variables (removed 8) and now considering 2242/2250 (removed 8) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2023-03-22 03:14:58] [INFO ] Computed 441 place invariants in 13 ms
[2023-03-22 03:14:59] [INFO ] Implicit Places using invariants in 991 ms returned []
[2023-03-22 03:14:59] [INFO ] Invariant cache hit.
[2023-03-22 03:15:01] [INFO ] Implicit Places using invariants and state equation in 2683 ms returned []
Implicit Place search using SMT with State Equation took 3691 ms to find 0 implicit places.
[2023-03-22 03:15:01] [INFO ] Invariant cache hit.
[2023-03-22 03:15:02] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2450 places, 2242/2250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5158 ms. Remains : 2442/2450 places, 2242/2250 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1351 0), p2:(EQ s2156 0), p0:(EQ s690 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1821 ms.
Product exploration explored 100000 steps with 50000 reset in 1754 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-040B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-040B-LTLFireability-06 finished in 9076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1) U X(p2))))'
Support contains 3 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2444 transition count 2244
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2444 transition count 2244
Applied a total of 12 rules in 303 ms. Remains 2444 /2450 variables (removed 6) and now considering 2244/2250 (removed 6) transitions.
// Phase 1: matrix 2244 rows 2444 cols
[2023-03-22 03:15:07] [INFO ] Computed 441 place invariants in 16 ms
[2023-03-22 03:15:07] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-22 03:15:07] [INFO ] Invariant cache hit.
[2023-03-22 03:15:10] [INFO ] Implicit Places using invariants and state equation in 2532 ms returned []
Implicit Place search using SMT with State Equation took 3460 ms to find 0 implicit places.
[2023-03-22 03:15:10] [INFO ] Invariant cache hit.
[2023-03-22 03:15:11] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2444/2450 places, 2244/2250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5162 ms. Remains : 2444/2450 places, 2244/2250 transitions.
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s2204 0), p1:(NEQ s1823 1), p2:(EQ s2194 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 916 reset in 333 ms.
Product exploration explored 100000 steps with 938 reset in 348 ms.
Computed a total of 481 stabilizing places and 481 stable transitions
Computed a total of 481 stabilizing places and 481 stable transitions
Detected a total of 481/2444 stabilizing places and 481/2244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1447 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:15:15] [INFO ] Invariant cache hit.
[2023-03-22 03:15:15] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:15:15] [INFO ] [Nat]Absence check using 441 positive place invariants in 215 ms returned sat
[2023-03-22 03:15:17] [INFO ] After 1320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:15:18] [INFO ] Deduced a trap composed of 33 places in 714 ms of which 1 ms to minimize.
[2023-03-22 03:15:18] [INFO ] Deduced a trap composed of 22 places in 717 ms of which 1 ms to minimize.
[2023-03-22 03:15:19] [INFO ] Deduced a trap composed of 22 places in 624 ms of which 2 ms to minimize.
[2023-03-22 03:15:20] [INFO ] Deduced a trap composed of 19 places in 708 ms of which 2 ms to minimize.
[2023-03-22 03:15:21] [INFO ] Deduced a trap composed of 43 places in 592 ms of which 3 ms to minimize.
[2023-03-22 03:15:21] [INFO ] Deduced a trap composed of 36 places in 578 ms of which 1 ms to minimize.
[2023-03-22 03:15:22] [INFO ] Deduced a trap composed of 19 places in 551 ms of which 1 ms to minimize.
[2023-03-22 03:15:22] [INFO ] Deduced a trap composed of 31 places in 607 ms of which 4 ms to minimize.
[2023-03-22 03:15:23] [INFO ] Deduced a trap composed of 18 places in 587 ms of which 3 ms to minimize.
[2023-03-22 03:15:24] [INFO ] Deduced a trap composed of 25 places in 563 ms of which 2 ms to minimize.
[2023-03-22 03:15:25] [INFO ] Deduced a trap composed of 26 places in 812 ms of which 2 ms to minimize.
[2023-03-22 03:15:25] [INFO ] Deduced a trap composed of 36 places in 622 ms of which 2 ms to minimize.
[2023-03-22 03:15:26] [INFO ] Deduced a trap composed of 25 places in 553 ms of which 1 ms to minimize.
[2023-03-22 03:15:27] [INFO ] Deduced a trap composed of 18 places in 675 ms of which 2 ms to minimize.
[2023-03-22 03:15:27] [INFO ] Deduced a trap composed of 27 places in 559 ms of which 1 ms to minimize.
[2023-03-22 03:15:28] [INFO ] Deduced a trap composed of 30 places in 568 ms of which 1 ms to minimize.
[2023-03-22 03:15:29] [INFO ] Deduced a trap composed of 24 places in 643 ms of which 1 ms to minimize.
[2023-03-22 03:15:30] [INFO ] Deduced a trap composed of 42 places in 587 ms of which 1 ms to minimize.
[2023-03-22 03:15:30] [INFO ] Deduced a trap composed of 27 places in 586 ms of which 1 ms to minimize.
[2023-03-22 03:15:31] [INFO ] Deduced a trap composed of 24 places in 585 ms of which 1 ms to minimize.
[2023-03-22 03:15:31] [INFO ] Deduced a trap composed of 38 places in 511 ms of which 2 ms to minimize.
[2023-03-22 03:15:32] [INFO ] Deduced a trap composed of 26 places in 526 ms of which 1 ms to minimize.
[2023-03-22 03:15:33] [INFO ] Deduced a trap composed of 29 places in 583 ms of which 1 ms to minimize.
[2023-03-22 03:15:33] [INFO ] Deduced a trap composed of 60 places in 500 ms of which 1 ms to minimize.
[2023-03-22 03:15:34] [INFO ] Deduced a trap composed of 29 places in 593 ms of which 1 ms to minimize.
[2023-03-22 03:15:35] [INFO ] Deduced a trap composed of 26 places in 526 ms of which 1 ms to minimize.
[2023-03-22 03:15:35] [INFO ] Deduced a trap composed of 40 places in 544 ms of which 1 ms to minimize.
[2023-03-22 03:15:36] [INFO ] Deduced a trap composed of 37 places in 424 ms of which 1 ms to minimize.
[2023-03-22 03:15:36] [INFO ] Deduced a trap composed of 41 places in 619 ms of which 2 ms to minimize.
[2023-03-22 03:15:37] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 3 ms to minimize.
[2023-03-22 03:15:38] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 2 ms to minimize.
[2023-03-22 03:15:38] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 1 ms to minimize.
[2023-03-22 03:15:39] [INFO ] Deduced a trap composed of 32 places in 461 ms of which 1 ms to minimize.
[2023-03-22 03:15:39] [INFO ] Deduced a trap composed of 31 places in 528 ms of which 2 ms to minimize.
[2023-03-22 03:15:40] [INFO ] Deduced a trap composed of 43 places in 441 ms of which 1 ms to minimize.
[2023-03-22 03:15:40] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:15:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:15:40] [INFO ] After 25335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 127 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F p2), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 18 factoid took 1497 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2244/2244 transitions.
Applied a total of 0 rules in 124 ms. Remains 2444 /2444 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
[2023-03-22 03:15:43] [INFO ] Invariant cache hit.
[2023-03-22 03:15:44] [INFO ] Implicit Places using invariants in 962 ms returned []
[2023-03-22 03:15:44] [INFO ] Invariant cache hit.
[2023-03-22 03:15:47] [INFO ] Implicit Places using invariants and state equation in 3163 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
[2023-03-22 03:15:47] [INFO ] Invariant cache hit.
[2023-03-22 03:15:48] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5785 ms. Remains : 2444/2444 places, 2244/2244 transitions.
Computed a total of 481 stabilizing places and 481 stable transitions
Computed a total of 481 stabilizing places and 481 stable transitions
Detected a total of 481/2444 stabilizing places and 481/2244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 753 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 9) seen :7
Finished Best-First random walk after 2575 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=515 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p2) p0))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 1052 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 965 reset in 332 ms.
Product exploration explored 100000 steps with 930 reset in 330 ms.
Applying partial POR strategy [false, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2244/2244 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2444 transition count 2244
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 279 place count 2444 transition count 2246
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 360 place count 2444 transition count 2246
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1197 places in 2 ms
Iterating global reduction 1 with 837 rules applied. Total rules applied 1197 place count 2444 transition count 2246
Renaming transitions due to excessive name length > 1024 char.
Discarding 278 places :
Symmetric choice reduction at 1 with 278 rule applications. Total rules 1475 place count 2166 transition count 1968
Deduced a syphon composed of 919 places in 2 ms
Iterating global reduction 1 with 278 rules applied. Total rules applied 1753 place count 2166 transition count 1968
Deduced a syphon composed of 919 places in 1 ms
Applied a total of 1753 rules in 632 ms. Remains 2166 /2444 variables (removed 278) and now considering 1968/2244 (removed 276) transitions.
[2023-03-22 03:15:54] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1968 rows 2166 cols
[2023-03-22 03:15:54] [INFO ] Computed 441 place invariants in 25 ms
[2023-03-22 03:15:55] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2166/2444 places, 1968/2244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2033 ms. Remains : 2166/2444 places, 1968/2244 transitions.
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2244/2244 transitions.
Applied a total of 0 rules in 127 ms. Remains 2444 /2444 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
// Phase 1: matrix 2244 rows 2444 cols
[2023-03-22 03:15:55] [INFO ] Computed 441 place invariants in 6 ms
[2023-03-22 03:15:56] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-22 03:15:56] [INFO ] Invariant cache hit.
[2023-03-22 03:15:59] [INFO ] Implicit Places using invariants and state equation in 2410 ms returned []
Implicit Place search using SMT with State Equation took 3316 ms to find 0 implicit places.
[2023-03-22 03:15:59] [INFO ] Invariant cache hit.
[2023-03-22 03:16:00] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4956 ms. Remains : 2444/2444 places, 2244/2244 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-08 finished in 53921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 5 out of 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2449 transition count 1967
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2167 transition count 1967
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 564 place count 2167 transition count 1768
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 962 place count 1968 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 970 place count 1960 transition count 1760
Iterating global reduction 2 with 8 rules applied. Total rules applied 978 place count 1960 transition count 1760
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 978 place count 1960 transition count 1755
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 988 place count 1955 transition count 1755
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 1 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2404 place count 1247 transition count 1047
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 2406 place count 1245 transition count 1045
Applied a total of 2406 rules in 398 ms. Remains 1245 /2450 variables (removed 1205) and now considering 1045/2250 (removed 1205) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2023-03-22 03:16:01] [INFO ] Computed 441 place invariants in 10 ms
[2023-03-22 03:16:01] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-22 03:16:01] [INFO ] Invariant cache hit.
[2023-03-22 03:16:03] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2023-03-22 03:16:03] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 03:16:03] [INFO ] Invariant cache hit.
[2023-03-22 03:16:04] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/2450 places, 1045/2250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3512 ms. Remains : 1245/2450 places, 1045/2250 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s811 1) (EQ s840 1)), p0:(AND (EQ s701 1) (EQ s711 1)), p2:(EQ s129 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6635 steps with 3 reset in 57 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-09 finished in 3709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2449 transition count 1968
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2168 transition count 1968
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2168 transition count 1768
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1968 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 970 place count 1960 transition count 1760
Iterating global reduction 2 with 8 rules applied. Total rules applied 978 place count 1960 transition count 1760
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 978 place count 1960 transition count 1755
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 988 place count 1955 transition count 1755
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2408 place count 1245 transition count 1045
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 2410 place count 1243 transition count 1043
Applied a total of 2410 rules in 383 ms. Remains 1243 /2450 variables (removed 1207) and now considering 1043/2250 (removed 1207) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 03:16:04] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-22 03:16:05] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-22 03:16:05] [INFO ] Invariant cache hit.
[2023-03-22 03:16:08] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 3346 ms to find 0 implicit places.
[2023-03-22 03:16:08] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:16:08] [INFO ] Invariant cache hit.
[2023-03-22 03:16:08] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1243/2450 places, 1043/2250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4354 ms. Remains : 1243/2450 places, 1043/2250 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s291 1) (NEQ s304 1)), p1:(NEQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 47 reset in 970 ms.
Product exploration explored 100000 steps with 47 reset in 1103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2376 steps, including 0 resets, run visited all 2 properties in 47 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 72 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 03:16:12] [INFO ] Invariant cache hit.
[2023-03-22 03:16:12] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-22 03:16:12] [INFO ] Invariant cache hit.
[2023-03-22 03:16:14] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2023-03-22 03:16:14] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:16:14] [INFO ] Invariant cache hit.
[2023-03-22 03:16:14] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2621 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2177 steps, including 0 resets, run visited all 2 properties in 32 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 48 reset in 859 ms.
Product exploration explored 100000 steps with 47 reset in 1077 ms.
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 40 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 03:16:17] [INFO ] Invariant cache hit.
[2023-03-22 03:16:18] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-22 03:16:18] [INFO ] Invariant cache hit.
[2023-03-22 03:16:19] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2023-03-22 03:16:19] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:16:19] [INFO ] Invariant cache hit.
[2023-03-22 03:16:20] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2699 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-10 finished in 16189 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 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2449 transition count 1968
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2168 transition count 1968
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 562 place count 2168 transition count 1767
Deduced a syphon composed of 201 places in 5 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 964 place count 1967 transition count 1767
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 972 place count 1959 transition count 1759
Iterating global reduction 2 with 8 rules applied. Total rules applied 980 place count 1959 transition count 1759
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 980 place count 1959 transition count 1754
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 990 place count 1954 transition count 1754
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2410 place count 1244 transition count 1044
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 2412 place count 1242 transition count 1042
Applied a total of 2412 rules in 515 ms. Remains 1242 /2450 variables (removed 1208) and now considering 1042/2250 (removed 1208) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2023-03-22 03:16:21] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 03:16:21] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-22 03:16:21] [INFO ] Invariant cache hit.
[2023-03-22 03:16:22] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2023-03-22 03:16:22] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:16:22] [INFO ] Invariant cache hit.
[2023-03-22 03:16:23] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/2450 places, 1042/2250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2855 ms. Remains : 1242/2450 places, 1042/2250 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1165 1) (EQ s1175 1) (EQ s1215 1) (EQ s1233 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 2706 steps with 0 reset in 26 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-11 finished in 2993 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 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2449 transition count 1969
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2169 transition count 1969
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 560 place count 2169 transition count 1768
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 962 place count 1968 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 970 place count 1960 transition count 1760
Iterating global reduction 2 with 8 rules applied. Total rules applied 978 place count 1960 transition count 1760
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 978 place count 1960 transition count 1755
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 988 place count 1955 transition count 1755
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2408 place count 1245 transition count 1045
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 2410 place count 1243 transition count 1043
Applied a total of 2410 rules in 526 ms. Remains 1243 /2450 variables (removed 1207) and now considering 1043/2250 (removed 1207) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 03:16:24] [INFO ] Computed 441 place invariants in 1 ms
[2023-03-22 03:16:24] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-22 03:16:24] [INFO ] Invariant cache hit.
[2023-03-22 03:16:26] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2023-03-22 03:16:26] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:16:26] [INFO ] Invariant cache hit.
[2023-03-22 03:16:26] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1243/2450 places, 1043/2250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3076 ms. Remains : 1243/2450 places, 1043/2250 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s282 1) (NEQ s565 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 2827 steps with 0 reset in 27 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-12 finished in 3183 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&&F((!p0&&(G(p1)||F(p0))))))))'
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2442 transition count 2242
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2442 transition count 2242
Applied a total of 16 rules in 297 ms. Remains 2442 /2450 variables (removed 8) and now considering 2242/2250 (removed 8) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2023-03-22 03:16:27] [INFO ] Computed 441 place invariants in 6 ms
[2023-03-22 03:16:27] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-22 03:16:27] [INFO ] Invariant cache hit.
[2023-03-22 03:16:30] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3691 ms to find 0 implicit places.
[2023-03-22 03:16:30] [INFO ] Invariant cache hit.
[2023-03-22 03:16:32] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2450 places, 2242/2250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5506 ms. Remains : 2442/2450 places, 2242/2250 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1796 1), p1:(NEQ s986 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 51 reset in 725 ms.
Product exploration explored 100000 steps with 50 reset in 845 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2442 stabilizing places and 479/2242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 1664 steps, including 0 resets, run visited all 3 properties in 17 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:16:35] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), true]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 125 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
[2023-03-22 03:16:37] [INFO ] Invariant cache hit.
[2023-03-22 03:16:38] [INFO ] Implicit Places using invariants in 953 ms returned []
[2023-03-22 03:16:38] [INFO ] Invariant cache hit.
[2023-03-22 03:16:39] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2023-03-22 03:16:39] [INFO ] Invariant cache hit.
[2023-03-22 03:16:41] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3804 ms. Remains : 2442/2442 places, 2242/2242 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2442 stabilizing places and 479/2242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 1514 steps, including 0 resets, run visited all 3 properties in 28 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:16:42] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), true]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 247 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50 reset in 756 ms.
Product exploration explored 100000 steps with 47 reset in 875 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 215 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2442 transition count 2242
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 281 place count 2442 transition count 2243
Deduced a syphon composed of 362 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 362 place count 2442 transition count 2243
Performed 836 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1198 places in 2 ms
Iterating global reduction 1 with 836 rules applied. Total rules applied 1198 place count 2442 transition count 2243
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1479 place count 2161 transition count 1962
Deduced a syphon composed of 917 places in 2 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1760 place count 2161 transition count 1962
Deduced a syphon composed of 917 places in 1 ms
Applied a total of 1760 rules in 717 ms. Remains 2161 /2442 variables (removed 281) and now considering 1962/2242 (removed 280) transitions.
[2023-03-22 03:16:47] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1962 rows 2161 cols
[2023-03-22 03:16:47] [INFO ] Computed 441 place invariants in 14 ms
[2023-03-22 03:16:48] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2161/2442 places, 1962/2242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2131 ms. Remains : 2161/2442 places, 1962/2242 transitions.
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 140 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2023-03-22 03:16:48] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-22 03:16:49] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-22 03:16:49] [INFO ] Invariant cache hit.
[2023-03-22 03:16:53] [INFO ] Implicit Places using invariants and state equation in 3102 ms returned []
Implicit Place search using SMT with State Equation took 4241 ms to find 0 implicit places.
[2023-03-22 03:16:53] [INFO ] Invariant cache hit.
[2023-03-22 03:16:54] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5861 ms. Remains : 2442/2442 places, 2242/2242 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-13 finished in 27908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2442 transition count 2242
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2442 transition count 2242
Applied a total of 16 rules in 261 ms. Remains 2442 /2450 variables (removed 8) and now considering 2242/2250 (removed 8) transitions.
[2023-03-22 03:16:54] [INFO ] Invariant cache hit.
[2023-03-22 03:16:55] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-22 03:16:55] [INFO ] Invariant cache hit.
[2023-03-22 03:16:58] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
[2023-03-22 03:16:58] [INFO ] Invariant cache hit.
[2023-03-22 03:17:00] [INFO ] Dead Transitions using invariants and state equation in 1737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2450 places, 2242/2250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5872 ms. Remains : 2442/2450 places, 2242/2250 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s433 1) (EQ s452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-15 finished in 6116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||(p1 U p2)))||(X(G(p3))&&G(p1))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-040B-LTLFireability-00
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2449 transition count 1969
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2169 transition count 1969
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 560 place count 2169 transition count 1770
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 958 place count 1970 transition count 1770
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 963 place count 1965 transition count 1765
Iterating global reduction 2 with 5 rules applied. Total rules applied 968 place count 1965 transition count 1765
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 968 place count 1965 transition count 1762
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 974 place count 1962 transition count 1762
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 1 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2400 place count 1249 transition count 1049
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 2402 place count 1247 transition count 1047
Applied a total of 2402 rules in 500 ms. Remains 1247 /2450 variables (removed 1203) and now considering 1047/2250 (removed 1203) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2023-03-22 03:17:01] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 03:17:02] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-22 03:17:02] [INFO ] Invariant cache hit.
[2023-03-22 03:17:03] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2023-03-22 03:17:03] [INFO ] Invariant cache hit.
[2023-03-22 03:17:04] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1247/2450 places, 1047/2250 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3355 ms. Remains : 1247/2450 places, 1047/2250 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s864 1), p2:(EQ s938 1), p1:(EQ s216 1), p3:(EQ s859 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28282 reset in 1090 ms.
Product exploration explored 100000 steps with 28223 reset in 1214 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1247 stabilizing places and 6/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))))]
Knowledge based reduction with 6 factoid took 583 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 428 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-22 03:17:07] [INFO ] Invariant cache hit.
[2023-03-22 03:17:08] [INFO ] [Real]Absence check using 441 positive place invariants in 244 ms returned sat
[2023-03-22 03:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:17:12] [INFO ] [Real]Absence check using state equation in 3426 ms returned sat
[2023-03-22 03:17:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:17:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 227 ms returned sat
[2023-03-22 03:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:17:16] [INFO ] [Nat]Absence check using state equation in 3310 ms returned sat
[2023-03-22 03:17:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-22 03:17:16] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-22 03:17:16] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-22 03:17:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-22 03:17:17] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-22 03:17:17] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-03-22 03:17:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 794 ms
[2023-03-22 03:17:17] [INFO ] Computed and/alt/rep : 1042/2037/1042 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-22 03:17:27] [INFO ] Added : 470 causal constraints over 94 iterations in 10016 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 1247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Applied a total of 0 rules in 45 ms. Remains 1247 /1247 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
[2023-03-22 03:17:27] [INFO ] Invariant cache hit.
[2023-03-22 03:17:28] [INFO ] Implicit Places using invariants in 620 ms returned []
[2023-03-22 03:17:28] [INFO ] Invariant cache hit.
[2023-03-22 03:17:29] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
[2023-03-22 03:17:29] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 03:17:29] [INFO ] Invariant cache hit.
[2023-03-22 03:17:29] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2532 ms. Remains : 1247/1247 places, 1047/1047 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1247 stabilizing places and 6/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-22 03:17:30] [INFO ] Invariant cache hit.
[2023-03-22 03:17:31] [INFO ] [Real]Absence check using 441 positive place invariants in 411 ms returned sat
[2023-03-22 03:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:17:35] [INFO ] [Real]Absence check using state equation in 3390 ms returned sat
[2023-03-22 03:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:17:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 266 ms returned sat
[2023-03-22 03:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:17:39] [INFO ] [Nat]Absence check using state equation in 3279 ms returned sat
[2023-03-22 03:17:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-22 03:17:39] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-22 03:17:39] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:17:40] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-22 03:17:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2023-03-22 03:17:40] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-22 03:17:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 719 ms
[2023-03-22 03:17:40] [INFO ] Computed and/alt/rep : 1042/2037/1042 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-22 03:17:50] [INFO ] Deduced a trap composed of 2 places in 546 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:17:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28321 reset in 1061 ms.
Product exploration explored 100000 steps with 28056 reset in 1286 ms.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 1045
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1244 transition count 1044
Applied a total of 3 rules in 103 ms. Remains 1244 /1247 variables (removed 3) and now considering 1044/1047 (removed 3) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2023-03-22 03:17:53] [INFO ] Computed 441 place invariants in 1 ms
[2023-03-22 03:17:53] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-22 03:17:53] [INFO ] Invariant cache hit.
[2023-03-22 03:17:55] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2023-03-22 03:17:55] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 03:17:55] [INFO ] Invariant cache hit.
[2023-03-22 03:17:55] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/1247 places, 1044/1047 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2634 ms. Remains : 1244/1247 places, 1044/1047 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-00 finished in 55130 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||X(X(X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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(p0)||(F(p1) U X(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F((!p0&&(G(p1)||F(p0))))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-040B-LTLFireability-13
Stuttering acceptance computed with spot in 197 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2450 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2450/2450 places, 2250/2250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2449 transition count 1967
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2167 transition count 1967
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2167 transition count 1767
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1967 transition count 1767
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 972 place count 1959 transition count 1759
Iterating global reduction 2 with 8 rules applied. Total rules applied 980 place count 1959 transition count 1759
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 980 place count 1959 transition count 1754
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 990 place count 1954 transition count 1754
Performed 709 Post agglomeration using F-continuation condition.Transition count delta: 709
Deduced a syphon composed of 709 places in 2 ms
Reduce places removed 709 places and 0 transitions.
Iterating global reduction 2 with 1418 rules applied. Total rules applied 2408 place count 1245 transition count 1045
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 2410 place count 1243 transition count 1043
Applied a total of 2410 rules in 440 ms. Remains 1243 /2450 variables (removed 1207) and now considering 1043/2250 (removed 1207) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 03:17:56] [INFO ] Computed 441 place invariants in 2 ms
[2023-03-22 03:17:57] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-22 03:17:57] [INFO ] Invariant cache hit.
[2023-03-22 03:17:58] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
[2023-03-22 03:17:58] [INFO ] Invariant cache hit.
[2023-03-22 03:17:59] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1243/2450 places, 1043/2250 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2973 ms. Remains : 1243/2450 places, 1043/2250 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s906 1), p1:(NEQ s491 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 152 reset in 930 ms.
Product exploration explored 100000 steps with 151 reset in 960 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1243 stabilizing places and 2/1043 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 453 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:18:02] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), true]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 45 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 03:18:03] [INFO ] Invariant cache hit.
[2023-03-22 03:18:04] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-22 03:18:04] [INFO ] Invariant cache hit.
[2023-03-22 03:18:05] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2023-03-22 03:18:05] [INFO ] Invariant cache hit.
[2023-03-22 03:18:06] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2657 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1243 stabilizing places and 2/1043 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 512 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:18:07] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), true]
Knowledge based reduction with 4 factoid took 331 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 145 reset in 798 ms.
Product exploration explored 100000 steps with 151 reset in 919 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 269 ms :[true, true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 76 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 03:18:11] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-22 03:18:11] [INFO ] Invariant cache hit.
[2023-03-22 03:18:12] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Support contains 2 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 32 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2023-03-22 03:18:12] [INFO ] Invariant cache hit.
[2023-03-22 03:18:12] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-22 03:18:12] [INFO ] Invariant cache hit.
[2023-03-22 03:18:14] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
[2023-03-22 03:18:14] [INFO ] Invariant cache hit.
[2023-03-22 03:18:14] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-13 finished in 18582 ms.
[2023-03-22 03:18:14] [INFO ] Flatten gal took : 71 ms
[2023-03-22 03:18:14] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 03:18:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2450 places, 2250 transitions and 6420 arcs took 11 ms.
Total runtime 418495 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3537/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3537/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3537/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3537/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3537/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3537/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-040B-LTLFireability-00
Could not compute solution for formula : ShieldPPPs-PT-040B-LTLFireability-02
Could not compute solution for formula : ShieldPPPs-PT-040B-LTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-040B-LTLFireability-08
Could not compute solution for formula : ShieldPPPs-PT-040B-LTLFireability-10
Could not compute solution for formula : ShieldPPPs-PT-040B-LTLFireability-13

BK_STOP 1679455101210

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-040B-LTLFireability-00
ltl formula formula --ltl=/tmp/3537/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 2450 places, 2250 transitions and 6420 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.090 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3537/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3537/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3537/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3537/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPs-PT-040B-LTLFireability-02
ltl formula formula --ltl=/tmp/3537/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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2450 places, 2250 transitions and 6420 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.340 real 0.070 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3537/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3537/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3537/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3537/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPs-PT-040B-LTLFireability-03
ltl formula formula --ltl=/tmp/3537/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2450 places, 2250 transitions and 6420 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.350 real 0.120 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3537/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3537/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3537/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3537/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 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-040B-LTLFireability-08
ltl formula formula --ltl=/tmp/3537/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2450 places, 2250 transitions and 6420 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.360 real 0.120 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3537/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3537/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3537/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3537/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 9 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-040B-LTLFireability-10
ltl formula formula --ltl=/tmp/3537/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2450 places, 2250 transitions and 6420 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.380 real 0.120 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3537/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3537/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3537/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3537/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPs-PT-040B-LTLFireability-13
ltl formula formula --ltl=/tmp/3537/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2450 places, 2250 transitions and 6420 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.330 real 0.110 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3537/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3537/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3537/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3537/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

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