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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 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.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 860K 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 ShieldIIPt-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679440306529

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=ShieldIIPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 23:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:11:49] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-21 23:11:49] [INFO ] Transformed 3503 places.
[2023-03-21 23:11:49] [INFO ] Transformed 3253 transitions.
[2023-03-21 23:11:49] [INFO ] Found NUPN structural information;
[2023-03-21 23:11:49] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 541 places :
Symmetric choice reduction at 0 with 541 rule applications. Total rules 541 place count 2962 transition count 2712
Iterating global reduction 0 with 541 rules applied. Total rules applied 1082 place count 2962 transition count 2712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1083 place count 2961 transition count 2711
Iterating global reduction 0 with 1 rules applied. Total rules applied 1084 place count 2961 transition count 2711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1085 place count 2960 transition count 2710
Iterating global reduction 0 with 1 rules applied. Total rules applied 1086 place count 2960 transition count 2710
Applied a total of 1086 rules in 1720 ms. Remains 2960 /3503 variables (removed 543) and now considering 2710/3253 (removed 543) transitions.
// Phase 1: matrix 2710 rows 2960 cols
[2023-03-21 23:11:51] [INFO ] Computed 451 place invariants in 31 ms
[2023-03-21 23:11:52] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2023-03-21 23:11:52] [INFO ] Invariant cache hit.
[2023-03-21 23:11:56] [INFO ] Implicit Places using invariants and state equation in 4105 ms returned []
Implicit Place search using SMT with State Equation took 5544 ms to find 0 implicit places.
[2023-03-21 23:11:56] [INFO ] Invariant cache hit.
[2023-03-21 23:11:59] [INFO ] Dead Transitions using invariants and state equation in 2466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2960/3503 places, 2710/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9750 ms. Remains : 2960/3503 places, 2710/3253 transitions.
Support contains 29 out of 2960 places after structural reductions.
[2023-03-21 23:11:59] [INFO ] Flatten gal took : 204 ms
[2023-03-21 23:11:59] [INFO ] Flatten gal took : 105 ms
[2023-03-21 23:12:00] [INFO ] Input system was already deterministic with 2710 transitions.
Support contains 27 out of 2960 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 23:12:00] [INFO ] Invariant cache hit.
[2023-03-21 23:12:01] [INFO ] [Real]Absence check using 451 positive place invariants in 246 ms returned sat
[2023-03-21 23:12:01] [INFO ] After 1113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 23:12:02] [INFO ] [Nat]Absence check using 451 positive place invariants in 306 ms returned sat
[2023-03-21 23:12:06] [INFO ] After 3055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 23:12:07] [INFO ] Deduced a trap composed of 18 places in 1158 ms of which 25 ms to minimize.
[2023-03-21 23:12:08] [INFO ] Deduced a trap composed of 34 places in 981 ms of which 3 ms to minimize.
[2023-03-21 23:12:10] [INFO ] Deduced a trap composed of 19 places in 1112 ms of which 13 ms to minimize.
[2023-03-21 23:12:11] [INFO ] Deduced a trap composed of 22 places in 1127 ms of which 23 ms to minimize.
[2023-03-21 23:12:12] [INFO ] Deduced a trap composed of 17 places in 827 ms of which 1 ms to minimize.
[2023-03-21 23:12:13] [INFO ] Deduced a trap composed of 16 places in 848 ms of which 1 ms to minimize.
[2023-03-21 23:12:14] [INFO ] Deduced a trap composed of 27 places in 850 ms of which 6 ms to minimize.
[2023-03-21 23:12:15] [INFO ] Deduced a trap composed of 21 places in 715 ms of which 3 ms to minimize.
[2023-03-21 23:12:15] [INFO ] Deduced a trap composed of 26 places in 785 ms of which 2 ms to minimize.
[2023-03-21 23:12:16] [INFO ] Deduced a trap composed of 29 places in 793 ms of which 2 ms to minimize.
[2023-03-21 23:12:17] [INFO ] Deduced a trap composed of 31 places in 677 ms of which 2 ms to minimize.
[2023-03-21 23:12:18] [INFO ] Deduced a trap composed of 34 places in 691 ms of which 1 ms to minimize.
[2023-03-21 23:12:19] [INFO ] Deduced a trap composed of 27 places in 825 ms of which 1 ms to minimize.
[2023-03-21 23:12:20] [INFO ] Deduced a trap composed of 38 places in 660 ms of which 2 ms to minimize.
[2023-03-21 23:12:21] [INFO ] Deduced a trap composed of 35 places in 686 ms of which 2 ms to minimize.
[2023-03-21 23:12:21] [INFO ] Deduced a trap composed of 38 places in 639 ms of which 2 ms to minimize.
[2023-03-21 23:12:22] [INFO ] Deduced a trap composed of 37 places in 688 ms of which 2 ms to minimize.
[2023-03-21 23:12:23] [INFO ] Deduced a trap composed of 40 places in 669 ms of which 2 ms to minimize.
[2023-03-21 23:12:24] [INFO ] Deduced a trap composed of 34 places in 781 ms of which 1 ms to minimize.
[2023-03-21 23:12:25] [INFO ] Deduced a trap composed of 36 places in 694 ms of which 1 ms to minimize.
[2023-03-21 23:12:25] [INFO ] Deduced a trap composed of 34 places in 633 ms of which 2 ms to minimize.
[2023-03-21 23:12:26] [INFO ] Deduced a trap composed of 32 places in 582 ms of which 10 ms to minimize.
[2023-03-21 23:12:27] [INFO ] Deduced a trap composed of 29 places in 529 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-21 23:12:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:12:27] [INFO ] After 25389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 614 ms.
Support contains 15 out of 2960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2960 transition count 2117
Reduce places removed 593 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 594 rules applied. Total rules applied 1187 place count 2367 transition count 2116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1188 place count 2366 transition count 2116
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 392 Pre rules applied. Total rules applied 1188 place count 2366 transition count 1724
Deduced a syphon composed of 392 places in 3 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 3 with 784 rules applied. Total rules applied 1972 place count 1974 transition count 1724
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1975 place count 1971 transition count 1721
Iterating global reduction 3 with 3 rules applied. Total rules applied 1978 place count 1971 transition count 1721
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1978 place count 1971 transition count 1719
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1982 place count 1969 transition count 1719
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 2 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 3686 place count 1117 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3687 place count 1117 transition count 866
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 3689 place count 1116 transition count 865
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3891 place count 1015 transition count 931
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 3983 place count 969 transition count 962
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3984 place count 969 transition count 961
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 4033 place count 969 transition count 961
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4034 place count 968 transition count 960
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4036 place count 966 transition count 960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4036 place count 966 transition count 959
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4038 place count 965 transition count 959
Applied a total of 4038 rules in 827 ms. Remains 965 /2960 variables (removed 1995) and now considering 959/2710 (removed 1751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 965/2960 places, 959/2710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 959 rows 965 cols
[2023-03-21 23:12:29] [INFO ] Computed 449 place invariants in 5 ms
[2023-03-21 23:12:29] [INFO ] [Real]Absence check using 449 positive place invariants in 90 ms returned sat
[2023-03-21 23:12:29] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 23:12:29] [INFO ] [Nat]Absence check using 449 positive place invariants in 78 ms returned sat
[2023-03-21 23:12:30] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 23:12:30] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-21 23:12:38] [INFO ] After 7841ms SMT Verify possible using 353 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 23:12:45] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-21 23:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-21 23:12:46] [INFO ] After 15624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 8118 ms.
[2023-03-21 23:12:54] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 317 ms.
Support contains 12 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 959/959 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 965 transition count 958
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 964 transition count 958
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 4 place count 963 transition count 957
Applied a total of 4 rules in 46 ms. Remains 963 /965 variables (removed 2) and now considering 957/959 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 963/965 places, 957/959 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 92974 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92974 steps, saw 59106 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 957 rows 963 cols
[2023-03-21 23:12:58] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:12:58] [INFO ] [Real]Absence check using 449 positive place invariants in 126 ms returned sat
[2023-03-21 23:12:58] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 23:12:59] [INFO ] [Nat]Absence check using 449 positive place invariants in 198 ms returned sat
[2023-03-21 23:13:00] [INFO ] After 987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 23:13:00] [INFO ] State equation strengthened by 354 read => feed constraints.
[2023-03-21 23:13:09] [INFO ] After 9404ms SMT Verify possible using 354 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:13:09] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-03-21 23:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-21 23:13:10] [INFO ] After 10376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-21 23:13:11] [INFO ] After 12125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 454 ms.
Support contains 12 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 957/957 transitions.
Applied a total of 0 rules in 20 ms. Remains 963 /963 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 963/963 places, 957/957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 957/957 transitions.
Applied a total of 0 rules in 23 ms. Remains 963 /963 variables (removed 0) and now considering 957/957 (removed 0) transitions.
[2023-03-21 23:13:11] [INFO ] Invariant cache hit.
[2023-03-21 23:13:12] [INFO ] Implicit Places using invariants in 528 ms returned [952]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 531 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 962/963 places, 957/957 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 961 transition count 956
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 961 transition count 956
Applied a total of 2 rules in 38 ms. Remains 961 /962 variables (removed 1) and now considering 956/957 (removed 1) transitions.
// Phase 1: matrix 956 rows 961 cols
[2023-03-21 23:13:12] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:13:12] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-21 23:13:12] [INFO ] Invariant cache hit.
[2023-03-21 23:13:13] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-21 23:13:16] [INFO ] Implicit Places using invariants and state equation in 4276 ms returned []
Implicit Place search using SMT with State Equation took 4815 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 961/963 places, 956/957 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5407 ms. Remains : 961/963 places, 956/957 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 113600 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113600 steps, saw 71481 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-21 23:13:20] [INFO ] Invariant cache hit.
[2023-03-21 23:13:20] [INFO ] [Real]Absence check using 448 positive place invariants in 127 ms returned sat
[2023-03-21 23:13:20] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 23:13:21] [INFO ] [Nat]Absence check using 448 positive place invariants in 198 ms returned sat
[2023-03-21 23:13:22] [INFO ] After 884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 23:13:22] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-21 23:13:31] [INFO ] After 9441ms SMT Verify possible using 353 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:13:32] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-03-21 23:13:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-21 23:13:32] [INFO ] After 10036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-21 23:13:32] [INFO ] After 11867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 426 ms.
Support contains 12 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 956/956 transitions.
Applied a total of 0 rules in 18 ms. Remains 961 /961 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 961/961 places, 956/956 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 956/956 transitions.
Applied a total of 0 rules in 18 ms. Remains 961 /961 variables (removed 0) and now considering 956/956 (removed 0) transitions.
[2023-03-21 23:13:33] [INFO ] Invariant cache hit.
[2023-03-21 23:13:33] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-21 23:13:33] [INFO ] Invariant cache hit.
[2023-03-21 23:13:34] [INFO ] State equation strengthened by 353 read => feed constraints.
[2023-03-21 23:13:38] [INFO ] Implicit Places using invariants and state equation in 4426 ms returned []
Implicit Place search using SMT with State Equation took 4987 ms to find 0 implicit places.
[2023-03-21 23:13:38] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-21 23:13:38] [INFO ] Invariant cache hit.
[2023-03-21 23:13:38] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5687 ms. Remains : 961/961 places, 956/956 transitions.
Partial Free-agglomeration rule applied 215 times.
Drop transitions removed 215 transitions
Iterating global reduction 0 with 215 rules applied. Total rules applied 215 place count 961 transition count 956
Applied a total of 215 rules in 37 ms. Remains 961 /961 variables (removed 0) and now considering 956/956 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 956 rows 961 cols
[2023-03-21 23:13:38] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:13:39] [INFO ] [Real]Absence check using 448 positive place invariants in 120 ms returned sat
[2023-03-21 23:13:39] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 23:13:39] [INFO ] [Nat]Absence check using 448 positive place invariants in 98 ms returned sat
[2023-03-21 23:13:40] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 23:13:40] [INFO ] State equation strengthened by 211 read => feed constraints.
[2023-03-21 23:13:41] [INFO ] After 1379ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 23:13:42] [INFO ] After 2408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 617 ms.
[2023-03-21 23:13:43] [INFO ] After 4126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 799 stabilizing places and 799 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(X(G(p0))))'
Support contains 2 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2952 transition count 2702
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2952 transition count 2702
Applied a total of 16 rules in 337 ms. Remains 2952 /2960 variables (removed 8) and now considering 2702/2710 (removed 8) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-21 23:13:44] [INFO ] Computed 451 place invariants in 21 ms
[2023-03-21 23:13:45] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2023-03-21 23:13:45] [INFO ] Invariant cache hit.
[2023-03-21 23:13:48] [INFO ] Implicit Places using invariants and state equation in 3229 ms returned []
Implicit Place search using SMT with State Equation took 4423 ms to find 0 implicit places.
[2023-03-21 23:13:48] [INFO ] Invariant cache hit.
[2023-03-21 23:13:51] [INFO ] Dead Transitions using invariants and state equation in 2380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2960 places, 2702/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7141 ms. Remains : 2952/2960 places, 2702/2710 transitions.
Stuttering acceptance computed with spot in 408 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s2145 0) (EQ s859 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 252 steps with 0 reset in 12 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-00 finished in 7695 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 1 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2959 transition count 2111
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2361 transition count 2111
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1196 place count 2361 transition count 1715
Deduced a syphon composed of 396 places in 4 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1988 place count 1965 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1994 place count 1959 transition count 1709
Iterating global reduction 2 with 6 rules applied. Total rules applied 2000 place count 1959 transition count 1709
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2000 place count 1959 transition count 1704
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2010 place count 1954 transition count 1704
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3710 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3711 place count 1104 transition count 853
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 3713 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3915 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4011 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4013 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4015 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4015 place count 950 transition count 948
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 4017 place count 949 transition count 948
Applied a total of 4017 rules in 586 ms. Remains 949 /2960 variables (removed 2011) and now considering 948/2710 (removed 1762) transitions.
// Phase 1: matrix 948 rows 949 cols
[2023-03-21 23:13:52] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:13:52] [INFO ] Implicit Places using invariants in 487 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2960 places, 948/2710 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 947 transition count 947
Applied a total of 2 rules in 56 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2023-03-21 23:13:52] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:13:53] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-21 23:13:53] [INFO ] Invariant cache hit.
[2023-03-21 23:13:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:13:54] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2960 places, 947/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3065 ms. Remains : 947/2960 places, 947/2710 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s510 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-04 finished in 3134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2952 transition count 2702
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2952 transition count 2702
Applied a total of 16 rules in 410 ms. Remains 2952 /2960 variables (removed 8) and now considering 2702/2710 (removed 8) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-21 23:13:55] [INFO ] Computed 451 place invariants in 22 ms
[2023-03-21 23:13:56] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2023-03-21 23:13:56] [INFO ] Invariant cache hit.
[2023-03-21 23:13:59] [INFO ] Implicit Places using invariants and state equation in 3244 ms returned []
Implicit Place search using SMT with State Equation took 4586 ms to find 0 implicit places.
[2023-03-21 23:13:59] [INFO ] Invariant cache hit.
[2023-03-21 23:14:01] [INFO ] Dead Transitions using invariants and state equation in 2015 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2960 places, 2702/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7017 ms. Remains : 2952/2960 places, 2702/2710 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2316 0) (EQ s429 1)), p1:(AND (EQ s1429 0) (EQ s2336 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 3 reset in 811 ms.
Stack based approach found an accepted trace after 4013 steps with 0 reset with depth 4014 and stack size 4014 in 49 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-05 finished in 8125 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 U p2))))))'
Support contains 3 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 2959 transition count 2109
Reduce places removed 600 places and 0 transitions.
Iterating post reduction 1 with 600 rules applied. Total rules applied 1200 place count 2359 transition count 2109
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1200 place count 2359 transition count 1715
Deduced a syphon composed of 394 places in 3 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1988 place count 1965 transition count 1715
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1993 place count 1960 transition count 1710
Iterating global reduction 2 with 5 rules applied. Total rules applied 1998 place count 1960 transition count 1710
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1998 place count 1960 transition count 1706
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2006 place count 1956 transition count 1706
Performed 851 Post agglomeration using F-continuation condition.Transition count delta: 851
Deduced a syphon composed of 851 places in 1 ms
Reduce places removed 851 places and 0 transitions.
Iterating global reduction 2 with 1702 rules applied. Total rules applied 3708 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1105 transition count 854
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 3711 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3913 place count 1003 transition count 919
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4009 place count 955 transition count 952
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4011 place count 953 transition count 950
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4013 place count 951 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4013 place count 951 transition count 949
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 4015 place count 950 transition count 949
Applied a total of 4015 rules in 514 ms. Remains 950 /2960 variables (removed 2010) and now considering 949/2710 (removed 1761) transitions.
// Phase 1: matrix 949 rows 950 cols
[2023-03-21 23:14:03] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:14:03] [INFO ] Implicit Places using invariants in 561 ms returned [939]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 575 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/2960 places, 949/2710 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 948 transition count 948
Applied a total of 2 rules in 28 ms. Remains 948 /949 variables (removed 1) and now considering 948/949 (removed 1) transitions.
// Phase 1: matrix 948 rows 948 cols
[2023-03-21 23:14:03] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:14:04] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-21 23:14:04] [INFO ] Invariant cache hit.
[2023-03-21 23:14:05] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 948/2960 places, 948/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2884 ms. Remains : 948/2960 places, 948/2710 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s326 0), p2:(EQ s326 1), p1:(OR (EQ s344 0) (EQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-09 finished in 3224 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(!p1))||p0) U X(p2)))'
Support contains 6 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2953 transition count 2703
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2953 transition count 2703
Applied a total of 14 rules in 364 ms. Remains 2953 /2960 variables (removed 7) and now considering 2703/2710 (removed 7) transitions.
// Phase 1: matrix 2703 rows 2953 cols
[2023-03-21 23:14:06] [INFO ] Computed 451 place invariants in 19 ms
[2023-03-21 23:14:07] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2023-03-21 23:14:07] [INFO ] Invariant cache hit.
[2023-03-21 23:14:10] [INFO ] Implicit Places using invariants and state equation in 3093 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
[2023-03-21 23:14:10] [INFO ] Invariant cache hit.
[2023-03-21 23:14:13] [INFO ] Dead Transitions using invariants and state equation in 2288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2953/2960 places, 2703/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7007 ms. Remains : 2953/2960 places, 2703/2710 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2), p1, p1]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s2531 0) (EQ s387 1)), p1:(OR (EQ s2797 0) (EQ s891 1)), p2:(OR (EQ s149 0) (EQ s2664 1) (EQ s2531 0) (EQ s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1664 ms.
Product exploration explored 100000 steps with 50000 reset in 1599 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 9 factoid took 323 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-050B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-10 finished in 10993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2953 transition count 2703
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2953 transition count 2703
Applied a total of 14 rules in 382 ms. Remains 2953 /2960 variables (removed 7) and now considering 2703/2710 (removed 7) transitions.
// Phase 1: matrix 2703 rows 2953 cols
[2023-03-21 23:14:17] [INFO ] Computed 451 place invariants in 8 ms
[2023-03-21 23:14:18] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2023-03-21 23:14:18] [INFO ] Invariant cache hit.
[2023-03-21 23:14:22] [INFO ] Implicit Places using invariants and state equation in 3561 ms returned []
Implicit Place search using SMT with State Equation took 4740 ms to find 0 implicit places.
[2023-03-21 23:14:22] [INFO ] Invariant cache hit.
[2023-03-21 23:14:24] [INFO ] Dead Transitions using invariants and state equation in 2071 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2953/2960 places, 2703/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7201 ms. Remains : 2953/2960 places, 2703/2710 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-11 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 s2367 0) (EQ s2815 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 1560 ms.
Product exploration explored 100000 steps with 50000 reset in 1568 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 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 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-050B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-11 finished in 10590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2959 transition count 2111
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2361 transition count 2111
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1196 place count 2361 transition count 1717
Deduced a syphon composed of 394 places in 3 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1984 place count 1967 transition count 1717
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1991 place count 1960 transition count 1710
Iterating global reduction 2 with 7 rules applied. Total rules applied 1998 place count 1960 transition count 1710
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1998 place count 1960 transition count 1704
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2010 place count 1954 transition count 1704
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3702 place count 1108 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1108 transition count 857
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 3705 place count 1107 transition count 856
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3907 place count 1006 transition count 923
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4001 place count 959 transition count 954
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4003 place count 957 transition count 952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4005 place count 955 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4005 place count 955 transition count 951
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 4007 place count 954 transition count 951
Applied a total of 4007 rules in 450 ms. Remains 954 /2960 variables (removed 2006) and now considering 951/2710 (removed 1759) transitions.
// Phase 1: matrix 951 rows 954 cols
[2023-03-21 23:14:28] [INFO ] Computed 449 place invariants in 16 ms
[2023-03-21 23:14:28] [INFO ] Implicit Places using invariants in 582 ms returned [943]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 598 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 953/2960 places, 951/2710 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 950
Applied a total of 2 rules in 44 ms. Remains 952 /953 variables (removed 1) and now considering 950/951 (removed 1) transitions.
// Phase 1: matrix 950 rows 952 cols
[2023-03-21 23:14:28] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:14:29] [INFO ] Implicit Places using invariants in 626 ms returned []
[2023-03-21 23:14:29] [INFO ] Invariant cache hit.
[2023-03-21 23:14:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:30] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 952/2960 places, 950/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3082 ms. Remains : 952/2960 places, 950/2710 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s339 0) (EQ s494 1)), p1:(OR (EQ s578 0) (EQ s519 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 778 ms.
Product exploration explored 100000 steps with 0 reset in 966 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/952 stabilizing places and 4/950 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 (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 549 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:14:33] [INFO ] Invariant cache hit.
[2023-03-21 23:14:33] [INFO ] [Real]Absence check using 448 positive place invariants in 65 ms returned sat
[2023-03-21 23:14:34] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:14:34] [INFO ] [Nat]Absence check using 448 positive place invariants in 105 ms returned sat
[2023-03-21 23:14:34] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:35] [INFO ] After 109ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:35] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-21 23:14:35] [INFO ] After 1218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 950/950 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 952 transition count 949
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 952 transition count 949
Applied a total of 3 rules in 35 ms. Remains 952 /952 variables (removed 0) and now considering 949/950 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 952/952 places, 949/950 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 168779 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168779 steps, saw 103182 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 949 rows 952 cols
[2023-03-21 23:14:38] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:14:38] [INFO ] [Real]Absence check using 448 positive place invariants in 58 ms returned sat
[2023-03-21 23:14:39] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:14:39] [INFO ] [Nat]Absence check using 448 positive place invariants in 179 ms returned sat
[2023-03-21 23:14:40] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:40] [INFO ] After 129ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:40] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-21 23:14:40] [INFO ] After 1361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 53 ms.
Support contains 4 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 949/949 transitions.
Applied a total of 0 rules in 24 ms. Remains 952 /952 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 952/952 places, 949/949 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 949/949 transitions.
Applied a total of 0 rules in 18 ms. Remains 952 /952 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2023-03-21 23:14:40] [INFO ] Invariant cache hit.
[2023-03-21 23:14:41] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-21 23:14:41] [INFO ] Invariant cache hit.
[2023-03-21 23:14:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:42] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
[2023-03-21 23:14:42] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-21 23:14:42] [INFO ] Invariant cache hit.
[2023-03-21 23:14:43] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2797 ms. Remains : 952/952 places, 949/949 transitions.
Partial Free-agglomeration rule applied 105 times.
Drop transitions removed 105 transitions
Iterating global reduction 0 with 105 rules applied. Total rules applied 105 place count 952 transition count 949
Applied a total of 105 rules in 29 ms. Remains 952 /952 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 949 rows 952 cols
[2023-03-21 23:14:43] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:14:43] [INFO ] [Real]Absence check using 448 positive place invariants in 75 ms returned sat
[2023-03-21 23:14:44] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:14:44] [INFO ] [Nat]Absence check using 448 positive place invariants in 95 ms returned sat
[2023-03-21 23:14:45] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-21 23:14:45] [INFO ] After 100ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:45] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-21 23:14:45] [INFO ] After 1314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 580 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 950/950 transitions.
Applied a total of 0 rules in 49 ms. Remains 952 /952 variables (removed 0) and now considering 950/950 (removed 0) transitions.
// Phase 1: matrix 950 rows 952 cols
[2023-03-21 23:14:46] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:14:47] [INFO ] Implicit Places using invariants in 616 ms returned []
[2023-03-21 23:14:47] [INFO ] Invariant cache hit.
[2023-03-21 23:14:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:48] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2023-03-21 23:14:48] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-21 23:14:48] [INFO ] Invariant cache hit.
[2023-03-21 23:14:48] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2540 ms. Remains : 952/952 places, 950/950 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/952 stabilizing places and 4/950 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 (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 443 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:14:49] [INFO ] Invariant cache hit.
[2023-03-21 23:14:50] [INFO ] [Real]Absence check using 448 positive place invariants in 88 ms returned sat
[2023-03-21 23:14:50] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:14:50] [INFO ] [Nat]Absence check using 448 positive place invariants in 74 ms returned sat
[2023-03-21 23:14:51] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:51] [INFO ] After 90ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:51] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-21 23:14:51] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 950/950 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 952 transition count 949
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 952 transition count 949
Applied a total of 3 rules in 38 ms. Remains 952 /952 variables (removed 0) and now considering 949/950 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 952/952 places, 949/950 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 159691 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159691 steps, saw 97608 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 949 rows 952 cols
[2023-03-21 23:14:54] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:14:55] [INFO ] [Real]Absence check using 448 positive place invariants in 59 ms returned sat
[2023-03-21 23:14:55] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:14:55] [INFO ] [Nat]Absence check using 448 positive place invariants in 84 ms returned sat
[2023-03-21 23:14:56] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:56] [INFO ] After 134ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:14:56] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-21 23:14:56] [INFO ] After 1195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 949/949 transitions.
Applied a total of 0 rules in 34 ms. Remains 952 /952 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 952/952 places, 949/949 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 949/949 transitions.
Applied a total of 0 rules in 22 ms. Remains 952 /952 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2023-03-21 23:14:56] [INFO ] Invariant cache hit.
[2023-03-21 23:14:57] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-21 23:14:57] [INFO ] Invariant cache hit.
[2023-03-21 23:14:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-21 23:14:59] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2023-03-21 23:14:59] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 23:14:59] [INFO ] Invariant cache hit.
[2023-03-21 23:14:59] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2712 ms. Remains : 952/952 places, 949/949 transitions.
Partial Free-agglomeration rule applied 105 times.
Drop transitions removed 105 transitions
Iterating global reduction 0 with 105 rules applied. Total rules applied 105 place count 952 transition count 949
Applied a total of 105 rules in 29 ms. Remains 952 /952 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 949 rows 952 cols
[2023-03-21 23:14:59] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:15:00] [INFO ] [Real]Absence check using 448 positive place invariants in 139 ms returned sat
[2023-03-21 23:15:00] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:15:00] [INFO ] [Nat]Absence check using 448 positive place invariants in 114 ms returned sat
[2023-03-21 23:15:01] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:15:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-21 23:15:01] [INFO ] After 92ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:15:01] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-21 23:15:01] [INFO ] After 1352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 642 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 802 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-12 finished in 35934 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 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 598 place count 2959 transition count 2111
Reduce places removed 598 places and 0 transitions.
Iterating post reduction 1 with 598 rules applied. Total rules applied 1196 place count 2361 transition count 2111
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1196 place count 2361 transition count 1717
Deduced a syphon composed of 394 places in 2 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1984 place count 1967 transition count 1717
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1991 place count 1960 transition count 1710
Iterating global reduction 2 with 7 rules applied. Total rules applied 1998 place count 1960 transition count 1710
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1998 place count 1960 transition count 1704
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2010 place count 1954 transition count 1704
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3710 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3711 place count 1104 transition count 853
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 3713 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3915 place count 1002 transition count 918
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4009 place count 955 transition count 949
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4011 place count 953 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4013 place count 951 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4013 place count 951 transition count 946
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 4015 place count 950 transition count 946
Applied a total of 4015 rules in 488 ms. Remains 950 /2960 variables (removed 2010) and now considering 946/2710 (removed 1764) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-21 23:15:04] [INFO ] Computed 449 place invariants in 1 ms
[2023-03-21 23:15:04] [INFO ] Implicit Places using invariants in 927 ms returned [939]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 928 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 949/2960 places, 946/2710 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 948 transition count 945
Applied a total of 2 rules in 28 ms. Remains 948 /949 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 948 cols
[2023-03-21 23:15:04] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:15:05] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-21 23:15:05] [INFO ] Invariant cache hit.
[2023-03-21 23:15:06] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 948/2960 places, 945/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3256 ms. Remains : 948/2960 places, 945/2710 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s915 0) (EQ s212 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 95 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-14 finished in 3332 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((p0||G(p1)))))'
Support contains 3 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2951 transition count 2701
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2951 transition count 2701
Applied a total of 18 rules in 378 ms. Remains 2951 /2960 variables (removed 9) and now considering 2701/2710 (removed 9) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-21 23:15:07] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-21 23:15:08] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2023-03-21 23:15:08] [INFO ] Invariant cache hit.
[2023-03-21 23:15:11] [INFO ] Implicit Places using invariants and state equation in 2966 ms returned []
Implicit Place search using SMT with State Equation took 4260 ms to find 0 implicit places.
[2023-03-21 23:15:11] [INFO ] Invariant cache hit.
[2023-03-21 23:15:13] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2960 places, 2701/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6493 ms. Remains : 2951/2960 places, 2701/2710 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s2574 1), p0:(AND (EQ s2442 0) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-15 finished in 6751 ms.
All properties solved by simple procedures.
Total runtime 204737 ms.
ITS solved all properties within timeout

BK_STOP 1679440513862

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ShieldIIPt-PT-050B"
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 ShieldIIPt-PT-050B, 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-167903716900331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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