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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679428694220

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:58:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:58:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:58:18] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-21 19:58:18] [INFO ] Transformed 3003 places.
[2023-03-21 19:58:18] [INFO ] Transformed 2953 transitions.
[2023-03-21 19:58:18] [INFO ] Found NUPN structural information;
[2023-03-21 19:58:18] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 661 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 347 places :
Symmetric choice reduction at 0 with 347 rule applications. Total rules 347 place count 2656 transition count 2606
Iterating global reduction 0 with 347 rules applied. Total rules applied 694 place count 2656 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 695 place count 2655 transition count 2605
Iterating global reduction 0 with 1 rules applied. Total rules applied 696 place count 2655 transition count 2605
Applied a total of 696 rules in 966 ms. Remains 2655 /3003 variables (removed 348) and now considering 2605/2953 (removed 348) transitions.
// Phase 1: matrix 2605 rows 2655 cols
[2023-03-21 19:58:20] [INFO ] Computed 451 place invariants in 38 ms
[2023-03-21 19:58:22] [INFO ] Implicit Places using invariants in 2773 ms returned []
[2023-03-21 19:58:22] [INFO ] Invariant cache hit.
[2023-03-21 19:58:29] [INFO ] Implicit Places using invariants and state equation in 6666 ms returned []
Implicit Place search using SMT with State Equation took 9512 ms to find 0 implicit places.
[2023-03-21 19:58:29] [INFO ] Invariant cache hit.
[2023-03-21 19:58:32] [INFO ] Dead Transitions using invariants and state equation in 2652 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2655/3003 places, 2605/2953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13147 ms. Remains : 2655/3003 places, 2605/2953 transitions.
Support contains 44 out of 2655 places after structural reductions.
[2023-03-21 19:58:32] [INFO ] Flatten gal took : 306 ms
[2023-03-21 19:58:32] [INFO ] Flatten gal took : 208 ms
[2023-03-21 19:58:33] [INFO ] Input system was already deterministic with 2605 transitions.
Support contains 42 out of 2655 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
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
Running SMT prover for 7 properties.
[2023-03-21 19:58:34] [INFO ] Invariant cache hit.
[2023-03-21 19:58:35] [INFO ] After 877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 19:58:36] [INFO ] [Nat]Absence check using 451 positive place invariants in 500 ms returned sat
[2023-03-21 19:58:39] [INFO ] After 2857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 19:58:41] [INFO ] Deduced a trap composed of 20 places in 1311 ms of which 12 ms to minimize.
[2023-03-21 19:58:45] [INFO ] Deduced a trap composed of 22 places in 4848 ms of which 53 ms to minimize.
[2023-03-21 19:58:47] [INFO ] Deduced a trap composed of 21 places in 1592 ms of which 2 ms to minimize.
[2023-03-21 19:58:48] [INFO ] Deduced a trap composed of 23 places in 671 ms of which 3 ms to minimize.
[2023-03-21 19:58:49] [INFO ] Deduced a trap composed of 16 places in 1185 ms of which 15 ms to minimize.
[2023-03-21 19:58:50] [INFO ] Deduced a trap composed of 26 places in 819 ms of which 1 ms to minimize.
[2023-03-21 19:58:51] [INFO ] Deduced a trap composed of 20 places in 765 ms of which 2 ms to minimize.
[2023-03-21 19:58:52] [INFO ] Deduced a trap composed of 27 places in 686 ms of which 1 ms to minimize.
[2023-03-21 19:58:53] [INFO ] Deduced a trap composed of 30 places in 766 ms of which 3 ms to minimize.
[2023-03-21 19:58:54] [INFO ] Deduced a trap composed of 37 places in 857 ms of which 1 ms to minimize.
[2023-03-21 19:58:55] [INFO ] Deduced a trap composed of 28 places in 1524 ms of which 24 ms to minimize.
[2023-03-21 19:58:57] [INFO ] Deduced a trap composed of 25 places in 1578 ms of which 4 ms to minimize.
[2023-03-21 19:58:58] [INFO ] Deduced a trap composed of 26 places in 695 ms of which 1 ms to minimize.
[2023-03-21 19:58:59] [INFO ] Deduced a trap composed of 28 places in 1025 ms of which 2 ms to minimize.
[2023-03-21 19:59:00] [INFO ] Deduced a trap composed of 27 places in 1047 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 19:59:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:59:00] [INFO ] After 25764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 979 ms.
Support contains 14 out of 2655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2655 transition count 2354
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2404 transition count 2354
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 502 place count 2404 transition count 2104
Deduced a syphon composed of 250 places in 24 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1002 place count 2154 transition count 2104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1005 place count 2151 transition count 2101
Iterating global reduction 2 with 3 rules applied. Total rules applied 1008 place count 2151 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1008 place count 2151 transition count 2099
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1012 place count 2149 transition count 2099
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 7 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2796 place count 1257 transition count 1207
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 337 times.
Drop transitions removed 337 transitions
Iterating global reduction 2 with 337 rules applied. Total rules applied 3133 place count 1257 transition count 1207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3134 place count 1256 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3135 place count 1255 transition count 1206
Applied a total of 3135 rules in 1094 ms. Remains 1255 /2655 variables (removed 1400) and now considering 1206/2605 (removed 1399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 1255/2655 places, 1206/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1206 rows 1255 cols
[2023-03-21 19:59:03] [INFO ] Computed 450 place invariants in 81 ms
[2023-03-21 19:59:03] [INFO ] [Real]Absence check using 442 positive place invariants in 66 ms returned sat
[2023-03-21 19:59:03] [INFO ] [Real]Absence check using 442 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-21 19:59:04] [INFO ] After 1065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:59:04] [INFO ] [Nat]Absence check using 442 positive place invariants in 150 ms returned sat
[2023-03-21 19:59:04] [INFO ] [Nat]Absence check using 442 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-21 19:59:05] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:59:06] [INFO ] Deduced a trap composed of 11 places in 878 ms of which 23 ms to minimize.
[2023-03-21 19:59:06] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-21 19:59:07] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2023-03-21 19:59:07] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-21 19:59:07] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-21 19:59:07] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2023-03-21 19:59:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1893 ms
[2023-03-21 19:59:07] [INFO ] After 2934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-21 19:59:07] [INFO ] After 3419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1206/1206 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 1255 transition count 1205
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 1254 transition count 1205
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 1250 transition count 1201
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 1250 transition count 1201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1249 transition count 1200
Applied a total of 20 rules in 158 ms. Remains 1249 /1255 variables (removed 6) and now considering 1200/1206 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 1249/1255 places, 1200/1206 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 63173 steps, run visited all 1 properties in 797 ms. (steps per millisecond=79 )
Probabilistic random walk after 63173 steps, saw 62343 distinct states, run finished after 798 ms. (steps per millisecond=79 ) properties seen :1
FORMULA ShieldIIPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPs-PT-050B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 601 stabilizing places and 601 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(p0)&&F(p1))||X(G(p0))))'
Support contains 2 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 408 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-21 19:59:10] [INFO ] Computed 451 place invariants in 61 ms
[2023-03-21 19:59:13] [INFO ] Implicit Places using invariants in 3855 ms returned []
[2023-03-21 19:59:13] [INFO ] Invariant cache hit.
[2023-03-21 19:59:19] [INFO ] Implicit Places using invariants and state equation in 5263 ms returned []
Implicit Place search using SMT with State Equation took 9153 ms to find 0 implicit places.
[2023-03-21 19:59:19] [INFO ] Invariant cache hit.
[2023-03-21 19:59:21] [INFO ] Dead Transitions using invariants and state equation in 2359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11923 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 495 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1076 1), p0:(NEQ s1603 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 2124 ms.
Product exploration explored 100000 steps with 50000 reset in 1909 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/2652 stabilizing places and 599/2602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-00 finished in 16925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 359 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
[2023-03-21 19:59:26] [INFO ] Invariant cache hit.
[2023-03-21 19:59:28] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2023-03-21 19:59:28] [INFO ] Invariant cache hit.
[2023-03-21 19:59:31] [INFO ] Implicit Places using invariants and state equation in 3501 ms returned []
Implicit Place search using SMT with State Equation took 4794 ms to find 0 implicit places.
[2023-03-21 19:59:31] [INFO ] Invariant cache hit.
[2023-03-21 19:59:33] [INFO ] Dead Transitions using invariants and state equation in 2309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7487 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2248 1) (EQ s2270 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-01 finished in 7670 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 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 396 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
[2023-03-21 19:59:34] [INFO ] Invariant cache hit.
[2023-03-21 19:59:35] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2023-03-21 19:59:35] [INFO ] Invariant cache hit.
[2023-03-21 19:59:39] [INFO ] Implicit Places using invariants and state equation in 4306 ms returned []
Implicit Place search using SMT with State Equation took 5446 ms to find 0 implicit places.
[2023-03-21 19:59:39] [INFO ] Invariant cache hit.
[2023-03-21 19:59:42] [INFO ] Dead Transitions using invariants and state equation in 2197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8041 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s307 0), p1:(OR (EQ s356 0) (EQ s2329 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1859 ms.
Product exploration explored 100000 steps with 50000 reset in 1923 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-050B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-050B-LTLFireability-02 finished in 12204 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||X((G(!p1) U (p0&&G(!p1))))))))'
Support contains 4 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2654 transition count 2354
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2404 transition count 2354
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2404 transition count 2103
Deduced a syphon composed of 251 places in 7 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2153 transition count 2103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1005 place count 2150 transition count 2100
Iterating global reduction 2 with 3 rules applied. Total rules applied 1008 place count 2150 transition count 2100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1008 place count 2150 transition count 2099
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 4 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2796 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2798 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 1253 transition count 1204
Applied a total of 2799 rules in 641 ms. Remains 1253 /2655 variables (removed 1402) and now considering 1204/2605 (removed 1401) transitions.
// Phase 1: matrix 1204 rows 1253 cols
[2023-03-21 19:59:47] [INFO ] Computed 450 place invariants in 8 ms
[2023-03-21 19:59:47] [INFO ] Implicit Places using invariants in 984 ms returned []
[2023-03-21 19:59:47] [INFO ] Invariant cache hit.
[2023-03-21 19:59:49] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
[2023-03-21 19:59:50] [INFO ] Redundant transitions in 424 ms returned [1203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-21 19:59:50] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 19:59:50] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/2655 places, 1203/2605 transitions.
Applied a total of 0 rules in 39 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4663 ms. Remains : 1253/2655 places, 1203/2605 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1003 1), p1:(AND (EQ s1012 1) (EQ s1019 1) (EQ s1030 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2592 steps with 0 reset in 44 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-03 finished in 4917 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)||(X(p2)&&p1))))'
Support contains 5 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2653 transition count 2603
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2653 transition count 2603
Applied a total of 4 rules in 331 ms. Remains 2653 /2655 variables (removed 2) and now considering 2603/2605 (removed 2) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-21 19:59:51] [INFO ] Computed 451 place invariants in 22 ms
[2023-03-21 19:59:53] [INFO ] Implicit Places using invariants in 1503 ms returned []
[2023-03-21 19:59:53] [INFO ] Invariant cache hit.
[2023-03-21 19:59:56] [INFO ] Implicit Places using invariants and state equation in 3553 ms returned []
Implicit Place search using SMT with State Equation took 5067 ms to find 0 implicit places.
[2023-03-21 19:59:56] [INFO ] Invariant cache hit.
[2023-03-21 19:59:58] [INFO ] Dead Transitions using invariants and state equation in 1940 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2655 places, 2603/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7342 ms. Remains : 2653/2655 places, 2603/2605 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s1018 1), p1:(AND (EQ s1324 1) (EQ s1340 1) (EQ s1349 1)), p2:(EQ s2185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 27151 steps with 5 reset in 269 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-04 finished in 7758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2653 transition count 2603
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2653 transition count 2603
Applied a total of 4 rules in 357 ms. Remains 2653 /2655 variables (removed 2) and now considering 2603/2605 (removed 2) transitions.
// Phase 1: matrix 2603 rows 2653 cols
[2023-03-21 19:59:59] [INFO ] Computed 451 place invariants in 21 ms
[2023-03-21 20:00:00] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-21 20:00:00] [INFO ] Invariant cache hit.
[2023-03-21 20:00:04] [INFO ] Implicit Places using invariants and state equation in 3882 ms returned []
Implicit Place search using SMT with State Equation took 5061 ms to find 0 implicit places.
[2023-03-21 20:00:04] [INFO ] Invariant cache hit.
[2023-03-21 20:00:06] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2653/2655 places, 2603/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7734 ms. Remains : 2653/2655 places, 2603/2605 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1524 1) (EQ s1539 1)), p1:(EQ s1397 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-05 finished in 7927 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)&&F(p1)))'
Support contains 2 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 4 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 2802 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2804 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2805 place count 1250 transition count 1201
Applied a total of 2805 rules in 806 ms. Remains 1250 /2655 variables (removed 1405) and now considering 1201/2605 (removed 1404) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2023-03-21 20:00:07] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-21 20:00:09] [INFO ] Implicit Places using invariants in 1374 ms returned []
[2023-03-21 20:00:09] [INFO ] Invariant cache hit.
[2023-03-21 20:00:11] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 3345 ms to find 0 implicit places.
[2023-03-21 20:00:11] [INFO ] Redundant transitions in 144 ms returned [1200]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2023-03-21 20:00:11] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 20:00:11] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/2655 places, 1200/2605 transitions.
Applied a total of 0 rules in 61 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5124 ms. Remains : 1250/2655 places, 1200/2605 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s480 1), p0:(EQ s701 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2674 steps with 0 reset in 25 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-08 finished in 5355 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)||G(p2))))'
Support contains 4 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 6 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1006 place count 2150 transition count 2100
Iterating global reduction 2 with 2 rules applied. Total rules applied 1008 place count 2150 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1008 place count 2150 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1012 place count 2148 transition count 2098
Performed 890 Post agglomeration using F-continuation condition.Transition count delta: 890
Deduced a syphon composed of 890 places in 4 ms
Reduce places removed 890 places and 0 transitions.
Iterating global reduction 2 with 1780 rules applied. Total rules applied 2792 place count 1258 transition count 1208
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2794 place count 1256 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 1255 transition count 1206
Applied a total of 2795 rules in 528 ms. Remains 1255 /2655 variables (removed 1400) and now considering 1206/2605 (removed 1399) transitions.
// Phase 1: matrix 1206 rows 1255 cols
[2023-03-21 20:00:12] [INFO ] Computed 450 place invariants in 4 ms
[2023-03-21 20:00:13] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-21 20:00:13] [INFO ] Invariant cache hit.
[2023-03-21 20:00:15] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2371 ms to find 0 implicit places.
[2023-03-21 20:00:15] [INFO ] Redundant transitions in 228 ms returned [1205]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-21 20:00:15] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 20:00:16] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1255/2655 places, 1205/2605 transitions.
Applied a total of 0 rules in 34 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3904 ms. Remains : 1255/2655 places, 1205/2605 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s164 0) (EQ s186 0)), p1:(EQ s656 1), p2:(EQ s695 1)], nbAcceptance=3, 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 39 reset in 993 ms.
Product exploration explored 100000 steps with 39 reset in 1249 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/1255 stabilizing places and 3/1205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 1395 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) 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 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-21 20:00:20] [INFO ] Invariant cache hit.
[2023-03-21 20:00:20] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 20:00:21] [INFO ] [Nat]Absence check using 450 positive place invariants in 63 ms returned sat
[2023-03-21 20:00:22] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 20:00:22] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-21 20:00:22] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-21 20:00:22] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2023-03-21 20:00:23] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-21 20:00:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 806 ms
[2023-03-21 20:00:23] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-21 20:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-21 20:00:23] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-21 20:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-21 20:00:24] [INFO ] After 2731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-21 20:00:24] [INFO ] After 3573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 258 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1255 transition count 1205
Applied a total of 298 rules in 78 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-21 20:00:25] [INFO ] Computed 450 place invariants in 13 ms
[2023-03-21 20:00:25] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:00:25] [INFO ] [Nat]Absence check using 450 positive place invariants in 74 ms returned sat
[2023-03-21 20:00:26] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:00:27] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2023-03-21 20:00:27] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-21 20:00:27] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-21 20:00:27] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-21 20:00:27] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-21 20:00:28] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-21 20:00:28] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-21 20:00:28] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-21 20:00:28] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-21 20:00:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1820 ms
[2023-03-21 20:00:29] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-21 20:00:29] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-21 20:00:29] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-21 20:00:29] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2023-03-21 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 850 ms
[2023-03-21 20:00:30] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 27 ms to minimize.
[2023-03-21 20:00:30] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2023-03-21 20:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2023-03-21 20:00:30] [INFO ] After 4176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-21 20:00:30] [INFO ] After 4866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 198 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 33 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 20:00:31] [INFO ] Invariant cache hit.
[2023-03-21 20:00:31] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:00:32] [INFO ] [Nat]Absence check using 450 positive place invariants in 115 ms returned sat
[2023-03-21 20:00:33] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:00:33] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2023-03-21 20:00:33] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 1 ms to minimize.
[2023-03-21 20:00:33] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-21 20:00:34] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-21 20:00:34] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2023-03-21 20:00:34] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 14 ms to minimize.
[2023-03-21 20:00:34] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-21 20:00:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1591 ms
[2023-03-21 20:00:35] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2023-03-21 20:00:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-21 20:00:35] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 13 ms to minimize.
[2023-03-21 20:00:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2023-03-21 20:00:35] [INFO ] After 3037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-03-21 20:00:35] [INFO ] After 3866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 96 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 31 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 136601 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136601 steps, saw 134501 distinct states, run finished after 3006 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 20:00:39] [INFO ] Invariant cache hit.
[2023-03-21 20:00:39] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:00:39] [INFO ] [Nat]Absence check using 450 positive place invariants in 74 ms returned sat
[2023-03-21 20:00:40] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:00:41] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-03-21 20:00:41] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-03-21 20:00:41] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 0 ms to minimize.
[2023-03-21 20:00:41] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-21 20:00:41] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-21 20:00:42] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-21 20:00:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-21 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1382 ms
[2023-03-21 20:00:42] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 9 ms to minimize.
[2023-03-21 20:00:42] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-21 20:00:43] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 6 ms to minimize.
[2023-03-21 20:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 589 ms
[2023-03-21 20:00:43] [INFO ] After 3341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-21 20:00:43] [INFO ] After 3956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 30 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 47 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-21 20:00:43] [INFO ] Invariant cache hit.
[2023-03-21 20:00:44] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-21 20:00:44] [INFO ] Invariant cache hit.
[2023-03-21 20:00:46] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
[2023-03-21 20:00:46] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-21 20:00:46] [INFO ] Invariant cache hit.
[2023-03-21 20:00:47] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3927 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 51 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-21 20:00:47] [INFO ] Invariant cache hit.
[2023-03-21 20:00:47] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:00:48] [INFO ] [Nat]Absence check using 450 positive place invariants in 82 ms returned sat
[2023-03-21 20:00:50] [INFO ] After 2105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:00:50] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 14 ms to minimize.
[2023-03-21 20:00:50] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-03-21 20:00:51] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 4 ms to minimize.
[2023-03-21 20:00:51] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-21 20:00:51] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 3 ms to minimize.
[2023-03-21 20:00:51] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-21 20:00:51] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 26 ms to minimize.
[2023-03-21 20:00:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1495 ms
[2023-03-21 20:00:52] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-21 20:00:52] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-21 20:00:52] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-21 20:00:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 650 ms
[2023-03-21 20:00:52] [INFO ] After 4518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-21 20:00:53] [INFO ] After 5242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1548 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 56 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-21 20:00:54] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-21 20:00:55] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-21 20:00:55] [INFO ] Invariant cache hit.
[2023-03-21 20:00:57] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2023-03-21 20:00:57] [INFO ] Redundant transitions in 203 ms returned []
[2023-03-21 20:00:57] [INFO ] Invariant cache hit.
[2023-03-21 20:00:58] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3437 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/1255 stabilizing places and 3/1205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 1388 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 20:01:00] [INFO ] Invariant cache hit.
[2023-03-21 20:01:00] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:01:01] [INFO ] [Nat]Absence check using 450 positive place invariants in 75 ms returned sat
[2023-03-21 20:01:02] [INFO ] After 933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:01:02] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2023-03-21 20:01:02] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-21 20:01:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2023-03-21 20:01:02] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-21 20:01:02] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-21 20:01:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-03-21 20:01:03] [INFO ] After 1979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-21 20:01:03] [INFO ] After 2681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 162 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Partial Free-agglomeration rule applied 298 times.
Drop transitions removed 298 transitions
Iterating global reduction 0 with 298 rules applied. Total rules applied 298 place count 1255 transition count 1205
Applied a total of 298 rules in 69 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 90013 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 90013 steps, saw 88791 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-21 20:01:07] [INFO ] Computed 450 place invariants in 7 ms
[2023-03-21 20:01:07] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:01:08] [INFO ] [Nat]Absence check using 450 positive place invariants in 109 ms returned sat
[2023-03-21 20:01:09] [INFO ] After 1356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:01:09] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:01:10] [INFO ] Deduced a trap composed of 6 places in 574 ms of which 0 ms to minimize.
[2023-03-21 20:01:11] [INFO ] Deduced a trap composed of 6 places in 554 ms of which 1 ms to minimize.
[2023-03-21 20:01:11] [INFO ] Deduced a trap composed of 9 places in 447 ms of which 0 ms to minimize.
[2023-03-21 20:01:12] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 0 ms to minimize.
[2023-03-21 20:01:12] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2023-03-21 20:01:12] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-21 20:01:12] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-21 20:01:12] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-21 20:01:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3135 ms
[2023-03-21 20:01:13] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 0 ms to minimize.
[2023-03-21 20:01:13] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2023-03-21 20:01:13] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-21 20:01:13] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-21 20:01:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 853 ms
[2023-03-21 20:01:13] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2023-03-21 20:01:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-21 20:01:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-21 20:01:14] [INFO ] After 5974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 229 ms.
[2023-03-21 20:01:14] [INFO ] After 6853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 159 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 30 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 30 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2023-03-21 20:01:14] [INFO ] Invariant cache hit.
[2023-03-21 20:01:15] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2023-03-21 20:01:15] [INFO ] Invariant cache hit.
[2023-03-21 20:01:17] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 3212 ms to find 0 implicit places.
[2023-03-21 20:01:17] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-21 20:01:17] [INFO ] Invariant cache hit.
[2023-03-21 20:01:18] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4192 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 29 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-21 20:01:18] [INFO ] Invariant cache hit.
[2023-03-21 20:01:19] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:01:19] [INFO ] [Nat]Absence check using 450 positive place invariants in 145 ms returned sat
[2023-03-21 20:01:20] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:01:20] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2023-03-21 20:01:20] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-21 20:01:21] [INFO ] Deduced a trap composed of 16 places in 519 ms of which 1 ms to minimize.
[2023-03-21 20:01:21] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-21 20:01:21] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-21 20:01:21] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2023-03-21 20:01:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1569 ms
[2023-03-21 20:01:22] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-21 20:01:22] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2023-03-21 20:01:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2023-03-21 20:01:22] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2023-03-21 20:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-21 20:01:22] [INFO ] After 3406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-21 20:01:23] [INFO ] After 4070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1339 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 39 reset in 1068 ms.
Product exploration explored 100000 steps with 39 reset in 1257 ms.
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1255/1255 places, 1205/1205 transitions.
Applied a total of 0 rules in 32 ms. Remains 1255 /1255 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
// Phase 1: matrix 1205 rows 1255 cols
[2023-03-21 20:01:27] [INFO ] Computed 450 place invariants in 10 ms
[2023-03-21 20:01:27] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-21 20:01:27] [INFO ] Invariant cache hit.
[2023-03-21 20:01:29] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2663 ms to find 0 implicit places.
[2023-03-21 20:01:29] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-21 20:01:29] [INFO ] Invariant cache hit.
[2023-03-21 20:01:30] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3969 ms. Remains : 1255/1255 places, 1205/1205 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-09 finished in 78971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 5 out of 2655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2652 transition count 2602
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2652 transition count 2602
Applied a total of 6 rules in 409 ms. Remains 2652 /2655 variables (removed 3) and now considering 2602/2605 (removed 3) transitions.
// Phase 1: matrix 2602 rows 2652 cols
[2023-03-21 20:01:31] [INFO ] Computed 451 place invariants in 7 ms
[2023-03-21 20:01:32] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-21 20:01:32] [INFO ] Invariant cache hit.
[2023-03-21 20:01:34] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2023-03-21 20:01:34] [INFO ] Invariant cache hit.
[2023-03-21 20:01:36] [INFO ] Dead Transitions using invariants and state equation in 2518 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2652/2655 places, 2602/2605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5565 ms. Remains : 2652/2655 places, 2602/2605 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s2361 0) (EQ s2369 0) (EQ s2390 0)), p0:(AND (EQ s2523 1) (EQ s2567 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19314 steps with 3 reset in 252 ms.
FORMULA ShieldIIPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050B-LTLFireability-10 finished in 6068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 9 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 4 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 2798 place count 1255 transition count 1205
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2800 place count 1253 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 1252 transition count 1203
Applied a total of 2801 rules in 494 ms. Remains 1252 /2655 variables (removed 1403) and now considering 1203/2605 (removed 1402) transitions.
// Phase 1: matrix 1203 rows 1252 cols
[2023-03-21 20:01:37] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 20:01:38] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-21 20:01:38] [INFO ] Invariant cache hit.
[2023-03-21 20:01:41] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3280 ms to find 0 implicit places.
[2023-03-21 20:01:41] [INFO ] Redundant transitions in 202 ms returned [1202]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-21 20:01:41] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-21 20:01:42] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/2655 places, 1202/2605 transitions.
Applied a total of 0 rules in 31 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4813 ms. Remains : 1252/2655 places, 1202/2605 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s1054 1), p1:(OR (NEQ s833 1) (NEQ s848 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 128 reset in 880 ms.
Product exploration explored 100000 steps with 154 reset in 1184 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1252 stabilizing places and 2/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 396 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 765 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 391 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 32 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-21 20:01:45] [INFO ] Invariant cache hit.
[2023-03-21 20:01:46] [INFO ] Implicit Places using invariants in 887 ms returned []
[2023-03-21 20:01:46] [INFO ] Invariant cache hit.
[2023-03-21 20:01:48] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
[2023-03-21 20:01:48] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-21 20:01:48] [INFO ] Invariant cache hit.
[2023-03-21 20:01:49] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3600 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1252 stabilizing places and 2/1202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 392 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 805 steps, including 0 resets, run visited all 2 properties in 30 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 547 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 130 reset in 1036 ms.
Product exploration explored 100000 steps with 164 reset in 1115 ms.
Support contains 3 out of 1252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 78 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-21 20:01:53] [INFO ] Invariant cache hit.
[2023-03-21 20:01:54] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-21 20:01:54] [INFO ] Invariant cache hit.
[2023-03-21 20:01:56] [INFO ] Implicit Places using invariants and state equation in 2315 ms returned []
Implicit Place search using SMT with State Equation took 3081 ms to find 0 implicit places.
[2023-03-21 20:01:56] [INFO ] Redundant transitions in 267 ms returned []
[2023-03-21 20:01:56] [INFO ] Invariant cache hit.
[2023-03-21 20:01:57] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4642 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-12 finished in 20728 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 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 893 Post agglomeration using F-continuation condition.Transition count delta: 893
Deduced a syphon composed of 893 places in 4 ms
Reduce places removed 893 places and 0 transitions.
Iterating global reduction 2 with 1786 rules applied. Total rules applied 2800 place count 1254 transition count 1204
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2802 place count 1252 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2803 place count 1251 transition count 1202
Applied a total of 2803 rules in 526 ms. Remains 1251 /2655 variables (removed 1404) and now considering 1202/2605 (removed 1403) transitions.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-21 20:01:58] [INFO ] Computed 450 place invariants in 2 ms
[2023-03-21 20:01:59] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-21 20:01:59] [INFO ] Invariant cache hit.
[2023-03-21 20:02:01] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2023-03-21 20:02:01] [INFO ] Redundant transitions in 190 ms returned [1201]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-21 20:02:01] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 20:02:02] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/2655 places, 1201/2605 transitions.
Applied a total of 0 rules in 39 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4427 ms. Remains : 1251/2655 places, 1201/2605 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s678 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27219 reset in 1243 ms.
Product exploration explored 100000 steps with 27167 reset in 1319 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1251 stabilizing places and 2/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 292 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-21 20:02:05] [INFO ] Invariant cache hit.
[2023-03-21 20:02:07] [INFO ] [Real]Absence check using 450 positive place invariants in 413 ms returned sat
[2023-03-21 20:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:02:10] [INFO ] [Real]Absence check using state equation in 3388 ms returned sat
[2023-03-21 20:02:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 20:02:11] [INFO ] [Nat]Absence check using 450 positive place invariants in 372 ms returned sat
[2023-03-21 20:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 20:02:16] [INFO ] [Nat]Absence check using state equation in 4361 ms returned sat
[2023-03-21 20:02:16] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-03-21 20:02:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-21 20:02:16] [INFO ] Computed and/alt/rep : 1197/2988/1197 causal constraints (skipped 2 transitions) in 141 ms.
[2023-03-21 20:02:27] [INFO ] Deduced a trap composed of 2 places in 1409 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:02:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 60 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-21 20:02:27] [INFO ] Invariant cache hit.
[2023-03-21 20:02:27] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-21 20:02:27] [INFO ] Invariant cache hit.
[2023-03-21 20:02:30] [INFO ] Implicit Places using invariants and state equation in 2537 ms returned []
Implicit Place search using SMT with State Equation took 3261 ms to find 0 implicit places.
[2023-03-21 20:02:30] [INFO ] Redundant transitions in 250 ms returned []
[2023-03-21 20:02:30] [INFO ] Invariant cache hit.
[2023-03-21 20:02:31] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4587 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1251 stabilizing places and 2/1201 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 298 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-21 20:02:32] [INFO ] Invariant cache hit.
[2023-03-21 20:02:33] [INFO ] [Real]Absence check using 450 positive place invariants in 333 ms returned sat
[2023-03-21 20:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 20:02:37] [INFO ] [Real]Absence check using state equation in 3117 ms returned sat
[2023-03-21 20:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 20:02:38] [INFO ] [Nat]Absence check using 450 positive place invariants in 364 ms returned sat
[2023-03-21 20:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 20:02:42] [INFO ] [Nat]Absence check using state equation in 4025 ms returned sat
[2023-03-21 20:02:42] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-03-21 20:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-21 20:02:43] [INFO ] Computed and/alt/rep : 1197/2988/1197 causal constraints (skipped 2 transitions) in 78 ms.
[2023-03-21 20:02:52] [INFO ] Deduced a trap composed of 2 places in 716 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:02:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27417 reset in 1157 ms.
Product exploration explored 100000 steps with 27345 reset in 1460 ms.
Support contains 1 out of 1251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 42 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-21 20:02:55] [INFO ] Invariant cache hit.
[2023-03-21 20:02:56] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-21 20:02:56] [INFO ] Invariant cache hit.
[2023-03-21 20:02:58] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
[2023-03-21 20:02:59] [INFO ] Redundant transitions in 387 ms returned []
[2023-03-21 20:02:59] [INFO ] Invariant cache hit.
[2023-03-21 20:02:59] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4410 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-14 finished in 62044 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 3 out of 2655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2655/2655 places, 2605/2605 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2654 transition count 2353
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2403 transition count 2353
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2403 transition count 2102
Deduced a syphon composed of 251 places in 7 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2152 transition count 2102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1007 place count 2149 transition count 2099
Iterating global reduction 2 with 3 rules applied. Total rules applied 1010 place count 2149 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1010 place count 2149 transition count 2097
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1014 place count 2147 transition count 2097
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 4 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 2 with 1790 rules applied. Total rules applied 2804 place count 1252 transition count 1202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2806 place count 1250 transition count 1200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 1249 transition count 1200
Applied a total of 2807 rules in 605 ms. Remains 1249 /2655 variables (removed 1406) and now considering 1200/2605 (removed 1405) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2023-03-21 20:03:00] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-21 20:03:01] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-21 20:03:01] [INFO ] Invariant cache hit.
[2023-03-21 20:03:03] [INFO ] Implicit Places using invariants and state equation in 2488 ms returned []
Implicit Place search using SMT with State Equation took 3312 ms to find 0 implicit places.
[2023-03-21 20:03:04] [INFO ] Redundant transitions in 248 ms returned [1199]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2023-03-21 20:03:04] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-21 20:03:05] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/2655 places, 1199/2605 transitions.
Applied a total of 0 rules in 34 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5405 ms. Remains : 1249/2655 places, 1199/2605 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050B-LTLFireability-15 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 (NEQ s12 1) (NEQ s21 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39 reset in 852 ms.
Product exploration explored 100000 steps with 39 reset in 1089 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 7649 steps, including 2 resets, run visited all 1 properties in 69 ms. (steps per millisecond=110 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 40 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-21 20:03:08] [INFO ] Invariant cache hit.
[2023-03-21 20:03:09] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-21 20:03:09] [INFO ] Invariant cache hit.
[2023-03-21 20:03:10] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
[2023-03-21 20:03:11] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-21 20:03:11] [INFO ] Invariant cache hit.
[2023-03-21 20:03:11] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3746 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 7509 steps, including 2 resets, run visited all 1 properties in 93 ms. (steps per millisecond=80 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 900 ms.
Product exploration explored 100000 steps with 39 reset in 1118 ms.
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 34 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2023-03-21 20:03:14] [INFO ] Invariant cache hit.
[2023-03-21 20:03:15] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-21 20:03:15] [INFO ] Invariant cache hit.
[2023-03-21 20:03:18] [INFO ] Implicit Places using invariants and state equation in 3007 ms returned []
Implicit Place search using SMT with State Equation took 3726 ms to find 0 implicit places.
[2023-03-21 20:03:18] [INFO ] Redundant transitions in 234 ms returned []
[2023-03-21 20:03:18] [INFO ] Invariant cache hit.
[2023-03-21 20:03:19] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4741 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050B-LTLFireability-15 finished in 19417 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)||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-21 20:03:20] [INFO ] Flatten gal took : 151 ms
[2023-03-21 20:03:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 20:03:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2655 places, 2605 transitions and 8210 arcs took 37 ms.
Total runtime 302494 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2031/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2031/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2031/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2031/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-050B-LTLFireability-09
Could not compute solution for formula : ShieldIIPs-PT-050B-LTLFireability-12
Could not compute solution for formula : ShieldIIPs-PT-050B-LTLFireability-14
Could not compute solution for formula : ShieldIIPs-PT-050B-LTLFireability-15

BK_STOP 1679429007863

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-050B-LTLFireability-09
ltl formula formula --ltl=/tmp/2031/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2655 places, 2605 transitions and 8210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2031/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2031/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.340 user 0.380 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2031/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2031/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-050B-LTLFireability-12
ltl formula formula --ltl=/tmp/2031/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2655 places, 2605 transitions and 8210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.450 real 0.160 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2031/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2031/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2031/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2031/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldIIPs-PT-050B-LTLFireability-14
ltl formula formula --ltl=/tmp/2031/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2655 places, 2605 transitions and 8210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.250 user 0.460 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2031/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2031/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2031/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2031/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f4cf2af3f4]
1: pnml2lts-mc(+0xa2496) [0x55f4cf2af496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f63d9add140]
3: pnml2lts-mc(+0x405be5) [0x55f4cf612be5]
4: pnml2lts-mc(+0x16b3f9) [0x55f4cf3783f9]
5: pnml2lts-mc(+0x164ac4) [0x55f4cf371ac4]
6: pnml2lts-mc(+0x272e0a) [0x55f4cf47fe0a]
7: pnml2lts-mc(+0xb61f0) [0x55f4cf2c31f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f63d99304d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f63d993067a]
10: pnml2lts-mc(+0xa1581) [0x55f4cf2ae581]
11: pnml2lts-mc(+0xa1910) [0x55f4cf2ae910]
12: pnml2lts-mc(+0xa32a2) [0x55f4cf2b02a2]
13: pnml2lts-mc(+0xa50f4) [0x55f4cf2b20f4]
14: pnml2lts-mc(+0xa516b) [0x55f4cf2b216b]
15: pnml2lts-mc(+0x3f34b3) [0x55f4cf6004b3]
16: pnml2lts-mc(+0x7c63d) [0x55f4cf28963d]
17: pnml2lts-mc(+0x67d86) [0x55f4cf274d86]
18: pnml2lts-mc(+0x60a8a) [0x55f4cf26da8a]
19: pnml2lts-mc(+0x5eb15) [0x55f4cf26bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f63d9918d0a]
21: pnml2lts-mc(+0x6075e) [0x55f4cf26d75e]
ltl formula name ShieldIIPs-PT-050B-LTLFireability-15
ltl formula formula --ltl=/tmp/2031/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2655 places, 2605 transitions and 8210 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.220 user 0.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2031/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2031/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2031/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2031/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;