fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r393-oct2-167903717300667
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldPPPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2748.979 111434.00 165554.00 63.40 TFFFFFFFTFFTTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 762K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679467605122

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:46:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:46:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:46:47] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-22 06:46:48] [INFO ] Transformed 3123 places.
[2023-03-22 06:46:48] [INFO ] Transformed 2843 transitions.
[2023-03-22 06:46:48] [INFO ] Found NUPN structural information;
[2023-03-22 06:46:48] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 440 places :
Symmetric choice reduction at 0 with 440 rule applications. Total rules 440 place count 2683 transition count 2403
Iterating global reduction 0 with 440 rules applied. Total rules applied 880 place count 2683 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 881 place count 2682 transition count 2402
Iterating global reduction 0 with 1 rules applied. Total rules applied 882 place count 2682 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 883 place count 2681 transition count 2401
Iterating global reduction 0 with 1 rules applied. Total rules applied 884 place count 2681 transition count 2401
Applied a total of 884 rules in 1149 ms. Remains 2681 /3123 variables (removed 442) and now considering 2401/2843 (removed 442) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:46:49] [INFO ] Computed 441 place invariants in 43 ms
[2023-03-22 06:46:50] [INFO ] Implicit Places using invariants in 1469 ms returned []
[2023-03-22 06:46:51] [INFO ] Invariant cache hit.
[2023-03-22 06:46:54] [INFO ] Implicit Places using invariants and state equation in 3969 ms returned []
Implicit Place search using SMT with State Equation took 5501 ms to find 0 implicit places.
[2023-03-22 06:46:54] [INFO ] Invariant cache hit.
[2023-03-22 06:46:56] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/3123 places, 2401/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8143 ms. Remains : 2681/3123 places, 2401/2843 transitions.
Support contains 17 out of 2681 places after structural reductions.
[2023-03-22 06:46:56] [INFO ] Flatten gal took : 164 ms
[2023-03-22 06:46:56] [INFO ] Flatten gal took : 83 ms
[2023-03-22 06:46:57] [INFO ] Input system was already deterministic with 2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 06:46:57] [INFO ] Invariant cache hit.
[2023-03-22 06:46:58] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 06:46:58] [INFO ] [Nat]Absence check using 441 positive place invariants in 213 ms returned sat
[2023-03-22 06:47:01] [INFO ] After 2369ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 06:47:02] [INFO ] Deduced a trap composed of 26 places in 672 ms of which 6 ms to minimize.
[2023-03-22 06:47:03] [INFO ] Deduced a trap composed of 18 places in 722 ms of which 3 ms to minimize.
[2023-03-22 06:47:03] [INFO ] Deduced a trap composed of 27 places in 751 ms of which 3 ms to minimize.
[2023-03-22 06:47:04] [INFO ] Deduced a trap composed of 20 places in 744 ms of which 9 ms to minimize.
[2023-03-22 06:47:05] [INFO ] Deduced a trap composed of 22 places in 583 ms of which 1 ms to minimize.
[2023-03-22 06:47:06] [INFO ] Deduced a trap composed of 25 places in 837 ms of which 1 ms to minimize.
[2023-03-22 06:47:07] [INFO ] Deduced a trap composed of 20 places in 876 ms of which 3 ms to minimize.
[2023-03-22 06:47:08] [INFO ] Deduced a trap composed of 23 places in 736 ms of which 4 ms to minimize.
[2023-03-22 06:47:08] [INFO ] Deduced a trap composed of 22 places in 748 ms of which 2 ms to minimize.
[2023-03-22 06:47:09] [INFO ] Deduced a trap composed of 23 places in 754 ms of which 1 ms to minimize.
[2023-03-22 06:47:10] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 1 ms to minimize.
[2023-03-22 06:47:11] [INFO ] Deduced a trap composed of 16 places in 566 ms of which 20 ms to minimize.
[2023-03-22 06:47:11] [INFO ] Deduced a trap composed of 17 places in 677 ms of which 1 ms to minimize.
[2023-03-22 06:47:12] [INFO ] Deduced a trap composed of 22 places in 536 ms of which 11 ms to minimize.
[2023-03-22 06:47:13] [INFO ] Deduced a trap composed of 29 places in 539 ms of which 2 ms to minimize.
[2023-03-22 06:47:13] [INFO ] Deduced a trap composed of 35 places in 486 ms of which 1 ms to minimize.
[2023-03-22 06:47:14] [INFO ] Deduced a trap composed of 30 places in 513 ms of which 1 ms to minimize.
[2023-03-22 06:47:14] [INFO ] Deduced a trap composed of 23 places in 585 ms of which 2 ms to minimize.
[2023-03-22 06:47:15] [INFO ] Deduced a trap composed of 26 places in 532 ms of which 7 ms to minimize.
[2023-03-22 06:47:16] [INFO ] Deduced a trap composed of 31 places in 521 ms of which 1 ms to minimize.
[2023-03-22 06:47:16] [INFO ] Deduced a trap composed of 18 places in 460 ms of which 1 ms to minimize.
[2023-03-22 06:47:17] [INFO ] Deduced a trap composed of 28 places in 494 ms of which 9 ms to minimize.
[2023-03-22 06:47:17] [INFO ] Deduced a trap composed of 24 places in 557 ms of which 2 ms to minimize.
[2023-03-22 06:47:18] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 1 ms to minimize.
[2023-03-22 06:47:19] [INFO ] Deduced a trap composed of 39 places in 495 ms of which 1 ms to minimize.
[2023-03-22 06:47:19] [INFO ] Deduced a trap composed of 44 places in 447 ms of which 1 ms to minimize.
[2023-03-22 06:47:20] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 2 ms to minimize.
[2023-03-22 06:47:20] [INFO ] Deduced a trap composed of 36 places in 381 ms of which 1 ms to minimize.
[2023-03-22 06:47:20] [INFO ] Deduced a trap composed of 42 places in 387 ms of which 1 ms to minimize.
[2023-03-22 06:47:21] [INFO ] Deduced a trap composed of 41 places in 441 ms of which 1 ms to minimize.
[2023-03-22 06:47:21] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 1 ms to minimize.
[2023-03-22 06:47:22] [INFO ] Deduced a trap composed of 26 places in 503 ms of which 1 ms to minimize.
[2023-03-22 06:47:23] [INFO ] Deduced a trap composed of 25 places in 393 ms of which 1 ms to minimize.
[2023-03-22 06:47:23] [INFO ] Deduced a trap composed of 38 places in 394 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 06:47:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:47:23] [INFO ] After 25220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 4 out of 2681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2681 transition count 1843
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 2123 transition count 1842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 2122 transition count 1842
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 1118 place count 2122 transition count 1522
Deduced a syphon composed of 320 places in 3 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1758 place count 1802 transition count 1522
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 10 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 3 with 1354 rules applied. Total rules applied 3112 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3113 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3115 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3317 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3353 place count 1005 transition count 843
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 4 with 118 rules applied. Total rules applied 3471 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3472 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3473 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3473 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3477 place count 1001 transition count 840
Applied a total of 3477 rules in 557 ms. Remains 1001 /2681 variables (removed 1680) and now considering 840/2401 (removed 1561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 1001/2681 places, 840/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 168462 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{1=1}
Probabilistic random walk after 168462 steps, saw 153638 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-22 06:47:27] [INFO ] Computed 440 place invariants in 5 ms
[2023-03-22 06:47:27] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:47:27] [INFO ] [Nat]Absence check using 440 positive place invariants in 53 ms returned sat
[2023-03-22 06:47:28] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:47:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:47:28] [INFO ] After 102ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 06:47:28] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-22 06:47:28] [INFO ] After 1054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 840/840 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1001 transition count 839
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 1000 transition count 839
Applied a total of 2 rules in 49 ms. Remains 1000 /1001 variables (removed 1) and now considering 839/840 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1000/1001 places, 839/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 839 rows 1000 cols
[2023-03-22 06:47:28] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-22 06:47:29] [INFO ] [Real]Absence check using 440 positive place invariants in 63 ms returned sat
[2023-03-22 06:47:29] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:47:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:47:29] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:47:29] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:47:29] [INFO ] [Nat]Absence check using 440 positive place invariants in 99 ms returned sat
[2023-03-22 06:47:30] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:47:30] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:47:30] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 40 ms to minimize.
[2023-03-22 06:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-22 06:47:30] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-22 06:47:30] [INFO ] After 978ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 839/839 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 999 transition count 838
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 998 transition count 837
Applied a total of 3 rules in 91 ms. Remains 998 /1000 variables (removed 2) and now considering 837/839 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 998/1000 places, 837/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234629 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234629 steps, saw 209779 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 837 rows 998 cols
[2023-03-22 06:47:33] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:47:34] [INFO ] [Real]Absence check using 440 positive place invariants in 95 ms returned sat
[2023-03-22 06:47:34] [INFO ] After 401ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:47:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:47:34] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:47:34] [INFO ] After 725ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:47:34] [INFO ] [Nat]Absence check using 440 positive place invariants in 61 ms returned sat
[2023-03-22 06:47:35] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:47:35] [INFO ] After 51ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:47:35] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-22 06:47:35] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 837/837 transitions.
Applied a total of 0 rules in 41 ms. Remains 998 /998 variables (removed 0) and now considering 837/837 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 998/998 places, 837/837 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 837/837 transitions.
Applied a total of 0 rules in 34 ms. Remains 998 /998 variables (removed 0) and now considering 837/837 (removed 0) transitions.
[2023-03-22 06:47:35] [INFO ] Invariant cache hit.
[2023-03-22 06:47:36] [INFO ] Implicit Places using invariants in 801 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 804 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 996/998 places, 837/837 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 994 transition count 835
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 994 transition count 835
Applied a total of 4 rules in 53 ms. Remains 994 /996 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 994 cols
[2023-03-22 06:47:36] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:47:36] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-22 06:47:36] [INFO ] Invariant cache hit.
[2023-03-22 06:47:37] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 994/998 places, 835/837 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2623 ms. Remains : 994/998 places, 835/837 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276308 steps, run timeout after 3036 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 276308 steps, saw 246583 distinct states, run finished after 3036 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:47:41] [INFO ] Invariant cache hit.
[2023-03-22 06:47:41] [INFO ] [Real]Absence check using 438 positive place invariants in 50 ms returned sat
[2023-03-22 06:47:41] [INFO ] After 414ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:47:41] [INFO ] After 479ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 06:47:41] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 835/835 transitions.
Applied a total of 0 rules in 41 ms. Remains 994 /994 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 994/994 places, 835/835 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 835/835 transitions.
Applied a total of 0 rules in 36 ms. Remains 994 /994 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2023-03-22 06:47:41] [INFO ] Invariant cache hit.
[2023-03-22 06:47:42] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-22 06:47:42] [INFO ] Invariant cache hit.
[2023-03-22 06:47:43] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-03-22 06:47:43] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-22 06:47:43] [INFO ] Invariant cache hit.
[2023-03-22 06:47:44] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2408 ms. Remains : 994/994 places, 835/835 transitions.
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 994 transition count 835
Applied a total of 236 rules in 61 ms. Remains 994 /994 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 835 rows 994 cols
[2023-03-22 06:47:44] [INFO ] Computed 438 place invariants in 7 ms
[2023-03-22 06:47:44] [INFO ] [Real]Absence check using 438 positive place invariants in 115 ms returned sat
[2023-03-22 06:47:45] [INFO ] After 467ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:47:45] [INFO ] State equation strengthened by 230 read => feed constraints.
[2023-03-22 06:47:45] [INFO ] After 109ms SMT Verify possible using 230 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:47:45] [INFO ] After 956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:47:45] [INFO ] [Nat]Absence check using 438 positive place invariants in 76 ms returned sat
[2023-03-22 06:47:45] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:47:46] [INFO ] After 99ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:47:46] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-22 06:47:46] [INFO ] After 898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 638 stabilizing places and 638 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 250 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:47:46] [INFO ] Computed 441 place invariants in 8 ms
[2023-03-22 06:47:48] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2023-03-22 06:47:48] [INFO ] Invariant cache hit.
[2023-03-22 06:47:51] [INFO ] Implicit Places using invariants and state equation in 3256 ms returned []
Implicit Place search using SMT with State Equation took 4494 ms to find 0 implicit places.
[2023-03-22 06:47:51] [INFO ] Invariant cache hit.
[2023-03-22 06:47:53] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6612 ms. Remains : 2681/2681 places, 2401/2401 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s816 0) (EQ s1325 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2075 ms.
Product exploration explored 100000 steps with 50000 reset in 1908 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-00 finished in 11096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)&&G((F(p2) U p0))))'
Support contains 4 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2680 transition count 1844
Reduce places removed 556 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 559 rules applied. Total rules applied 1115 place count 2124 transition count 1841
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1118 place count 2121 transition count 1841
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 1118 place count 2121 transition count 1521
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1758 place count 1801 transition count 1521
Performed 673 Post agglomeration using F-continuation condition.Transition count delta: 673
Deduced a syphon composed of 673 places in 1 ms
Reduce places removed 673 places and 0 transitions.
Iterating global reduction 3 with 1346 rules applied. Total rules applied 3104 place count 1128 transition count 848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3105 place count 1128 transition count 847
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3107 place count 1127 transition count 846
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3309 place count 1026 transition count 846
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3345 place count 1008 transition count 846
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3347 place count 1006 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3348 place count 1005 transition count 844
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3348 place count 1005 transition count 842
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3352 place count 1003 transition count 842
Applied a total of 3352 rules in 454 ms. Remains 1003 /2681 variables (removed 1678) and now considering 842/2401 (removed 1559) transitions.
// Phase 1: matrix 842 rows 1003 cols
[2023-03-22 06:47:58] [INFO ] Computed 440 place invariants in 7 ms
[2023-03-22 06:47:58] [INFO ] Implicit Places using invariants in 545 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 547 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2681 places, 842/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 999 transition count 840
Applied a total of 4 rules in 42 ms. Remains 999 /1001 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 999 cols
[2023-03-22 06:47:58] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:47:59] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-22 06:47:59] [INFO ] Invariant cache hit.
[2023-03-22 06:47:59] [INFO ] State equation strengthened by 213 read => feed constraints.
[2023-03-22 06:48:03] [INFO ] Implicit Places using invariants and state equation in 4385 ms returned []
Implicit Place search using SMT with State Equation took 4925 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/2681 places, 840/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5968 ms. Remains : 999/2681 places, 840/2401 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=p1, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s799 0) (EQ s957 1)), p0:(EQ s703 1), p2:(EQ s684 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 13 reset in 730 ms.
Stack based approach found an accepted trace after 262 steps with 0 reset with depth 263 and stack size 263 in 3 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-02 finished in 7121 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 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2680 transition count 1841
Reduce places removed 559 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 560 rules applied. Total rules applied 1119 place count 2121 transition count 1840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1120 place count 2120 transition count 1840
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 1120 place count 2120 transition count 1520
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 3112 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3113 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3115 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3317 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3353 place count 1004 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3355 place count 1002 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3356 place count 1001 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3356 place count 1001 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3360 place count 999 transition count 838
Applied a total of 3360 rules in 477 ms. Remains 999 /2681 variables (removed 1682) and now considering 838/2401 (removed 1563) transitions.
// Phase 1: matrix 838 rows 999 cols
[2023-03-22 06:48:05] [INFO ] Computed 440 place invariants in 6 ms
[2023-03-22 06:48:05] [INFO ] Implicit Places using invariants in 712 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 713 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2681 places, 838/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 40 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2023-03-22 06:48:06] [INFO ] Computed 438 place invariants in 15 ms
[2023-03-22 06:48:06] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-22 06:48:06] [INFO ] Invariant cache hit.
[2023-03-22 06:48:07] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2681 places, 836/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3022 ms. Remains : 995/2681 places, 836/2401 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s738 0) (NEQ s978 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 635 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-04 finished in 3751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2680 transition count 1840
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2120 transition count 1840
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 1120 place count 2120 transition count 1520
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3112 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3113 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3317 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3353 place count 1004 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3355 place count 1002 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3356 place count 1001 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3356 place count 1001 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3360 place count 999 transition count 838
Applied a total of 3360 rules in 493 ms. Remains 999 /2681 variables (removed 1682) and now considering 838/2401 (removed 1563) transitions.
// Phase 1: matrix 838 rows 999 cols
[2023-03-22 06:48:09] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-22 06:48:09] [INFO ] Implicit Places using invariants in 576 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 577 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2681 places, 838/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 39 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2023-03-22 06:48:09] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-22 06:48:10] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-22 06:48:10] [INFO ] Invariant cache hit.
[2023-03-22 06:48:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 06:48:11] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2681 places, 836/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2930 ms. Remains : 995/2681 places, 836/2401 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s753 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 623 ms.
Stack based approach found an accepted trace after 154 steps with 0 reset with depth 155 and stack size 155 in 3 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-05 finished in 3656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2680 transition count 1841
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2121 transition count 1841
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 321 Pre rules applied. Total rules applied 1118 place count 2121 transition count 1520
Deduced a syphon composed of 321 places in 4 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3112 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3113 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3317 place count 1022 transition count 842
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3353 place count 1004 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3355 place count 1002 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3356 place count 1001 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3356 place count 1001 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3360 place count 999 transition count 838
Applied a total of 3360 rules in 406 ms. Remains 999 /2681 variables (removed 1682) and now considering 838/2401 (removed 1563) transitions.
// Phase 1: matrix 838 rows 999 cols
[2023-03-22 06:48:12] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:48:13] [INFO ] Implicit Places using invariants in 551 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 553 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2681 places, 838/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 836
Applied a total of 4 rules in 39 ms. Remains 995 /997 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 995 cols
[2023-03-22 06:48:13] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-22 06:48:13] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-22 06:48:13] [INFO ] Invariant cache hit.
[2023-03-22 06:48:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 06:48:15] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2681 places, 836/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2911 ms. Remains : 995/2681 places, 836/2401 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s378 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 719 ms.
Stack based approach found an accepted trace after 57 steps with 10 reset with depth 20 and stack size 17 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-07 finished in 3747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 240 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:48:16] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-22 06:48:17] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2023-03-22 06:48:17] [INFO ] Invariant cache hit.
[2023-03-22 06:48:20] [INFO ] Implicit Places using invariants and state equation in 3355 ms returned []
Implicit Place search using SMT with State Equation took 4583 ms to find 0 implicit places.
[2023-03-22 06:48:20] [INFO ] Invariant cache hit.
[2023-03-22 06:48:22] [INFO ] Dead Transitions using invariants and state equation in 1929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6752 ms. Remains : 2681/2681 places, 2401/2401 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1490 0), p1:(EQ s1943 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 50000 reset in 1918 ms.
Product exploration explored 100000 steps with 50000 reset in 1733 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-08 finished in 10807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2680 transition count 1842
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 2122 transition count 1841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 2121 transition count 1841
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 1118 place count 2121 transition count 1521
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1758 place count 1801 transition count 1521
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 0 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 3 with 1356 rules applied. Total rules applied 3114 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3115 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3117 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3319 place count 1021 transition count 841
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3353 place count 1004 transition count 841
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3355 place count 1002 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3356 place count 1001 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3356 place count 1001 transition count 837
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3360 place count 999 transition count 837
Applied a total of 3360 rules in 389 ms. Remains 999 /2681 variables (removed 1682) and now considering 837/2401 (removed 1564) transitions.
// Phase 1: matrix 837 rows 999 cols
[2023-03-22 06:48:27] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-22 06:48:27] [INFO ] Implicit Places using invariants in 562 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 564 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2681 places, 837/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 835
Applied a total of 4 rules in 39 ms. Remains 995 /997 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 995 cols
[2023-03-22 06:48:27] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:48:28] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-22 06:48:28] [INFO ] Invariant cache hit.
[2023-03-22 06:48:29] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2681 places, 835/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2854 ms. Remains : 995/2681 places, 835/2401 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s703 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17 reset in 583 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-09 finished in 3612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 2 out of 2681 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Applied a total of 0 rules in 255 ms. Remains 2681 /2681 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:48:30] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-22 06:48:31] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-22 06:48:31] [INFO ] Invariant cache hit.
[2023-03-22 06:48:34] [INFO ] Implicit Places using invariants and state equation in 3117 ms returned []
Implicit Place search using SMT with State Equation took 4071 ms to find 0 implicit places.
[2023-03-22 06:48:34] [INFO ] Invariant cache hit.
[2023-03-22 06:48:36] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5822 ms. Remains : 2681/2681 places, 2401/2401 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s136 1), p1:(EQ s2491 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-13 finished in 6026 ms.
All properties solved by simple procedures.
Total runtime 108757 ms.
ITS solved all properties within timeout

BK_STOP 1679467716556

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-040B, examination is LTLCardinality"
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-167903717300667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;