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.r389-oct2-167903713400332.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 itstools
Input is ShieldIIPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 860K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679190693457

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 01:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 01:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:51:37] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2023-03-19 01:51:37] [INFO ] Transformed 3503 places.
[2023-03-19 01:51:37] [INFO ] Transformed 3253 transitions.
[2023-03-19 01:51:37] [INFO ] Found NUPN structural information;
[2023-03-19 01:51:37] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPt-PT-050B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 543 places :
Symmetric choice reduction at 0 with 543 rule applications. Total rules 543 place count 2960 transition count 2710
Iterating global reduction 0 with 543 rules applied. Total rules applied 1086 place count 2960 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1087 place count 2959 transition count 2709
Iterating global reduction 0 with 1 rules applied. Total rules applied 1088 place count 2959 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1089 place count 2958 transition count 2708
Iterating global reduction 0 with 1 rules applied. Total rules applied 1090 place count 2958 transition count 2708
Applied a total of 1090 rules in 1330 ms. Remains 2958 /3503 variables (removed 545) and now considering 2708/3253 (removed 545) transitions.
// Phase 1: matrix 2708 rows 2958 cols
[2023-03-19 01:51:38] [INFO ] Computed 451 place invariants in 50 ms
[2023-03-19 01:51:41] [INFO ] Implicit Places using invariants in 2241 ms returned []
[2023-03-19 01:51:41] [INFO ] Invariant cache hit.
[2023-03-19 01:51:45] [INFO ] Implicit Places using invariants and state equation in 4692 ms returned []
Implicit Place search using SMT with State Equation took 6998 ms to find 0 implicit places.
[2023-03-19 01:51:45] [INFO ] Invariant cache hit.
[2023-03-19 01:51:47] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2958/3503 places, 2708/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9917 ms. Remains : 2958/3503 places, 2708/3253 transitions.
Support contains 30 out of 2958 places after structural reductions.
[2023-03-19 01:51:47] [INFO ] Flatten gal took : 213 ms
[2023-03-19 01:51:48] [INFO ] Flatten gal took : 130 ms
[2023-03-19 01:51:48] [INFO ] Input system was already deterministic with 2708 transitions.
Support contains 27 out of 2958 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 21) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 01:51:49] [INFO ] Invariant cache hit.
[2023-03-19 01:51:50] [INFO ] [Real]Absence check using 451 positive place invariants in 243 ms returned sat
[2023-03-19 01:51:51] [INFO ] After 2159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 01:51:52] [INFO ] [Nat]Absence check using 451 positive place invariants in 280 ms returned sat
[2023-03-19 01:51:57] [INFO ] After 3852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 01:51:58] [INFO ] Deduced a trap composed of 21 places in 1119 ms of which 13 ms to minimize.
[2023-03-19 01:51:59] [INFO ] Deduced a trap composed of 21 places in 989 ms of which 3 ms to minimize.
[2023-03-19 01:52:01] [INFO ] Deduced a trap composed of 25 places in 1083 ms of which 16 ms to minimize.
[2023-03-19 01:52:02] [INFO ] Deduced a trap composed of 19 places in 1122 ms of which 4 ms to minimize.
[2023-03-19 01:52:03] [INFO ] Deduced a trap composed of 18 places in 1040 ms of which 3 ms to minimize.
[2023-03-19 01:52:04] [INFO ] Deduced a trap composed of 23 places in 927 ms of which 2 ms to minimize.
[2023-03-19 01:52:05] [INFO ] Deduced a trap composed of 31 places in 878 ms of which 14 ms to minimize.
[2023-03-19 01:52:06] [INFO ] Deduced a trap composed of 24 places in 933 ms of which 2 ms to minimize.
[2023-03-19 01:52:07] [INFO ] Deduced a trap composed of 21 places in 933 ms of which 2 ms to minimize.
[2023-03-19 01:52:08] [INFO ] Deduced a trap composed of 18 places in 801 ms of which 1 ms to minimize.
[2023-03-19 01:52:09] [INFO ] Deduced a trap composed of 17 places in 650 ms of which 2 ms to minimize.
[2023-03-19 01:52:09] [INFO ] Deduced a trap composed of 20 places in 653 ms of which 2 ms to minimize.
[2023-03-19 01:52:10] [INFO ] Deduced a trap composed of 18 places in 672 ms of which 1 ms to minimize.
[2023-03-19 01:52:11] [INFO ] Deduced a trap composed of 23 places in 637 ms of which 12 ms to minimize.
[2023-03-19 01:52:12] [INFO ] Deduced a trap composed of 32 places in 652 ms of which 1 ms to minimize.
[2023-03-19 01:52:13] [INFO ] Deduced a trap composed of 24 places in 670 ms of which 1 ms to minimize.
[2023-03-19 01:52:13] [INFO ] Deduced a trap composed of 39 places in 573 ms of which 1 ms to minimize.
[2023-03-19 01:52:14] [INFO ] Deduced a trap composed of 55 places in 748 ms of which 1 ms to minimize.
[2023-03-19 01:52:15] [INFO ] Deduced a trap composed of 26 places in 515 ms of which 1 ms to minimize.
[2023-03-19 01:52:15] [INFO ] Deduced a trap composed of 29 places in 714 ms of which 1 ms to minimize.
[2023-03-19 01:52:16] [INFO ] Deduced a trap composed of 20 places in 803 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.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-19 01:52:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:52:16] [INFO ] After 25484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 1827 ms.
Support contains 16 out of 2958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 2958 transition count 2120
Reduce places removed 588 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 589 rules applied. Total rules applied 1177 place count 2370 transition count 2119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1178 place count 2369 transition count 2119
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 1178 place count 2369 transition count 1723
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1970 place count 1973 transition count 1723
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1972 place count 1971 transition count 1721
Iterating global reduction 3 with 2 rules applied. Total rules applied 1974 place count 1971 transition count 1721
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1974 place count 1971 transition count 1719
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1978 place count 1969 transition count 1719
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 3 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 3682 place count 1117 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3683 place count 1117 transition count 866
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3685 place count 1116 transition count 865
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3887 place count 1015 transition count 928
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 3973 place count 972 transition count 954
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3974 place count 972 transition count 953
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 4024 place count 972 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4025 place count 971 transition count 952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4027 place count 969 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4027 place count 969 transition count 951
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4029 place count 968 transition count 951
Applied a total of 4029 rules in 771 ms. Remains 968 /2958 variables (removed 1990) and now considering 951/2708 (removed 1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 968/2958 places, 951/2708 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 83770 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83770 steps, saw 53671 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 951 rows 968 cols
[2023-03-19 01:52:23] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-19 01:52:24] [INFO ] [Real]Absence check using 449 positive place invariants in 180 ms returned sat
[2023-03-19 01:52:25] [INFO ] After 595ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-19 01:52:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:52:25] [INFO ] After 56ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 01:52:25] [INFO ] After 1395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 01:52:25] [INFO ] [Nat]Absence check using 449 positive place invariants in 99 ms returned sat
[2023-03-19 01:52:27] [INFO ] After 1077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 01:52:27] [INFO ] After 527ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-19 01:52:28] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 696 ms.
[2023-03-19 01:52:29] [INFO ] After 3951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 261 ms.
Support contains 16 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 951/951 transitions.
Applied a total of 0 rules in 39 ms. Remains 968 /968 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 968/968 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 951/951 transitions.
Applied a total of 0 rules in 21 ms. Remains 968 /968 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-19 01:52:29] [INFO ] Invariant cache hit.
[2023-03-19 01:52:30] [INFO ] Implicit Places using invariants in 791 ms returned [957]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 794 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 967/968 places, 951/951 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 966 transition count 950
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 966 transition count 950
Applied a total of 2 rules in 52 ms. Remains 966 /967 variables (removed 1) and now considering 950/951 (removed 1) transitions.
// Phase 1: matrix 950 rows 966 cols
[2023-03-19 01:52:30] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-19 01:52:31] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-19 01:52:31] [INFO ] Invariant cache hit.
[2023-03-19 01:52:33] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2630 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 966/968 places, 950/951 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3498 ms. Remains : 966/968 places, 950/951 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 91382 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91382 steps, saw 57443 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-19 01:52:37] [INFO ] Invariant cache hit.
[2023-03-19 01:52:37] [INFO ] [Real]Absence check using 448 positive place invariants in 179 ms returned sat
[2023-03-19 01:52:38] [INFO ] After 1262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:52:38] [INFO ] [Nat]Absence check using 448 positive place invariants in 91 ms returned sat
[2023-03-19 01:52:40] [INFO ] After 1055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:52:41] [INFO ] After 1901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 467 ms.
[2023-03-19 01:52:41] [INFO ] After 3095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 16 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 950/950 transitions.
Applied a total of 0 rules in 24 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 966/966 places, 950/950 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 86748 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86748 steps, saw 54511 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-19 01:52:45] [INFO ] Invariant cache hit.
[2023-03-19 01:52:46] [INFO ] [Real]Absence check using 448 positive place invariants in 81 ms returned sat
[2023-03-19 01:52:47] [INFO ] After 1236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:52:47] [INFO ] [Nat]Absence check using 448 positive place invariants in 174 ms returned sat
[2023-03-19 01:52:49] [INFO ] After 1077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:52:49] [INFO ] After 1862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 622 ms.
[2023-03-19 01:52:50] [INFO ] After 3364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 16 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 950/950 transitions.
Applied a total of 0 rules in 22 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 966/966 places, 950/950 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 950/950 transitions.
Applied a total of 0 rules in 36 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
[2023-03-19 01:52:50] [INFO ] Invariant cache hit.
[2023-03-19 01:52:51] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-19 01:52:51] [INFO ] Invariant cache hit.
[2023-03-19 01:52:52] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2023-03-19 01:52:53] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-19 01:52:53] [INFO ] Invariant cache hit.
[2023-03-19 01:52:53] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3041 ms. Remains : 966/966 places, 950/950 transitions.
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 966 transition count 950
Applied a total of 97 rules in 69 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 950 rows 966 cols
[2023-03-19 01:52:53] [INFO ] Computed 448 place invariants in 6 ms
[2023-03-19 01:52:54] [INFO ] [Real]Absence check using 448 positive place invariants in 507 ms returned sat
[2023-03-19 01:52:55] [INFO ] After 1695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 01:52:55] [INFO ] [Nat]Absence check using 448 positive place invariants in 124 ms returned sat
[2023-03-19 01:52:57] [INFO ] After 1027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 01:52:57] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-19 01:52:58] [INFO ] After 731ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 01:52:58] [INFO ] After 1600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 781 ms.
[2023-03-19 01:52:59] [INFO ] After 4101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Computed a total of 799 stabilizing places and 799 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||F(p1))) U p2) U G(p3)))'
Support contains 4 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2957 transition count 2113
Reduce places removed 594 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 595 rules applied. Total rules applied 1189 place count 2363 transition count 2112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1190 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1190 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1988 place count 1963 transition count 1713
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1993 place count 1958 transition count 1708
Iterating global reduction 3 with 5 rules applied. Total rules applied 1998 place count 1958 transition count 1708
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1998 place count 1958 transition count 1703
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2008 place count 1953 transition count 1703
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3700 place count 1107 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3701 place count 1107 transition count 856
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3703 place count 1106 transition count 855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3905 place count 1005 transition count 921
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4001 place count 957 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4003 place count 955 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4005 place count 953 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4005 place count 953 transition count 950
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4007 place count 952 transition count 950
Applied a total of 4007 rules in 680 ms. Remains 952 /2958 variables (removed 2006) and now considering 950/2708 (removed 1758) transitions.
// Phase 1: matrix 950 rows 952 cols
[2023-03-19 01:53:00] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-19 01:53:01] [INFO ] Implicit Places using invariants in 630 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 642 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 951/2958 places, 950/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 949
Applied a total of 2 rules in 58 ms. Remains 950 /951 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 950 cols
[2023-03-19 01:53:01] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-19 01:53:02] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-19 01:53:02] [INFO ] Invariant cache hit.
[2023-03-19 01:53:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 01:53:03] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 950/2958 places, 949/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3434 ms. Remains : 950/2958 places, 949/2708 transitions.
Stuttering acceptance computed with spot in 1046 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p3) p0), (AND (NOT p1) (NOT p0) (NOT p3) p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(NEQ s818 1), p2:(EQ s842 1), p0:(EQ s381 1), p1:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 53 steps with 20 reset in 13 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-00 finished in 4562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2957 transition count 2114
Reduce places removed 593 places and 0 transitions.
Iterating post reduction 1 with 593 rules applied. Total rules applied 1186 place count 2364 transition count 2114
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1186 place count 2364 transition count 1714
Deduced a syphon composed of 400 places in 4 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1986 place count 1964 transition count 1714
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1992 place count 1958 transition count 1708
Iterating global reduction 2 with 6 rules applied. Total rules applied 1998 place count 1958 transition count 1708
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1998 place count 1958 transition count 1702
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2010 place count 1952 transition count 1702
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 2 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3702 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3705 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3907 place count 1004 transition count 920
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4003 place count 956 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4005 place count 954 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4007 place count 952 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4007 place count 952 transition count 950
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4009 place count 951 transition count 950
Applied a total of 4009 rules in 674 ms. Remains 951 /2958 variables (removed 2007) and now considering 950/2708 (removed 1758) transitions.
// Phase 1: matrix 950 rows 951 cols
[2023-03-19 01:53:05] [INFO ] Computed 449 place invariants in 6 ms
[2023-03-19 01:53:05] [INFO ] Implicit Places using invariants in 550 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 551 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2958 places, 950/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 949
Applied a total of 2 rules in 49 ms. Remains 949 /950 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 949 cols
[2023-03-19 01:53:05] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-19 01:53:06] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-19 01:53:06] [INFO ] Invariant cache hit.
[2023-03-19 01:53:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 01:53:08] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2958 places, 949/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3341 ms. Remains : 949/2958 places, 949/2708 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s784 1) (EQ s96 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-01 finished in 3457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 2957 transition count 2112
Reduce places removed 595 places and 0 transitions.
Iterating post reduction 1 with 595 rules applied. Total rules applied 1190 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1190 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1988 place count 1963 transition count 1713
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1994 place count 1957 transition count 1707
Iterating global reduction 2 with 6 rules applied. Total rules applied 2000 place count 1957 transition count 1707
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2000 place count 1957 transition count 1701
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2012 place count 1951 transition count 1701
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 2 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3708 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3711 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3913 place count 1001 transition count 917
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4009 place count 953 transition count 949
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4011 place count 951 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4013 place count 949 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4013 place count 949 transition count 946
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4015 place count 948 transition count 946
Applied a total of 4015 rules in 638 ms. Remains 948 /2958 variables (removed 2010) and now considering 946/2708 (removed 1762) transitions.
// Phase 1: matrix 946 rows 948 cols
[2023-03-19 01:53:08] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-19 01:53:09] [INFO ] Implicit Places using invariants in 670 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 672 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 947/2958 places, 946/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 945
Applied a total of 2 rules in 59 ms. Remains 946 /947 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 946 cols
[2023-03-19 01:53:09] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-19 01:53:10] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-19 01:53:10] [INFO ] Invariant cache hit.
[2023-03-19 01:53:11] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 946/2958 places, 945/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3325 ms. Remains : 946/2958 places, 945/2708 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s684 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 939 ms.
Stuttering criterion allowed to conclude after 30955 steps with 0 reset in 316 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-02 finished in 4640 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) U p1)&&F(p2)))&&F(p0)))'
Support contains 6 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 536 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-19 01:53:13] [INFO ] Computed 451 place invariants in 21 ms
[2023-03-19 01:53:14] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2023-03-19 01:53:14] [INFO ] Invariant cache hit.
[2023-03-19 01:53:17] [INFO ] Implicit Places using invariants and state equation in 3334 ms returned []
Implicit Place search using SMT with State Equation took 4593 ms to find 0 implicit places.
[2023-03-19 01:53:17] [INFO ] Invariant cache hit.
[2023-03-19 01:53:19] [INFO ] Dead Transitions using invariants and state equation in 1724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6855 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s383 1), p1:(AND (EQ s1642 1) (EQ s1667 1) (EQ s1676 1)), p2:(AND (EQ s1685 1) (EQ s1730 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2087 steps with 2 reset in 41 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-03 finished in 7442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 597 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
[2023-03-19 01:53:20] [INFO ] Invariant cache hit.
[2023-03-19 01:53:22] [INFO ] Implicit Places using invariants in 1334 ms returned []
[2023-03-19 01:53:22] [INFO ] Invariant cache hit.
[2023-03-19 01:53:25] [INFO ] Implicit Places using invariants and state equation in 3505 ms returned []
Implicit Place search using SMT with State Equation took 4845 ms to find 0 implicit places.
[2023-03-19 01:53:25] [INFO ] Invariant cache hit.
[2023-03-19 01:53:27] [INFO ] Dead Transitions using invariants and state equation in 2323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7787 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1434 1) (EQ s1610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 192 reset in 679 ms.
Product exploration explored 100000 steps with 192 reset in 677 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 515 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=128 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 204 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 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
[2023-03-19 01:53:30] [INFO ] Invariant cache hit.
[2023-03-19 01:53:33] [INFO ] [Real]Absence check using 451 positive place invariants in 850 ms returned sat
[2023-03-19 01:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:53:45] [INFO ] [Real]Absence check using state equation in 12147 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2951/2951 places, 2701/2701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 2950 transition count 2103
Reduce places removed 597 places and 0 transitions.
Iterating post reduction 1 with 597 rules applied. Total rules applied 1194 place count 2353 transition count 2103
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1194 place count 2353 transition count 1703
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1994 place count 1953 transition count 1703
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3690 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3691 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3693 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3895 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3989 place count 956 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3991 place count 954 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3993 place count 952 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3993 place count 952 transition count 948
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3995 place count 951 transition count 948
Applied a total of 3995 rules in 491 ms. Remains 951 /2951 variables (removed 2000) and now considering 948/2701 (removed 1753) transitions.
// Phase 1: matrix 948 rows 951 cols
[2023-03-19 01:53:45] [INFO ] Computed 449 place invariants in 5 ms
[2023-03-19 01:53:46] [INFO ] Implicit Places using invariants in 615 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 618 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2951 places, 948/2701 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 947
Applied a total of 2 rules in 68 ms. Remains 949 /950 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 949 cols
[2023-03-19 01:53:46] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-19 01:53:47] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-19 01:53:47] [INFO ] Invariant cache hit.
[2023-03-19 01:53:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:53:48] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2951 places, 947/2701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3408 ms. Remains : 949/2951 places, 947/2701 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 157 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 41 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 302 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 87 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
[2023-03-19 01:53:49] [INFO ] Invariant cache hit.
[2023-03-19 01:53:50] [INFO ] [Real]Absence check using 448 positive place invariants in 380 ms returned sat
[2023-03-19 01:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:53:52] [INFO ] [Real]Absence check using state equation in 1889 ms returned sat
[2023-03-19 01:53:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:53:53] [INFO ] [Nat]Absence check using 448 positive place invariants in 344 ms returned sat
[2023-03-19 01:53:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:53:55] [INFO ] [Nat]Absence check using state equation in 1364 ms returned sat
[2023-03-19 01:53:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:53:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 36 ms returned sat
[2023-03-19 01:53:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-19 01:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-19 01:53:55] [INFO ] Computed and/alt/rep : 942/1446/942 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-19 01:54:08] [INFO ] Deduced a trap composed of 2 places in 445 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.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-19 01:54:08] [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 81 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-05 finished in 47933 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) U G(p1))) U ((p1 U X(p1))||G(F(p2)))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2953 transition count 2703
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2953 transition count 2703
Applied a total of 10 rules in 512 ms. Remains 2953 /2958 variables (removed 5) and now considering 2703/2708 (removed 5) transitions.
// Phase 1: matrix 2703 rows 2953 cols
[2023-03-19 01:54:08] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-19 01:54:09] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2023-03-19 01:54:09] [INFO ] Invariant cache hit.
[2023-03-19 01:54:13] [INFO ] Implicit Places using invariants and state equation in 3537 ms returned []
Implicit Place search using SMT with State Equation took 4759 ms to find 0 implicit places.
[2023-03-19 01:54:13] [INFO ] Invariant cache hit.
[2023-03-19 01:54:15] [INFO ] Dead Transitions using invariants and state equation in 2408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2953/2958 places, 2703/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7709 ms. Remains : 2953/2958 places, 2703/2708 transitions.
Stuttering acceptance computed with spot in 654 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s1429 1), p1:(EQ s1477 1), p0:(EQ s2306 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 863 ms.
Stack based approach found an accepted trace after 2018 steps with 0 reset with depth 2019 and stack size 2019 in 23 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-07 finished in 9304 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 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2957 transition count 2113
Reduce places removed 594 places and 0 transitions.
Iterating post reduction 1 with 594 rules applied. Total rules applied 1188 place count 2363 transition count 2113
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1188 place count 2363 transition count 1714
Deduced a syphon composed of 399 places in 5 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1986 place count 1964 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1993 place count 1957 transition count 1707
Iterating global reduction 2 with 7 rules applied. Total rules applied 2000 place count 1957 transition count 1707
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2000 place count 1957 transition count 1700
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2014 place count 1950 transition count 1700
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3708 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3711 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3913 place count 1001 transition count 917
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4007 place count 954 transition count 948
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4009 place count 952 transition count 946
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4011 place count 950 transition count 946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4011 place count 950 transition count 945
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4013 place count 949 transition count 945
Applied a total of 4013 rules in 626 ms. Remains 949 /2958 variables (removed 2009) and now considering 945/2708 (removed 1763) transitions.
// Phase 1: matrix 945 rows 949 cols
[2023-03-19 01:54:18] [INFO ] Computed 449 place invariants in 16 ms
[2023-03-19 01:54:18] [INFO ] Implicit Places using invariants in 597 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 611 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2958 places, 945/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 944
Applied a total of 2 rules in 35 ms. Remains 947 /948 variables (removed 1) and now considering 944/945 (removed 1) transitions.
// Phase 1: matrix 944 rows 947 cols
[2023-03-19 01:54:18] [INFO ] Computed 448 place invariants in 14 ms
[2023-03-19 01:54:19] [INFO ] Implicit Places using invariants in 761 ms returned []
[2023-03-19 01:54:19] [INFO ] Invariant cache hit.
[2023-03-19 01:54:21] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2958 places, 944/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3540 ms. Remains : 947/2958 places, 944/2708 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s364 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-08 finished in 3635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 499 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-19 01:54:21] [INFO ] Computed 451 place invariants in 22 ms
[2023-03-19 01:54:23] [INFO ] Implicit Places using invariants in 1495 ms returned []
[2023-03-19 01:54:23] [INFO ] Invariant cache hit.
[2023-03-19 01:54:27] [INFO ] Implicit Places using invariants and state equation in 3988 ms returned []
Implicit Place search using SMT with State Equation took 5486 ms to find 0 implicit places.
[2023-03-19 01:54:27] [INFO ] Invariant cache hit.
[2023-03-19 01:54:30] [INFO ] Dead Transitions using invariants and state equation in 2968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8955 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1742 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 189 reset in 675 ms.
Product exploration explored 100000 steps with 188 reset in 594 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2951 stabilizing places and 798/2701 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Finished random walk after 483 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=80 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 294 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 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-19 01:54:32] [INFO ] Invariant cache hit.
[2023-03-19 01:54:34] [INFO ] [Real]Absence check using 451 positive place invariants in 883 ms returned sat
[2023-03-19 01:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:54:47] [INFO ] [Real]Absence check using state equation in 12365 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2951/2951 places, 2701/2701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 2950 transition count 2101
Reduce places removed 599 places and 0 transitions.
Iterating post reduction 1 with 599 rules applied. Total rules applied 1198 place count 2351 transition count 2101
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1198 place count 2351 transition count 1700
Deduced a syphon composed of 401 places in 2 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 2000 place count 1950 transition count 1700
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 2 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3692 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3693 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3695 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3897 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3993 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3995 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3997 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3997 place count 950 transition count 948
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3999 place count 949 transition count 948
Applied a total of 3999 rules in 479 ms. Remains 949 /2951 variables (removed 2002) and now considering 948/2701 (removed 1753) transitions.
// Phase 1: matrix 948 rows 949 cols
[2023-03-19 01:54:47] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-19 01:54:48] [INFO ] Implicit Places using invariants in 932 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 943 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2951 places, 948/2701 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 947
Applied a total of 2 rules in 36 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2023-03-19 01:54:48] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-19 01:54:49] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-19 01:54:49] [INFO ] Invariant cache hit.
[2023-03-19 01:54:50] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2951 places, 947/2701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3562 ms. Remains : 947/2951 places, 947/2701 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/947 stabilizing places and 2/947 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 261 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 61 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 330 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-19 01:54:51] [INFO ] Invariant cache hit.
[2023-03-19 01:54:53] [INFO ] [Real]Absence check using 448 positive place invariants in 297 ms returned sat
[2023-03-19 01:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:54:54] [INFO ] [Real]Absence check using state equation in 1684 ms returned sat
[2023-03-19 01:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:54:55] [INFO ] [Nat]Absence check using 448 positive place invariants in 229 ms returned sat
[2023-03-19 01:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:54:57] [INFO ] [Nat]Absence check using state equation in 1544 ms returned sat
[2023-03-19 01:54:57] [INFO ] Computed and/alt/rep : 942/1446/942 causal constraints (skipped 0 transitions) in 102 ms.
[2023-03-19 01:55:10] [INFO ] Deduced a trap composed of 2 places in 599 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-19 01:55:10] [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 70 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-09 finished in 49508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2952 transition count 2702
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2952 transition count 2702
Applied a total of 12 rules in 503 ms. Remains 2952 /2958 variables (removed 6) and now considering 2702/2708 (removed 6) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-19 01:55:11] [INFO ] Computed 451 place invariants in 8 ms
[2023-03-19 01:55:12] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2023-03-19 01:55:12] [INFO ] Invariant cache hit.
[2023-03-19 01:55:16] [INFO ] Implicit Places using invariants and state equation in 3813 ms returned []
Implicit Place search using SMT with State Equation took 5193 ms to find 0 implicit places.
[2023-03-19 01:55:16] [INFO ] Invariant cache hit.
[2023-03-19 01:55:18] [INFO ] Dead Transitions using invariants and state equation in 2563 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2958 places, 2702/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8261 ms. Remains : 2952/2958 places, 2702/2708 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1316 1) (NOT (AND (EQ s2772 1) (EQ s1316 1)))), p1:(AND (EQ s2772 1) (EQ s1316 1)), p0:(EQ s1436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 949 ms.
Product exploration explored 100000 steps with 0 reset in 1205 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 913 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:55:22] [INFO ] Invariant cache hit.
[2023-03-19 01:55:23] [INFO ] [Real]Absence check using 451 positive place invariants in 199 ms returned sat
[2023-03-19 01:55:25] [INFO ] After 3002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:55:26] [INFO ] [Nat]Absence check using 451 positive place invariants in 207 ms returned sat
[2023-03-19 01:55:29] [INFO ] After 2313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:55:30] [INFO ] Deduced a trap composed of 16 places in 867 ms of which 22 ms to minimize.
[2023-03-19 01:55:31] [INFO ] Deduced a trap composed of 25 places in 748 ms of which 17 ms to minimize.
[2023-03-19 01:55:31] [INFO ] Deduced a trap composed of 18 places in 748 ms of which 2 ms to minimize.
[2023-03-19 01:55:32] [INFO ] Deduced a trap composed of 21 places in 728 ms of which 2 ms to minimize.
[2023-03-19 01:55:33] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 1 ms to minimize.
[2023-03-19 01:55:34] [INFO ] Deduced a trap composed of 26 places in 907 ms of which 2 ms to minimize.
[2023-03-19 01:55:36] [INFO ] Deduced a trap composed of 24 places in 1224 ms of which 3 ms to minimize.
[2023-03-19 01:55:37] [INFO ] Deduced a trap composed of 38 places in 820 ms of which 2 ms to minimize.
[2023-03-19 01:55:38] [INFO ] Deduced a trap composed of 42 places in 999 ms of which 3 ms to minimize.
[2023-03-19 01:55:38] [INFO ] Deduced a trap composed of 27 places in 646 ms of which 2 ms to minimize.
[2023-03-19 01:55:39] [INFO ] Deduced a trap composed of 21 places in 935 ms of which 19 ms to minimize.
[2023-03-19 01:55:40] [INFO ] Deduced a trap composed of 40 places in 763 ms of which 1 ms to minimize.
[2023-03-19 01:55:41] [INFO ] Deduced a trap composed of 43 places in 904 ms of which 1 ms to minimize.
[2023-03-19 01:55:43] [INFO ] Deduced a trap composed of 40 places in 1021 ms of which 2 ms to minimize.
[2023-03-19 01:55:43] [INFO ] Deduced a trap composed of 36 places in 541 ms of which 1 ms to minimize.
[2023-03-19 01:55:44] [INFO ] Deduced a trap composed of 34 places in 636 ms of which 1 ms to minimize.
[2023-03-19 01:55:45] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 4 ms to minimize.
[2023-03-19 01:55:45] [INFO ] Deduced a trap composed of 35 places in 654 ms of which 2 ms to minimize.
[2023-03-19 01:55:46] [INFO ] Deduced a trap composed of 32 places in 866 ms of which 1 ms to minimize.
[2023-03-19 01:55:47] [INFO ] Deduced a trap composed of 28 places in 724 ms of which 2 ms to minimize.
[2023-03-19 01:55:48] [INFO ] Deduced a trap composed of 42 places in 604 ms of which 1 ms to minimize.
[2023-03-19 01:55:49] [INFO ] Deduced a trap composed of 30 places in 632 ms of which 1 ms to minimize.
[2023-03-19 01:55:50] [INFO ] Deduced a trap composed of 37 places in 638 ms of which 2 ms to minimize.
[2023-03-19 01:55:50] [INFO ] Deduced a trap composed of 38 places in 558 ms of which 1 ms to minimize.
[2023-03-19 01:55:51] [INFO ] Deduced a trap composed of 42 places in 769 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-19 01:55:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:55:51] [INFO ] After 25797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 242 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2952 transition count 2106
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2356 transition count 2106
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1192 place count 2356 transition count 1705
Deduced a syphon composed of 401 places in 4 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1994 place count 1955 transition count 1705
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3694 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3695 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3697 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3899 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3993 place count 956 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3994 place count 956 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4044 place count 956 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4045 place count 955 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4047 place count 953 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4047 place count 953 transition count 947
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4049 place count 952 transition count 947
Applied a total of 4049 rules in 496 ms. Remains 952 /2952 variables (removed 2000) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 952/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 116434 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116434 steps, saw 75055 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 947 rows 952 cols
[2023-03-19 01:55:55] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-19 01:55:56] [INFO ] [Real]Absence check using 449 positive place invariants in 73 ms returned sat
[2023-03-19 01:55:56] [INFO ] After 833ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:55:57] [INFO ] [Nat]Absence check using 449 positive place invariants in 116 ms returned sat
[2023-03-19 01:55:57] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:55:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 01:55:58] [INFO ] After 255ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:55:58] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-19 01:55:58] [INFO ] After 1705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 151 ms.
Support contains 3 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 33 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 18 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2023-03-19 01:55:58] [INFO ] Invariant cache hit.
[2023-03-19 01:55:59] [INFO ] Implicit Places using invariants in 1020 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1021 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 37 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-19 01:55:59] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-19 01:56:00] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-19 01:56:00] [INFO ] Invariant cache hit.
[2023-03-19 01:56:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:56:01] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 950/952 places, 946/947 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3322 ms. Remains : 950/952 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92954 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92954 steps, saw 59024 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:56:05] [INFO ] Invariant cache hit.
[2023-03-19 01:56:05] [INFO ] [Real]Absence check using 448 positive place invariants in 67 ms returned sat
[2023-03-19 01:56:06] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:56:06] [INFO ] [Nat]Absence check using 448 positive place invariants in 85 ms returned sat
[2023-03-19 01:56:07] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:56:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:56:07] [INFO ] After 232ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:56:07] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-19 01:56:08] [INFO ] After 1819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 3 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 22 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 18 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2023-03-19 01:56:08] [INFO ] Invariant cache hit.
[2023-03-19 01:56:08] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-19 01:56:08] [INFO ] Invariant cache hit.
[2023-03-19 01:56:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:56:10] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
[2023-03-19 01:56:10] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 01:56:10] [INFO ] Invariant cache hit.
[2023-03-19 01:56:11] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2849 ms. Remains : 950/950 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 950 transition count 946
Applied a total of 99 rules in 38 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 950 cols
[2023-03-19 01:56:11] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-19 01:56:11] [INFO ] [Real]Absence check using 448 positive place invariants in 99 ms returned sat
[2023-03-19 01:56:12] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:56:12] [INFO ] [Nat]Absence check using 448 positive place invariants in 90 ms returned sat
[2023-03-19 01:56:13] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:56:13] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-19 01:56:13] [INFO ] After 314ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:56:13] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-19 01:56:14] [INFO ] After 2098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 14 factoid took 1239 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-19 01:56:16] [INFO ] Computed 451 place invariants in 20 ms
[2023-03-19 01:56:18] [INFO ] [Real]Absence check using 451 positive place invariants in 874 ms returned sat
[2023-03-19 01:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:56:31] [INFO ] [Real]Absence check using state equation in 12494 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 268 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
[2023-03-19 01:56:31] [INFO ] Invariant cache hit.
[2023-03-19 01:56:32] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2023-03-19 01:56:32] [INFO ] Invariant cache hit.
[2023-03-19 01:56:36] [INFO ] Implicit Places using invariants and state equation in 3649 ms returned []
Implicit Place search using SMT with State Equation took 4911 ms to find 0 implicit places.
[2023-03-19 01:56:36] [INFO ] Invariant cache hit.
[2023-03-19 01:56:38] [INFO ] Dead Transitions using invariants and state equation in 2650 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7843 ms. Remains : 2952/2952 places, 2702/2702 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 967 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:56:40] [INFO ] Invariant cache hit.
[2023-03-19 01:56:41] [INFO ] [Real]Absence check using 451 positive place invariants in 191 ms returned sat
[2023-03-19 01:56:43] [INFO ] After 2953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:56:44] [INFO ] [Nat]Absence check using 451 positive place invariants in 262 ms returned sat
[2023-03-19 01:56:46] [INFO ] After 2057ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:56:47] [INFO ] Deduced a trap composed of 16 places in 777 ms of which 2 ms to minimize.
[2023-03-19 01:56:48] [INFO ] Deduced a trap composed of 25 places in 833 ms of which 2 ms to minimize.
[2023-03-19 01:56:49] [INFO ] Deduced a trap composed of 18 places in 781 ms of which 2 ms to minimize.
[2023-03-19 01:56:50] [INFO ] Deduced a trap composed of 21 places in 734 ms of which 2 ms to minimize.
[2023-03-19 01:56:51] [INFO ] Deduced a trap composed of 31 places in 765 ms of which 1 ms to minimize.
[2023-03-19 01:56:52] [INFO ] Deduced a trap composed of 26 places in 736 ms of which 2 ms to minimize.
[2023-03-19 01:56:53] [INFO ] Deduced a trap composed of 24 places in 750 ms of which 2 ms to minimize.
[2023-03-19 01:56:53] [INFO ] Deduced a trap composed of 38 places in 717 ms of which 1 ms to minimize.
[2023-03-19 01:56:54] [INFO ] Deduced a trap composed of 42 places in 603 ms of which 1 ms to minimize.
[2023-03-19 01:56:55] [INFO ] Deduced a trap composed of 27 places in 690 ms of which 2 ms to minimize.
[2023-03-19 01:56:56] [INFO ] Deduced a trap composed of 21 places in 704 ms of which 1 ms to minimize.
[2023-03-19 01:56:57] [INFO ] Deduced a trap composed of 40 places in 847 ms of which 4 ms to minimize.
[2023-03-19 01:56:58] [INFO ] Deduced a trap composed of 43 places in 722 ms of which 2 ms to minimize.
[2023-03-19 01:56:59] [INFO ] Deduced a trap composed of 40 places in 692 ms of which 2 ms to minimize.
[2023-03-19 01:56:59] [INFO ] Deduced a trap composed of 36 places in 662 ms of which 2 ms to minimize.
[2023-03-19 01:57:00] [INFO ] Deduced a trap composed of 34 places in 883 ms of which 2 ms to minimize.
[2023-03-19 01:57:01] [INFO ] Deduced a trap composed of 26 places in 670 ms of which 3 ms to minimize.
[2023-03-19 01:57:02] [INFO ] Deduced a trap composed of 35 places in 670 ms of which 3 ms to minimize.
[2023-03-19 01:57:03] [INFO ] Deduced a trap composed of 32 places in 672 ms of which 1 ms to minimize.
[2023-03-19 01:57:03] [INFO ] Deduced a trap composed of 28 places in 704 ms of which 2 ms to minimize.
[2023-03-19 01:57:04] [INFO ] Deduced a trap composed of 42 places in 717 ms of which 2 ms to minimize.
[2023-03-19 01:57:05] [INFO ] Deduced a trap composed of 30 places in 641 ms of which 1 ms to minimize.
[2023-03-19 01:57:06] [INFO ] Deduced a trap composed of 37 places in 1064 ms of which 2 ms to minimize.
[2023-03-19 01:57:07] [INFO ] Deduced a trap composed of 38 places in 633 ms of which 13 ms to minimize.
[2023-03-19 01:57:08] [INFO ] Deduced a trap composed of 42 places in 750 ms of which 16 ms to minimize.
[2023-03-19 01:57:09] [INFO ] Deduced a trap composed of 27 places in 1110 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:57:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:57:09] [INFO ] After 26136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 269 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2952 transition count 2106
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2356 transition count 2106
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1192 place count 2356 transition count 1705
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1994 place count 1955 transition count 1705
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3694 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3695 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3697 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3899 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3993 place count 956 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3994 place count 956 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4044 place count 956 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4045 place count 955 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4047 place count 953 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4047 place count 953 transition count 947
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4049 place count 952 transition count 947
Applied a total of 4049 rules in 524 ms. Remains 952 /2952 variables (removed 2000) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 952/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) 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 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 86348 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86348 steps, saw 55325 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 947 rows 952 cols
[2023-03-19 01:57:14] [INFO ] Computed 449 place invariants in 15 ms
[2023-03-19 01:57:14] [INFO ] [Real]Absence check using 449 positive place invariants in 64 ms returned sat
[2023-03-19 01:57:14] [INFO ] After 745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:57:15] [INFO ] [Nat]Absence check using 449 positive place invariants in 116 ms returned sat
[2023-03-19 01:57:15] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:57:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 01:57:16] [INFO ] After 250ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:57:16] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-19 01:57:16] [INFO ] After 1818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 131 ms.
Support contains 3 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 19 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 21 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2023-03-19 01:57:16] [INFO ] Invariant cache hit.
[2023-03-19 01:57:17] [INFO ] Implicit Places using invariants in 673 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 675 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 32 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-19 01:57:17] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-19 01:57:18] [INFO ] Implicit Places using invariants in 629 ms returned []
[2023-03-19 01:57:18] [INFO ] Invariant cache hit.
[2023-03-19 01:57:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:57:19] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 950/952 places, 946/947 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2663 ms. Remains : 950/952 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) 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
Interrupted probabilistic random walk after 91001 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91001 steps, saw 57814 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:57:23] [INFO ] Invariant cache hit.
[2023-03-19 01:57:23] [INFO ] [Real]Absence check using 448 positive place invariants in 143 ms returned sat
[2023-03-19 01:57:23] [INFO ] After 909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:57:24] [INFO ] [Nat]Absence check using 448 positive place invariants in 80 ms returned sat
[2023-03-19 01:57:25] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:57:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:57:25] [INFO ] After 229ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:57:25] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-19 01:57:25] [INFO ] After 1899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 3 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 19 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 37 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2023-03-19 01:57:25] [INFO ] Invariant cache hit.
[2023-03-19 01:57:26] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-19 01:57:26] [INFO ] Invariant cache hit.
[2023-03-19 01:57:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:57:28] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2023-03-19 01:57:28] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 01:57:28] [INFO ] Invariant cache hit.
[2023-03-19 01:57:28] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2807 ms. Remains : 950/950 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 950 transition count 946
Applied a total of 99 rules in 38 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 950 cols
[2023-03-19 01:57:28] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-19 01:57:29] [INFO ] [Real]Absence check using 448 positive place invariants in 122 ms returned sat
[2023-03-19 01:57:29] [INFO ] After 1071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:57:30] [INFO ] [Nat]Absence check using 448 positive place invariants in 99 ms returned sat
[2023-03-19 01:57:30] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:57:30] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-19 01:57:31] [INFO ] After 315ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:57:31] [INFO ] After 735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-19 01:57:31] [INFO ] After 1956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 14 factoid took 789 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-19 01:57:33] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-19 01:57:35] [INFO ] [Real]Absence check using 451 positive place invariants in 826 ms returned sat
[2023-03-19 01:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:57:48] [INFO ] [Real]Absence check using state equation in 12388 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 907 ms.
Product exploration explored 100000 steps with 0 reset in 1253 ms.
Built C files in :
/tmp/ltsmin11519805387694804233
[2023-03-19 01:57:51] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11519805387694804233
Running compilation step : cd /tmp/ltsmin11519805387694804233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11519805387694804233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11519805387694804233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 294 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
[2023-03-19 01:57:54] [INFO ] Invariant cache hit.
[2023-03-19 01:57:55] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-19 01:57:55] [INFO ] Invariant cache hit.
[2023-03-19 01:57:58] [INFO ] Implicit Places using invariants and state equation in 3140 ms returned []
Implicit Place search using SMT with State Equation took 4030 ms to find 0 implicit places.
[2023-03-19 01:57:58] [INFO ] Invariant cache hit.
[2023-03-19 01:58:01] [INFO ] Dead Transitions using invariants and state equation in 2171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6526 ms. Remains : 2952/2952 places, 2702/2702 transitions.
Built C files in :
/tmp/ltsmin17404588686349673842
[2023-03-19 01:58:01] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17404588686349673842
Running compilation step : cd /tmp/ltsmin17404588686349673842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17404588686349673842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17404588686349673842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 01:58:04] [INFO ] Flatten gal took : 76 ms
[2023-03-19 01:58:04] [INFO ] Flatten gal took : 69 ms
[2023-03-19 01:58:04] [INFO ] Time to serialize gal into /tmp/LTL4283421688151941907.gal : 21 ms
[2023-03-19 01:58:04] [INFO ] Time to serialize properties into /tmp/LTL11706774425285693425.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4283421688151941907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3425347397006029129.hoa' '-atoms' '/tmp/LTL11706774425285693425.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11706774425285693425.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3425347397006029129.hoa
Detected timeout of ITS tools.
[2023-03-19 01:58:19] [INFO ] Flatten gal took : 64 ms
[2023-03-19 01:58:19] [INFO ] Flatten gal took : 71 ms
[2023-03-19 01:58:19] [INFO ] Time to serialize gal into /tmp/LTL1861782623170989897.gal : 13 ms
[2023-03-19 01:58:19] [INFO ] Time to serialize properties into /tmp/LTL9359608858270227116.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1861782623170989897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9359608858270227116.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X("(p1697==1)"))&&((!("((p3286==1)&&(p1553==1))"))U(("((p1553==1)&&(!((p3286==1)&&(p1553==1))))")||(G(!("((p3286==1)&&(p1553==1)...165
Formula 0 simplified : G(X!"(p1697==1)" | ("((p3286==1)&&(p1553==1))" M !"((p1553==1)&&(!((p3286==1)&&(p1553==1))))"))
Detected timeout of ITS tools.
[2023-03-19 01:58:34] [INFO ] Flatten gal took : 93 ms
[2023-03-19 01:58:34] [INFO ] Applying decomposition
[2023-03-19 01:58:35] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2354027653870784218.txt' '-o' '/tmp/graph2354027653870784218.bin' '-w' '/tmp/graph2354027653870784218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2354027653870784218.bin' '-l' '-1' '-v' '-w' '/tmp/graph2354027653870784218.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:58:35] [INFO ] Decomposing Gal with order
[2023-03-19 01:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:58:35] [INFO ] Removed a total of 500 redundant transitions.
[2023-03-19 01:58:36] [INFO ] Flatten gal took : 302 ms
[2023-03-19 01:58:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-19 01:58:36] [INFO ] Time to serialize gal into /tmp/LTL413808580404864320.gal : 33 ms
[2023-03-19 01:58:36] [INFO ] Time to serialize properties into /tmp/LTL2079943701869569734.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL413808580404864320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2079943701869569734.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((X("(i23.u531.p1697==1)"))&&((!("((i46.u1025.p3286==1)&&(i21.u488.p1553==1))"))U(("((i21.u488.p1553==1)&&(!((i46.u1025.p3286==1)&...240
Formula 0 simplified : G(X!"(i23.u531.p1697==1)" | ("((i46.u1025.p3286==1)&&(i21.u488.p1553==1))" M !"((i21.u488.p1553==1)&&(!((i46.u1025.p3286==1)&&(i21.u...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14643581970212902147
[2023-03-19 01:58:51] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14643581970212902147
Running compilation step : cd /tmp/ltsmin14643581970212902147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14643581970212902147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14643581970212902147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 223732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 579 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-19 01:58:54] [INFO ] Computed 451 place invariants in 19 ms
[2023-03-19 01:58:56] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2023-03-19 01:58:56] [INFO ] Invariant cache hit.
[2023-03-19 01:58:58] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 3363 ms to find 0 implicit places.
[2023-03-19 01:58:58] [INFO ] Invariant cache hit.
[2023-03-19 01:59:01] [INFO ] Dead Transitions using invariants and state equation in 3496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7443 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (EQ s1666 1) (EQ s862 1)) (EQ s2285 0)), p0:(OR (EQ s862 1) (EQ s2285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-12 finished in 7822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G((p0||X(G(p0)))))))))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 500 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
[2023-03-19 01:59:02] [INFO ] Invariant cache hit.
[2023-03-19 01:59:03] [INFO ] Implicit Places using invariants in 1321 ms returned []
[2023-03-19 01:59:03] [INFO ] Invariant cache hit.
[2023-03-19 01:59:07] [INFO ] Implicit Places using invariants and state equation in 3415 ms returned []
Implicit Place search using SMT with State Equation took 4746 ms to find 0 implicit places.
[2023-03-19 01:59:07] [INFO ] Invariant cache hit.
[2023-03-19 01:59:09] [INFO ] Dead Transitions using invariants and state equation in 2556 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7814 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(NEQ s2529 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 213 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-15 finished in 8206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(!p1 U (p2||G(!p1))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-050B-LTLFireability-10
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2957 transition count 2114
Reduce places removed 593 places and 0 transitions.
Iterating post reduction 1 with 593 rules applied. Total rules applied 1186 place count 2364 transition count 2114
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1186 place count 2364 transition count 1715
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1984 place count 1965 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1990 place count 1959 transition count 1709
Iterating global reduction 2 with 6 rules applied. Total rules applied 1996 place count 1959 transition count 1709
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1996 place count 1959 transition count 1703
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2008 place count 1953 transition count 1703
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3702 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3705 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3907 place count 1004 transition count 921
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4001 place count 957 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4003 place count 955 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4005 place count 953 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4005 place count 953 transition count 948
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4007 place count 952 transition count 948
Applied a total of 4007 rules in 653 ms. Remains 952 /2958 variables (removed 2006) and now considering 948/2708 (removed 1760) transitions.
// Phase 1: matrix 948 rows 952 cols
[2023-03-19 01:59:11] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-19 01:59:12] [INFO ] Implicit Places using invariants in 779 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 781 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 951/2958 places, 948/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 947
Applied a total of 2 rules in 35 ms. Remains 950 /951 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 950 cols
[2023-03-19 01:59:12] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-19 01:59:12] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-19 01:59:12] [INFO ] Invariant cache hit.
[2023-03-19 01:59:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 01:59:14] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 950/2958 places, 947/2708 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3639 ms. Remains : 950/2958 places, 947/2708 transitions.
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s419 1) (NOT (AND (EQ s897 1) (EQ s419 1)))), p1:(AND (EQ s897 1) (EQ s419 1)), p0:(EQ s459 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 3942 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 01:59:14] [INFO ] Flatten gal took : 66 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16161400862293249562
[2023-03-19 01:59:14] [INFO ] Too many transitions (2708) to apply POR reductions. Disabling POR matrices.
[2023-03-19 01:59:14] [INFO ] Applying decomposition
[2023-03-19 01:59:14] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16161400862293249562
Running compilation step : cd /tmp/ltsmin16161400862293249562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 01:59:14] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18093950283017942172.txt' '-o' '/tmp/graph18093950283017942172.bin' '-w' '/tmp/graph18093950283017942172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18093950283017942172.bin' '-l' '-1' '-v' '-w' '/tmp/graph18093950283017942172.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:59:14] [INFO ] Decomposing Gal with order
[2023-03-19 01:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:59:14] [INFO ] Removed a total of 494 redundant transitions.
[2023-03-19 01:59:15] [INFO ] Flatten gal took : 123 ms
[2023-03-19 01:59:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-19 01:59:15] [INFO ] Time to serialize gal into /tmp/LTLFireability6170173124062233629.gal : 22 ms
[2023-03-19 01:59:15] [INFO ] Time to serialize properties into /tmp/LTLFireability5791778341024846145.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6170173124062233629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5791778341024846145.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("(i23.u535.p1697==1)"))&&((!("((i46.u1038.p3286==1)&&(i21.u493.p1553==1))"))U(("((i21.u493.p1553==1)&&(!((i46.u1038.p3286==1)&...240
Formula 0 simplified : G(X!"(i23.u535.p1697==1)" | ("((i46.u1038.p3286==1)&&(i21.u493.p1553==1))" M !"((i21.u493.p1553==1)&&(!((i46.u1038.p3286==1)&&(i21.u...174
Compilation finished in 6544 ms.
Running link step : cd /tmp/ltsmin16161400862293249562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 126 ms.
Running LTSmin : cd /tmp/ltsmin16161400862293249562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.035: LTL layer: formula: <>((X((LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))
pins2lts-mc-linux64( 6/ 8), 0.035: "<>((X((LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.037: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.151: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.613: There are 2712 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.613: State length is 2959, there are 2718 groups
pins2lts-mc-linux64( 0/ 8), 1.613: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.613: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.613: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.613: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.941: [Blue] ~120 levels ~960 states ~18544 transitions
pins2lts-mc-linux64( 6/ 8), 2.553: [Blue] ~240 levels ~1920 states ~61944 transitions
pins2lts-mc-linux64( 1/ 8), 3.244: [Blue] ~480 levels ~3840 states ~44776 transitions
pins2lts-mc-linux64( 1/ 8), 4.432: [Blue] ~960 levels ~7680 states ~81384 transitions
pins2lts-mc-linux64( 0/ 8), 6.523: [Blue] ~1920 levels ~15360 states ~346608 transitions
pins2lts-mc-linux64( 0/ 8), 9.961: [Blue] ~3753 levels ~30720 states ~417824 transitions
pins2lts-mc-linux64( 0/ 8), 16.779: [Blue] ~7408 levels ~61440 states ~577056 transitions
pins2lts-mc-linux64( 0/ 8), 30.193: [Blue] ~14834 levels ~122880 states ~901072 transitions
pins2lts-mc-linux64( 0/ 8), 56.646: [Blue] ~29865 levels ~245760 states ~1742704 transitions
pins2lts-mc-linux64( 6/ 8), 110.607: [Blue] ~61295 levels ~491520 states ~3459536 transitions
pins2lts-mc-linux64( 0/ 8), 217.277: [Blue] ~121029 levels ~983040 states ~8067912 transitions
pins2lts-mc-linux64( 6/ 8), 430.926: [Blue] ~244785 levels ~1966080 states ~13478416 transitions
pins2lts-mc-linux64( 7/ 8), 728.509: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 728.868:
pins2lts-mc-linux64( 0/ 8), 728.869: Explored 2869957 states 19346608 transitions, fanout: 6.741
pins2lts-mc-linux64( 0/ 8), 728.869: Total exploration time 727.240 sec (726.870 sec minimum, 727.034 sec on average)
pins2lts-mc-linux64( 0/ 8), 728.869: States per second: 3946, Transitions per second: 26603
pins2lts-mc-linux64( 0/ 8), 728.869:
pins2lts-mc-linux64( 0/ 8), 728.869: State space has 12207495 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 728.869: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 728.869: blue states: 2869957 (23.51%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 728.869: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 728.869: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 728.869:
pins2lts-mc-linux64( 0/ 8), 728.869: Total memory used for local state coloring: 42.8MB
pins2lts-mc-linux64( 0/ 8), 728.869:
pins2lts-mc-linux64( 0/ 8), 728.869: Queue width: 8B, total height: 2802944, memory: 21.38MB
pins2lts-mc-linux64( 0/ 8), 728.869: Tree memory: 349.1MB, 30.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 728.869: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 728.869: Stored 2800 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 728.869: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 728.869: Est. total memory use: 370.5MB (~1045.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16161400862293249562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16161400862293249562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 02:21:49] [INFO ] Applying decomposition
[2023-03-19 02:21:50] [INFO ] Flatten gal took : 1246 ms
[2023-03-19 02:21:51] [INFO ] Decomposing Gal with order
[2023-03-19 02:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:21:54] [INFO ] Removed a total of 145 redundant transitions.
[2023-03-19 02:21:55] [INFO ] Flatten gal took : 1142 ms
[2023-03-19 02:21:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 150 ms.
[2023-03-19 02:21:57] [INFO ] Time to serialize gal into /tmp/LTLFireability6486203449088876255.gal : 323 ms
[2023-03-19 02:21:57] [INFO ] Time to serialize properties into /tmp/LTLFireability3431557466738319455.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6486203449088876255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3431557466738319455.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u457.p1697==1)"))&&((!("((i0.i0.i0.i1.u8...685
Formula 0 simplified : G(X!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u457.p1697==1)" | ("((i0.i0.i0.i1.u849.p32...526
Detected timeout of ITS tools.
[2023-03-19 02:44:33] [INFO ] Flatten gal took : 671 ms
[2023-03-19 02:44:38] [INFO ] Input system was already deterministic with 2708 transitions.
[2023-03-19 02:44:39] [INFO ] Transformed 2958 places.
[2023-03-19 02:44:39] [INFO ] Transformed 2708 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 02:44:40] [INFO ] Time to serialize gal into /tmp/LTLFireability9244754374462882834.gal : 30 ms
[2023-03-19 02:44:40] [INFO ] Time to serialize properties into /tmp/LTLFireability17405428456269550870.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9244754374462882834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17405428456269550870.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X("(p1697==1)"))&&((!("((p3286==1)&&(p1553==1))"))U(("((p1553==1)&&(!((p3286==1)&&(p1553==1))))")||(G(!("((p3286==1)&&(p1553==1)...165
Formula 0 simplified : G(X!"(p1697==1)" | ("((p3286==1)&&(p1553==1))" M !"((p1553==1)&&(!((p3286==1)&&(p1553==1))))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7112276 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15795916 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-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 r389-oct2-167903713400332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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