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-167903713900699.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 ShieldPPPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713900699
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679223514733

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 10:58:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 10:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:58:37] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2023-03-19 10:58:37] [INFO ] Transformed 7803 places.
[2023-03-19 10:58:37] [INFO ] Transformed 7103 transitions.
[2023-03-19 10:58:37] [INFO ] Found NUPN structural information;
[2023-03-19 10:58:37] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 656 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1095 places :
Symmetric choice reduction at 0 with 1095 rule applications. Total rules 1095 place count 6708 transition count 6008
Iterating global reduction 0 with 1095 rules applied. Total rules applied 2190 place count 6708 transition count 6008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2191 place count 6707 transition count 6007
Iterating global reduction 0 with 1 rules applied. Total rules applied 2192 place count 6707 transition count 6007
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2193 place count 6706 transition count 6006
Iterating global reduction 0 with 1 rules applied. Total rules applied 2194 place count 6706 transition count 6006
Applied a total of 2194 rules in 5569 ms. Remains 6706 /7803 variables (removed 1097) and now considering 6006/7103 (removed 1097) transitions.
// Phase 1: matrix 6006 rows 6706 cols
[2023-03-19 10:58:43] [INFO ] Computed 1101 place invariants in 119 ms
[2023-03-19 10:58:48] [INFO ] Implicit Places using invariants in 5008 ms returned []
[2023-03-19 10:58:48] [INFO ] Invariant cache hit.
[2023-03-19 10:58:49] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 5936 ms to find 0 implicit places.
[2023-03-19 10:58:49] [INFO ] Invariant cache hit.
[2023-03-19 10:58:55] [INFO ] Dead Transitions using invariants and state equation in 5969 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6706/7803 places, 6006/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17480 ms. Remains : 6706/7803 places, 6006/7103 transitions.
Support contains 29 out of 6706 places after structural reductions.
[2023-03-19 10:58:56] [INFO ] Flatten gal took : 335 ms
[2023-03-19 10:58:56] [INFO ] Flatten gal took : 189 ms
[2023-03-19 10:58:57] [INFO ] Input system was already deterministic with 6006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 10:58:58] [INFO ] Invariant cache hit.
[2023-03-19 10:59:00] [INFO ] After 2114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 10:59:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 807 ms returned sat
[2023-03-19 10:59:12] [INFO ] After 8321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 10:59:16] [INFO ] Deduced a trap composed of 21 places in 3352 ms of which 20 ms to minimize.
[2023-03-19 10:59:19] [INFO ] Deduced a trap composed of 27 places in 2877 ms of which 25 ms to minimize.
[2023-03-19 10:59:21] [INFO ] Deduced a trap composed of 26 places in 2291 ms of which 4 ms to minimize.
[2023-03-19 10:59:24] [INFO ] Deduced a trap composed of 28 places in 2539 ms of which 4 ms to minimize.
[2023-03-19 10:59:31] [INFO ] Deduced a trap composed of 32 places in 6406 ms of which 6 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 10:59:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:59:31] [INFO ] After 31067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 3580 ms.
Support contains 21 out of 6706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Drop transitions removed 1383 transitions
Trivial Post-agglo rules discarded 1383 transitions
Performed 1383 trivial Post agglomeration. Transition count delta: 1383
Iterating post reduction 0 with 1383 rules applied. Total rules applied 1383 place count 6706 transition count 4623
Reduce places removed 1383 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1387 rules applied. Total rules applied 2770 place count 5323 transition count 4619
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2774 place count 5319 transition count 4619
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2774 place count 5319 transition count 3820
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4372 place count 4520 transition count 3820
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4373 place count 4519 transition count 3819
Iterating global reduction 3 with 1 rules applied. Total rules applied 4374 place count 4519 transition count 3819
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4374 place count 4519 transition count 3818
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4376 place count 4518 transition count 3818
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 16 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 3 with 3390 rules applied. Total rules applied 7766 place count 2823 transition count 2123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7767 place count 2823 transition count 2122
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7769 place count 2822 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 7971 place count 2721 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8173 place count 2620 transition count 2121
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 5 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 8355 place count 2529 transition count 2121
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8356 place count 2529 transition count 2120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8357 place count 2528 transition count 2120
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 5 with 295 rules applied. Total rules applied 8652 place count 2528 transition count 2120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8653 place count 2527 transition count 2119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8654 place count 2526 transition count 2119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8654 place count 2526 transition count 2117
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8658 place count 2524 transition count 2117
Applied a total of 8658 rules in 2706 ms. Remains 2524 /6706 variables (removed 4182) and now considering 2117/6006 (removed 3889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2707 ms. Remains : 2524/6706 places, 2117/6006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2117 rows 2524 cols
[2023-03-19 10:59:39] [INFO ] Computed 1100 place invariants in 5 ms
[2023-03-19 10:59:40] [INFO ] After 823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 10:59:41] [INFO ] [Nat]Absence check using 1100 positive place invariants in 226 ms returned sat
[2023-03-19 10:59:43] [INFO ] After 2218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 10:59:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-19 10:59:44] [INFO ] After 1001ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 10:59:45] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 11 ms to minimize.
[2023-03-19 10:59:45] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-19 10:59:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 958 ms
[2023-03-19 10:59:47] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 1 ms to minimize.
[2023-03-19 10:59:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 534 ms
[2023-03-19 10:59:47] [INFO ] After 4056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 978 ms.
[2023-03-19 10:59:48] [INFO ] After 8509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 254 ms.
Support contains 17 out of 2524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2524/2524 places, 2117/2117 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2524 transition count 2115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2522 transition count 2115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 2522 transition count 2114
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2521 transition count 2114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2520 transition count 2113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2519 transition count 2113
Applied a total of 10 rules in 315 ms. Remains 2519 /2524 variables (removed 5) and now considering 2113/2117 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 2519/2524 places, 2113/2117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2113 rows 2519 cols
[2023-03-19 10:59:50] [INFO ] Computed 1100 place invariants in 12 ms
[2023-03-19 10:59:51] [INFO ] [Real]Absence check using 1100 positive place invariants in 290 ms returned sat
[2023-03-19 10:59:51] [INFO ] After 1020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 10:59:52] [INFO ] [Nat]Absence check using 1100 positive place invariants in 342 ms returned sat
[2023-03-19 10:59:54] [INFO ] After 1916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 10:59:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-19 10:59:55] [INFO ] After 702ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 10:59:56] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 1 ms to minimize.
[2023-03-19 10:59:56] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2023-03-19 10:59:56] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-19 10:59:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1292 ms
[2023-03-19 10:59:58] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 0 ms to minimize.
[2023-03-19 10:59:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2023-03-19 10:59:58] [INFO ] After 3431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 586 ms.
[2023-03-19 10:59:58] [INFO ] After 7173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 472 ms.
Support contains 13 out of 2519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2519/2519 places, 2113/2113 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2519 transition count 2112
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2518 transition count 2112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2517 transition count 2111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 2517 transition count 2111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2516 transition count 2110
Applied a total of 6 rules in 393 ms. Remains 2516 /2519 variables (removed 3) and now considering 2110/2113 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 2516/2519 places, 2110/2113 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 49546 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49546 steps, saw 41276 distinct states, run finished after 3003 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2110 rows 2516 cols
[2023-03-19 11:00:04] [INFO ] Computed 1100 place invariants in 5 ms
[2023-03-19 11:00:05] [INFO ] [Real]Absence check using 1100 positive place invariants in 337 ms returned sat
[2023-03-19 11:00:05] [INFO ] After 1228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 11:00:06] [INFO ] [Nat]Absence check using 1100 positive place invariants in 580 ms returned sat
[2023-03-19 11:00:08] [INFO ] After 1919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 11:00:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-19 11:00:09] [INFO ] After 770ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 11:00:10] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2023-03-19 11:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2023-03-19 11:00:11] [INFO ] After 2384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 782 ms.
[2023-03-19 11:00:12] [INFO ] After 6741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 310 ms.
Support contains 13 out of 2516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2516/2516 places, 2110/2110 transitions.
Applied a total of 0 rules in 92 ms. Remains 2516 /2516 variables (removed 0) and now considering 2110/2110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2516/2516 places, 2110/2110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2516/2516 places, 2110/2110 transitions.
Applied a total of 0 rules in 97 ms. Remains 2516 /2516 variables (removed 0) and now considering 2110/2110 (removed 0) transitions.
[2023-03-19 11:00:12] [INFO ] Invariant cache hit.
[2023-03-19 11:00:14] [INFO ] Implicit Places using invariants in 1915 ms returned [2499, 2503]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1927 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2514/2516 places, 2110/2110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2512 transition count 2108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2512 transition count 2108
Applied a total of 4 rules in 202 ms. Remains 2512 /2514 variables (removed 2) and now considering 2108/2110 (removed 2) transitions.
// Phase 1: matrix 2108 rows 2512 cols
[2023-03-19 11:00:14] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-19 11:00:18] [INFO ] Implicit Places using invariants in 3548 ms returned []
[2023-03-19 11:00:18] [INFO ] Invariant cache hit.
[2023-03-19 11:00:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-19 11:00:24] [INFO ] Implicit Places using invariants and state equation in 5832 ms returned []
Implicit Place search using SMT with State Equation took 9404 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2512/2516 places, 2108/2110 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11631 ms. Remains : 2512/2516 places, 2108/2110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 52236 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52236 steps, saw 42906 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 11:00:28] [INFO ] Invariant cache hit.
[2023-03-19 11:00:29] [INFO ] [Real]Absence check using 1098 positive place invariants in 346 ms returned sat
[2023-03-19 11:00:29] [INFO ] After 976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 11:00:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 256 ms returned sat
[2023-03-19 11:00:33] [INFO ] After 2521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 11:00:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-19 11:00:33] [INFO ] After 676ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 11:00:34] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-19 11:00:34] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-19 11:00:34] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-19 11:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1042 ms
[2023-03-19 11:00:36] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-19 11:00:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-19 11:00:36] [INFO ] After 3244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 768 ms.
[2023-03-19 11:00:37] [INFO ] After 7596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 253 ms.
Support contains 13 out of 2512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2108/2108 transitions.
Applied a total of 0 rules in 94 ms. Remains 2512 /2512 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2512/2512 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2108/2108 transitions.
Applied a total of 0 rules in 90 ms. Remains 2512 /2512 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-19 11:00:37] [INFO ] Invariant cache hit.
[2023-03-19 11:00:39] [INFO ] Implicit Places using invariants in 1806 ms returned []
[2023-03-19 11:00:39] [INFO ] Invariant cache hit.
[2023-03-19 11:00:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-19 11:00:43] [INFO ] Implicit Places using invariants and state equation in 4356 ms returned []
Implicit Place search using SMT with State Equation took 6166 ms to find 0 implicit places.
[2023-03-19 11:00:43] [INFO ] Redundant transitions in 179 ms returned []
[2023-03-19 11:00:43] [INFO ] Invariant cache hit.
[2023-03-19 11:00:45] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8173 ms. Remains : 2512/2512 places, 2108/2108 transitions.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6705 transition count 4609
Reduce places removed 1396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2793 place count 5309 transition count 4608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3809
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 3 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 5 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7800 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7801 place count 2805 transition count 2104
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7803 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8005 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8207 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8401 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2099
Applied a total of 8408 rules in 2271 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2099/6006 (removed 3907) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2023-03-19 11:00:48] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-19 11:00:50] [INFO ] Implicit Places using invariants in 2009 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2011 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2099/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 194 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-19 11:00:50] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:00:52] [INFO ] Implicit Places using invariants in 2174 ms returned []
[2023-03-19 11:00:52] [INFO ] Invariant cache hit.
[2023-03-19 11:00:57] [INFO ] Implicit Places using invariants and state equation in 4547 ms returned []
Implicit Place search using SMT with State Equation took 6731 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2097/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11222 ms. Remains : 2496/6706 places, 2097/6006 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s405 0) (EQ s512 1) (EQ s2153 0) (EQ s1885 1)), p1:(OR (EQ s2153 0) (EQ s1885 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7 reset in 1661 ms.
Product exploration explored 100000 steps with 6 reset in 1949 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 380 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:01:02] [INFO ] Invariant cache hit.
[2023-03-19 11:01:02] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:01:02] [INFO ] [Nat]Absence check using 1098 positive place invariants in 232 ms returned sat
[2023-03-19 11:01:04] [INFO ] After 1349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:01:04] [INFO ] After 1558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-19 11:01:04] [INFO ] After 2269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 92 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101216 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101216 steps, saw 75541 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:01:08] [INFO ] Invariant cache hit.
[2023-03-19 11:01:08] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:01:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2023-03-19 11:01:10] [INFO ] After 1263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:01:10] [INFO ] After 1503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-19 11:01:10] [INFO ] After 2135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 146 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 96 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-19 11:01:10] [INFO ] Invariant cache hit.
[2023-03-19 11:01:13] [INFO ] Implicit Places using invariants in 2277 ms returned []
[2023-03-19 11:01:13] [INFO ] Invariant cache hit.
[2023-03-19 11:01:17] [INFO ] Implicit Places using invariants and state equation in 3990 ms returned []
Implicit Place search using SMT with State Equation took 6283 ms to find 0 implicit places.
[2023-03-19 11:01:17] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-19 11:01:17] [INFO ] Invariant cache hit.
[2023-03-19 11:01:19] [INFO ] Dead Transitions using invariants and state equation in 2368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8820 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 236 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-19 11:01:19] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-19 11:01:20] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:01:20] [INFO ] [Nat]Absence check using 1098 positive place invariants in 281 ms returned sat
[2023-03-19 11:01:21] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:01:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 11:01:22] [INFO ] After 139ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:01:22] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-19 11:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-19 11:01:22] [INFO ] After 532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-19 11:01:22] [INFO ] After 2555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 189 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-19 11:01:23] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 11:01:26] [INFO ] Implicit Places using invariants in 2971 ms returned []
[2023-03-19 11:01:26] [INFO ] Invariant cache hit.
[2023-03-19 11:01:31] [INFO ] Implicit Places using invariants and state equation in 4715 ms returned []
Implicit Place search using SMT with State Equation took 7703 ms to find 0 implicit places.
[2023-03-19 11:01:31] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-19 11:01:31] [INFO ] Invariant cache hit.
[2023-03-19 11:01:33] [INFO ] Dead Transitions using invariants and state equation in 1916 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9873 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 315 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84376 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84376 steps, saw 63609 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:01:37] [INFO ] Invariant cache hit.
[2023-03-19 11:01:37] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:01:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 312 ms returned sat
[2023-03-19 11:01:39] [INFO ] After 1485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:01:40] [INFO ] After 1881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-19 11:01:40] [INFO ] After 2938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 103 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 104 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 87698 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87698 steps, saw 66287 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:01:44] [INFO ] Invariant cache hit.
[2023-03-19 11:01:44] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:01:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 381 ms returned sat
[2023-03-19 11:01:47] [INFO ] After 1522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:01:47] [INFO ] After 1905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-19 11:01:47] [INFO ] After 3097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 100 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 94 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 199 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-19 11:01:48] [INFO ] Invariant cache hit.
[2023-03-19 11:01:49] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2023-03-19 11:01:49] [INFO ] Invariant cache hit.
[2023-03-19 11:01:54] [INFO ] Implicit Places using invariants and state equation in 5089 ms returned []
Implicit Place search using SMT with State Equation took 6466 ms to find 0 implicit places.
[2023-03-19 11:01:54] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-19 11:01:54] [INFO ] Invariant cache hit.
[2023-03-19 11:01:56] [INFO ] Dead Transitions using invariants and state equation in 1502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8240 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 256 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-19 11:01:56] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:01:56] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:01:57] [INFO ] [Nat]Absence check using 1098 positive place invariants in 215 ms returned sat
[2023-03-19 11:01:58] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:01:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 11:01:59] [INFO ] After 269ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 11:01:59] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-19 11:01:59] [INFO ] After 2970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7 reset in 1401 ms.
Product exploration explored 100000 steps with 7 reset in 1722 ms.
Built C files in :
/tmp/ltsmin16851087232202476321
[2023-03-19 11:02:03] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:02:03] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16851087232202476321
Running compilation step : cd /tmp/ltsmin16851087232202476321;'/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/ltsmin16851087232202476321;'/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/ltsmin16851087232202476321;'/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 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 113 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-19 11:02:06] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-19 11:02:08] [INFO ] Implicit Places using invariants in 2008 ms returned []
[2023-03-19 11:02:08] [INFO ] Invariant cache hit.
[2023-03-19 11:02:12] [INFO ] Implicit Places using invariants and state equation in 4192 ms returned []
Implicit Place search using SMT with State Equation took 6217 ms to find 0 implicit places.
[2023-03-19 11:02:13] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-19 11:02:13] [INFO ] Invariant cache hit.
[2023-03-19 11:02:14] [INFO ] Dead Transitions using invariants and state equation in 1767 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8196 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin10406718219325653572
[2023-03-19 11:02:14] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:02:14] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10406718219325653572
Running compilation step : cd /tmp/ltsmin10406718219325653572;'/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/ltsmin10406718219325653572;'/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/ltsmin10406718219325653572;'/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 11:02:18] [INFO ] Flatten gal took : 63 ms
[2023-03-19 11:02:18] [INFO ] Flatten gal took : 62 ms
[2023-03-19 11:02:18] [INFO ] Time to serialize gal into /tmp/LTL6181571912194980513.gal : 17 ms
[2023-03-19 11:02:18] [INFO ] Time to serialize properties into /tmp/LTL635115207318855077.prop : 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/LTL6181571912194980513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16503916728315919934.hoa' '-atoms' '/tmp/LTL635115207318855077.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...317
Loading property file /tmp/LTL635115207318855077.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16503916728315919934.hoa
Detected timeout of ITS tools.
[2023-03-19 11:02:33] [INFO ] Flatten gal took : 71 ms
[2023-03-19 11:02:33] [INFO ] Flatten gal took : 64 ms
[2023-03-19 11:02:33] [INFO ] Time to serialize gal into /tmp/LTL2496217161657323678.gal : 12 ms
[2023-03-19 11:02:33] [INFO ] Time to serialize properties into /tmp/LTL8215820822092727701.ltl : 3 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/LTL2496217161657323678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8215820822092727701.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(G(("(((p1346==0)||(p1664==1))||((p6718==0)||(p5895==1)))")||(F("((p6718==0)||(p5895==1))"))))))
Formula 0 simplified : G(F!"(((p1346==0)||(p1664==1))||((p6718==0)||(p5895==1)))" & FG!"((p6718==0)||(p5895==1))")
Detected timeout of ITS tools.
[2023-03-19 11:02:48] [INFO ] Flatten gal took : 55 ms
[2023-03-19 11:02:48] [INFO ] Applying decomposition
[2023-03-19 11:02:48] [INFO ] Flatten gal took : 58 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/graph9709956858521612748.txt' '-o' '/tmp/graph9709956858521612748.bin' '-w' '/tmp/graph9709956858521612748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9709956858521612748.bin' '-l' '-1' '-v' '-w' '/tmp/graph9709956858521612748.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:02:49] [INFO ] Decomposing Gal with order
[2023-03-19 11:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:02:49] [INFO ] Removed a total of 606 redundant transitions.
[2023-03-19 11:02:49] [INFO ] Flatten gal took : 190 ms
[2023-03-19 11:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 41 ms.
[2023-03-19 11:02:50] [INFO ] Time to serialize gal into /tmp/LTL15232712520913203311.gal : 32 ms
[2023-03-19 11:02:50] [INFO ] Time to serialize properties into /tmp/LTL13814814985203168370.ltl : 31 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/LTL15232712520913203311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13814814985203168370.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i6.i1.i2.u132.p1346==0)||(i8.i0.i1.u166.p1664==1))||((i37.i1.i2.u690.p6718==0)||(i32.i1.i0.u605.p5895==1)))")||(F("((i37.i...209
Formula 0 simplified : G(F!"(((i6.i1.i2.u132.p1346==0)||(i8.i0.i1.u166.p1664==1))||((i37.i1.i2.u690.p6718==0)||(i32.i1.i0.u605.p5895==1)))" & FG!"((i37.i1....202
Reverse transition relation is NOT exact ! Due to transitions i6.i1.i2.t299, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...178
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13596082263678689748
[2023-03-19 11:03:05] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13596082263678689748
Running compilation step : cd /tmp/ltsmin13596082263678689748;'/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/ltsmin13596082263678689748;'/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/ltsmin13596082263678689748;'/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 ShieldPPPt-PT-100B-LTLCardinality-00 finished in 142245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2224 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-19 11:03:10] [INFO ] Computed 1101 place invariants in 68 ms
[2023-03-19 11:03:13] [INFO ] Implicit Places using invariants in 2931 ms returned []
[2023-03-19 11:03:13] [INFO ] Invariant cache hit.
[2023-03-19 11:03:14] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 3814 ms to find 0 implicit places.
[2023-03-19 11:03:14] [INFO ] Invariant cache hit.
[2023-03-19 11:03:19] [INFO ] Dead Transitions using invariants and state equation in 5459 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11516 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 416 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (EQ s6249 0) (EQ s5074 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 215 steps with 0 reset in 4 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-01 finished in 12071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3811
Deduced a syphon composed of 797 places in 14 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4388 place count 4511 transition count 3811
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4392 place count 4507 transition count 3807
Iterating global reduction 2 with 4 rules applied. Total rules applied 4396 place count 4507 transition count 3807
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4396 place count 4507 transition count 3803
Deduced a syphon composed of 4 places in 20 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 8399 place count 2506 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8401 place count 2504 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8402 place count 2503 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8402 place count 2503 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8406 place count 2501 transition count 2098
Applied a total of 8406 rules in 2386 ms. Remains 2501 /6706 variables (removed 4205) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2501 cols
[2023-03-19 11:03:22] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-19 11:03:25] [INFO ] Implicit Places using invariants in 2432 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2435 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2096
Applied a total of 4 rules in 207 ms. Remains 2497 /2499 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-19 11:03:25] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:03:27] [INFO ] Implicit Places using invariants in 1866 ms returned []
[2023-03-19 11:03:27] [INFO ] Invariant cache hit.
[2023-03-19 11:03:31] [INFO ] Implicit Places using invariants and state equation in 4040 ms returned []
Implicit Place search using SMT with State Equation took 5910 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10938 ms. Remains : 2497/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1001 0) (EQ s2203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15 reset in 1407 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-02 finished in 12458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6705 transition count 4606
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5306 transition count 4606
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2798 place count 5306 transition count 3809
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 4395 place count 4506 transition count 3806
Iterating global reduction 2 with 3 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 13 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8403 place count 2504 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8405 place count 2502 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8406 place count 2501 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8406 place count 2501 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8410 place count 2499 transition count 2098
Applied a total of 8410 rules in 2484 ms. Remains 2499 /6706 variables (removed 4207) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2499 cols
[2023-03-19 11:03:35] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-19 11:03:37] [INFO ] Implicit Places using invariants in 2492 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2508 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2495 transition count 2096
Applied a total of 4 rules in 189 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2023-03-19 11:03:37] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 11:03:39] [INFO ] Implicit Places using invariants in 1820 ms returned []
[2023-03-19 11:03:39] [INFO ] Invariant cache hit.
[2023-03-19 11:03:43] [INFO ] Implicit Places using invariants and state equation in 4151 ms returned []
Implicit Place search using SMT with State Equation took 5993 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11174 ms. Remains : 2495/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1175 0) (EQ s2147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1331 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-03 finished in 12755 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 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 11 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4395 place count 4506 transition count 3806
Iterating global reduction 3 with 3 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8209 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 12 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8401 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2098
Applied a total of 8408 rules in 2291 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-19 11:03:47] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-19 11:03:50] [INFO ] Implicit Places using invariants in 2417 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2431 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 177 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-19 11:03:50] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 11:03:52] [INFO ] Implicit Places using invariants in 2298 ms returned []
[2023-03-19 11:03:52] [INFO ] Invariant cache hit.
[2023-03-19 11:03:57] [INFO ] Implicit Places using invariants and state equation in 4416 ms returned []
Implicit Place search using SMT with State Equation took 6728 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11627 ms. Remains : 2496/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-07 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 s719 0) (EQ s1452 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 1347 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-07 finished in 13090 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 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2329 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-19 11:04:00] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-19 11:04:03] [INFO ] Implicit Places using invariants in 2942 ms returned []
[2023-03-19 11:04:03] [INFO ] Invariant cache hit.
[2023-03-19 11:04:06] [INFO ] Implicit Places using invariants and state equation in 2767 ms returned []
Implicit Place search using SMT with State Equation took 5741 ms to find 0 implicit places.
[2023-03-19 11:04:06] [INFO ] Invariant cache hit.
[2023-03-19 11:04:12] [INFO ] Dead Transitions using invariants and state equation in 5507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13591 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s3136 0) (NEQ s3665 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 0 reset in 1488 ms.
Stack based approach found an accepted trace after 4690 steps with 0 reset with depth 4691 and stack size 4691 in 81 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-08 finished in 15419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3809
Deduced a syphon composed of 799 places in 17 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7798 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2806 transition count 2105
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8399 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8401 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8402 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8402 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8406 place count 2501 transition count 2100
Applied a total of 8406 rules in 2170 ms. Remains 2501 /6706 variables (removed 4205) and now considering 2100/6006 (removed 3906) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-19 11:04:16] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-19 11:04:17] [INFO ] Implicit Places using invariants in 1492 ms returned []
[2023-03-19 11:04:17] [INFO ] Invariant cache hit.
[2023-03-19 11:04:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 11:04:21] [INFO ] Implicit Places using invariants and state equation in 4126 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5628 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6706 places, 2100/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2098
Applied a total of 4 rules in 228 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-19 11:04:22] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 11:04:24] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2023-03-19 11:04:24] [INFO ] Invariant cache hit.
[2023-03-19 11:04:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 11:04:28] [INFO ] Implicit Places using invariants and state equation in 4434 ms returned []
Implicit Place search using SMT with State Equation took 6938 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6706 places, 2098/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14966 ms. Remains : 2497/6706 places, 2098/6006 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s938 0) (EQ s2363 1)), p0:(EQ s1477 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 1353 ms.
Stack based approach found an accepted trace after 63 steps with 7 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-09 finished in 16509 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((F(p0)&&X(p1)))&&G(p2)))'
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2232 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-19 11:04:32] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-19 11:04:35] [INFO ] Implicit Places using invariants in 2735 ms returned []
[2023-03-19 11:04:35] [INFO ] Invariant cache hit.
[2023-03-19 11:04:36] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
[2023-03-19 11:04:36] [INFO ] Invariant cache hit.
[2023-03-19 11:04:42] [INFO ] Dead Transitions using invariants and state equation in 6038 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11941 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s1895 0), p0:(OR (EQ s6537 0) (EQ s4173 1)), p1:(EQ s4053 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1691 ms.
Product exploration explored 100000 steps with 0 reset in 2126 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 535 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:04:47] [INFO ] Invariant cache hit.
[2023-03-19 11:04:48] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:04:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 879 ms returned sat
[2023-03-19 11:04:56] [INFO ] After 5921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:04:59] [INFO ] Deduced a trap composed of 16 places in 2632 ms of which 4 ms to minimize.
[2023-03-19 11:05:02] [INFO ] Deduced a trap composed of 21 places in 2542 ms of which 3 ms to minimize.
[2023-03-19 11:05:05] [INFO ] Deduced a trap composed of 16 places in 2706 ms of which 16 ms to minimize.
[2023-03-19 11:05:08] [INFO ] Deduced a trap composed of 17 places in 2754 ms of which 4 ms to minimize.
[2023-03-19 11:05:10] [INFO ] Deduced a trap composed of 21 places in 2372 ms of which 3 ms to minimize.
[2023-03-19 11:05:13] [INFO ] Deduced a trap composed of 21 places in 2424 ms of which 4 ms to minimize.
[2023-03-19 11:05:16] [INFO ] Deduced a trap composed of 23 places in 2458 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.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 11:05:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:05:16] [INFO ] After 27454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 115 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7800 place count 2801 transition count 2101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2801 transition count 2100
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7803 place count 2800 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 7 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2501 transition count 2099
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2497 transition count 2096
Applied a total of 8706 rules in 1923 ms. Remains 2497 /6701 variables (removed 4204) and now considering 2096/6001 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1923 ms. Remains : 2497/6701 places, 2096/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 75302 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75302 steps, saw 50943 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-19 11:05:21] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-19 11:05:21] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:05:22] [INFO ] [Nat]Absence check using 1100 positive place invariants in 263 ms returned sat
[2023-03-19 11:05:23] [INFO ] After 1266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:05:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:05:23] [INFO ] After 132ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:05:24] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 18 ms to minimize.
[2023-03-19 11:05:24] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 0 ms to minimize.
[2023-03-19 11:05:25] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 0 ms to minimize.
[2023-03-19 11:05:25] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2023-03-19 11:05:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1586 ms
[2023-03-19 11:05:25] [INFO ] After 1777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 11:05:25] [INFO ] After 3797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 183 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 2497/2497 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 159 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-19 11:05:26] [INFO ] Invariant cache hit.
[2023-03-19 11:05:28] [INFO ] Implicit Places using invariants in 2168 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2171 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2495/2497 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2493 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2493 transition count 2094
Applied a total of 4 rules in 172 ms. Remains 2493 /2495 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:05:28] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 11:05:30] [INFO ] Implicit Places using invariants in 2300 ms returned []
[2023-03-19 11:05:30] [INFO ] Invariant cache hit.
[2023-03-19 11:05:36] [INFO ] Implicit Places using invariants and state equation in 5540 ms returned []
Implicit Place search using SMT with State Equation took 7844 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2493/2497 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10346 ms. Remains : 2493/2497 places, 2094/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75795 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75795 steps, saw 51432 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:05:39] [INFO ] Invariant cache hit.
[2023-03-19 11:05:39] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:05:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2023-03-19 11:05:41] [INFO ] After 1311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:05:42] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2023-03-19 11:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2023-03-19 11:05:42] [INFO ] After 1903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-19 11:05:42] [INFO ] After 2608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 115 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 91 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-19 11:05:42] [INFO ] Invariant cache hit.
[2023-03-19 11:05:44] [INFO ] Implicit Places using invariants in 1812 ms returned []
[2023-03-19 11:05:44] [INFO ] Invariant cache hit.
[2023-03-19 11:05:48] [INFO ] Implicit Places using invariants and state equation in 4355 ms returned []
Implicit Place search using SMT with State Equation took 6171 ms to find 0 implicit places.
[2023-03-19 11:05:49] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-19 11:05:49] [INFO ] Invariant cache hit.
[2023-03-19 11:05:50] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8026 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 211 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:05:50] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:05:51] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:05:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 201 ms returned sat
[2023-03-19 11:05:53] [INFO ] After 1983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:05:53] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-19 11:05:54] [INFO ] After 307ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:05:55] [INFO ] Deduced a trap composed of 6 places in 824 ms of which 2 ms to minimize.
[2023-03-19 11:05:56] [INFO ] Deduced a trap composed of 6 places in 809 ms of which 2 ms to minimize.
[2023-03-19 11:05:57] [INFO ] Deduced a trap composed of 5 places in 884 ms of which 2 ms to minimize.
[2023-03-19 11:05:58] [INFO ] Deduced a trap composed of 5 places in 791 ms of which 1 ms to minimize.
[2023-03-19 11:05:59] [INFO ] Deduced a trap composed of 5 places in 714 ms of which 3 ms to minimize.
[2023-03-19 11:05:59] [INFO ] Deduced a trap composed of 7 places in 654 ms of which 17 ms to minimize.
[2023-03-19 11:06:00] [INFO ] Deduced a trap composed of 5 places in 704 ms of which 2 ms to minimize.
[2023-03-19 11:06:01] [INFO ] Deduced a trap composed of 5 places in 675 ms of which 1 ms to minimize.
[2023-03-19 11:06:02] [INFO ] Deduced a trap composed of 5 places in 714 ms of which 2 ms to minimize.
[2023-03-19 11:06:03] [INFO ] Deduced a trap composed of 5 places in 816 ms of which 2 ms to minimize.
[2023-03-19 11:06:04] [INFO ] Deduced a trap composed of 5 places in 689 ms of which 14 ms to minimize.
[2023-03-19 11:06:05] [INFO ] Deduced a trap composed of 5 places in 781 ms of which 1 ms to minimize.
[2023-03-19 11:06:05] [INFO ] Deduced a trap composed of 7 places in 598 ms of which 1 ms to minimize.
[2023-03-19 11:06:06] [INFO ] Deduced a trap composed of 9 places in 756 ms of which 2 ms to minimize.
[2023-03-19 11:06:07] [INFO ] Deduced a trap composed of 5 places in 759 ms of which 1 ms to minimize.
[2023-03-19 11:06:08] [INFO ] Deduced a trap composed of 11 places in 745 ms of which 2 ms to minimize.
[2023-03-19 11:06:09] [INFO ] Deduced a trap composed of 5 places in 706 ms of which 12 ms to minimize.
[2023-03-19 11:06:10] [INFO ] Deduced a trap composed of 7 places in 718 ms of which 2 ms to minimize.
[2023-03-19 11:06:11] [INFO ] Deduced a trap composed of 7 places in 893 ms of which 1 ms to minimize.
[2023-03-19 11:06:11] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 17083 ms
[2023-03-19 11:06:11] [INFO ] After 17566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-19 11:06:11] [INFO ] After 20318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 816 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-19 11:06:13] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-19 11:06:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 6603 ms returned sat
[2023-03-19 11:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:06:28] [INFO ] [Real]Absence check using state equation in 1157 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1299 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
[2023-03-19 11:06:29] [INFO ] Invariant cache hit.
[2023-03-19 11:06:32] [INFO ] Implicit Places using invariants in 3167 ms returned []
[2023-03-19 11:06:32] [INFO ] Invariant cache hit.
[2023-03-19 11:06:35] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 6090 ms to find 0 implicit places.
[2023-03-19 11:06:35] [INFO ] Invariant cache hit.
[2023-03-19 11:06:41] [INFO ] Dead Transitions using invariants and state equation in 5786 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13177 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 651 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:06:43] [INFO ] Invariant cache hit.
[2023-03-19 11:06:43] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:06:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 867 ms returned sat
[2023-03-19 11:06:52] [INFO ] After 6710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:06:54] [INFO ] Deduced a trap composed of 16 places in 2491 ms of which 4 ms to minimize.
[2023-03-19 11:06:57] [INFO ] Deduced a trap composed of 21 places in 2607 ms of which 3 ms to minimize.
[2023-03-19 11:07:00] [INFO ] Deduced a trap composed of 16 places in 2479 ms of which 5 ms to minimize.
[2023-03-19 11:07:03] [INFO ] Deduced a trap composed of 17 places in 2642 ms of which 4 ms to minimize.
[2023-03-19 11:07:06] [INFO ] Deduced a trap composed of 21 places in 2480 ms of which 4 ms to minimize.
[2023-03-19 11:07:08] [INFO ] Deduced a trap composed of 21 places in 2364 ms of which 6 ms to minimize.
[2023-03-19 11:07:08] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 16604 ms
[2023-03-19 11:07:08] [INFO ] After 23324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:07:08] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 12 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 5 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7800 place count 2801 transition count 2101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2801 transition count 2100
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7803 place count 2800 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2501 transition count 2099
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2497 transition count 2096
Applied a total of 8706 rules in 1910 ms. Remains 2497 /6701 variables (removed 4204) and now considering 2096/6001 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1910 ms. Remains : 2497/6701 places, 2096/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 76514 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76514 steps, saw 51807 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-19 11:07:14] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-19 11:07:14] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:07:14] [INFO ] [Nat]Absence check using 1100 positive place invariants in 206 ms returned sat
[2023-03-19 11:07:16] [INFO ] After 1262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:07:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:07:16] [INFO ] After 99ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:07:16] [INFO ] Deduced a trap composed of 5 places in 442 ms of which 0 ms to minimize.
[2023-03-19 11:07:17] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 0 ms to minimize.
[2023-03-19 11:07:17] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 0 ms to minimize.
[2023-03-19 11:07:17] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2023-03-19 11:07:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1679 ms
[2023-03-19 11:07:18] [INFO ] After 1859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-19 11:07:18] [INFO ] After 3816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 92 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2497/2497 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 91 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-19 11:07:18] [INFO ] Invariant cache hit.
[2023-03-19 11:07:20] [INFO ] Implicit Places using invariants in 2274 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2285 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2495/2497 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2493 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2493 transition count 2094
Applied a total of 4 rules in 172 ms. Remains 2493 /2495 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:07:20] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 11:07:22] [INFO ] Implicit Places using invariants in 1894 ms returned []
[2023-03-19 11:07:22] [INFO ] Invariant cache hit.
[2023-03-19 11:07:26] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 5660 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2493/2497 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8209 ms. Remains : 2493/2497 places, 2094/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 74928 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74928 steps, saw 50786 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:07:29] [INFO ] Invariant cache hit.
[2023-03-19 11:07:30] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:07:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 209 ms returned sat
[2023-03-19 11:07:31] [INFO ] After 1139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:07:32] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-19 11:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2023-03-19 11:07:32] [INFO ] After 1665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-19 11:07:32] [INFO ] After 2317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 96 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 93 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-19 11:07:32] [INFO ] Invariant cache hit.
[2023-03-19 11:07:35] [INFO ] Implicit Places using invariants in 2280 ms returned []
[2023-03-19 11:07:35] [INFO ] Invariant cache hit.
[2023-03-19 11:07:39] [INFO ] Implicit Places using invariants and state equation in 4293 ms returned []
Implicit Place search using SMT with State Equation took 6589 ms to find 0 implicit places.
[2023-03-19 11:07:39] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 11:07:39] [INFO ] Invariant cache hit.
[2023-03-19 11:07:41] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8630 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 238 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:07:41] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 11:07:41] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:07:42] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2023-03-19 11:07:43] [INFO ] After 1294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:07:43] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-19 11:07:43] [INFO ] After 262ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:07:45] [INFO ] Deduced a trap composed of 6 places in 916 ms of which 2 ms to minimize.
[2023-03-19 11:07:45] [INFO ] Deduced a trap composed of 6 places in 700 ms of which 3 ms to minimize.
[2023-03-19 11:07:46] [INFO ] Deduced a trap composed of 5 places in 805 ms of which 2 ms to minimize.
[2023-03-19 11:07:47] [INFO ] Deduced a trap composed of 5 places in 684 ms of which 1 ms to minimize.
[2023-03-19 11:07:48] [INFO ] Deduced a trap composed of 5 places in 693 ms of which 2 ms to minimize.
[2023-03-19 11:07:49] [INFO ] Deduced a trap composed of 7 places in 745 ms of which 2 ms to minimize.
[2023-03-19 11:07:50] [INFO ] Deduced a trap composed of 5 places in 653 ms of which 2 ms to minimize.
[2023-03-19 11:07:50] [INFO ] Deduced a trap composed of 5 places in 753 ms of which 1 ms to minimize.
[2023-03-19 11:07:51] [INFO ] Deduced a trap composed of 5 places in 873 ms of which 2 ms to minimize.
[2023-03-19 11:07:52] [INFO ] Deduced a trap composed of 5 places in 672 ms of which 1 ms to minimize.
[2023-03-19 11:07:53] [INFO ] Deduced a trap composed of 5 places in 652 ms of which 2 ms to minimize.
[2023-03-19 11:07:54] [INFO ] Deduced a trap composed of 5 places in 743 ms of which 2 ms to minimize.
[2023-03-19 11:07:55] [INFO ] Deduced a trap composed of 7 places in 764 ms of which 1 ms to minimize.
[2023-03-19 11:07:56] [INFO ] Deduced a trap composed of 9 places in 760 ms of which 1 ms to minimize.
[2023-03-19 11:07:57] [INFO ] Deduced a trap composed of 5 places in 712 ms of which 2 ms to minimize.
[2023-03-19 11:07:58] [INFO ] Deduced a trap composed of 11 places in 785 ms of which 2 ms to minimize.
[2023-03-19 11:07:58] [INFO ] Deduced a trap composed of 5 places in 683 ms of which 1 ms to minimize.
[2023-03-19 11:07:59] [INFO ] Deduced a trap composed of 7 places in 615 ms of which 1 ms to minimize.
[2023-03-19 11:08:00] [INFO ] Deduced a trap composed of 7 places in 632 ms of which 1 ms to minimize.
[2023-03-19 11:08:00] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 16560 ms
[2023-03-19 11:08:00] [INFO ] After 16904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 11:08:00] [INFO ] After 18900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 526 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-19 11:08:01] [INFO ] Computed 1101 place invariants in 47 ms
[2023-03-19 11:08:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 7082 ms returned sat
[2023-03-19 11:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:08:16] [INFO ] [Real]Absence check using state equation in 809 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1542 ms.
Product exploration explored 100000 steps with 0 reset in 2073 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 6001
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 499 Pre rules applied. Total rules applied 1399 place count 6701 transition count 6400
Deduced a syphon composed of 1898 places in 23 ms
Iterating global reduction 1 with 499 rules applied. Total rules applied 1898 place count 6701 transition count 6400
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3796 places in 27 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3796 place count 6701 transition count 6400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3797 place count 6701 transition count 6399
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 2 with 701 rule applications. Total rules 4498 place count 6000 transition count 5698
Deduced a syphon composed of 3095 places in 28 ms
Iterating global reduction 2 with 701 rules applied. Total rules applied 5199 place count 6000 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3096 places in 22 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5200 place count 6000 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5202 place count 5998 transition count 5696
Deduced a syphon composed of 3094 places in 23 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5204 place count 5998 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3195 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5305 place count 5998 transition count 6126
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5406 place count 5897 transition count 5924
Deduced a syphon composed of 3094 places in 25 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5507 place count 5897 transition count 5924
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3195 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5608 place count 5897 transition count 6351
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5709 place count 5796 transition count 6149
Deduced a syphon composed of 3094 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5810 place count 5796 transition count 6149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -431
Deduced a syphon composed of 3195 places in 21 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5911 place count 5796 transition count 6580
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6012 place count 5695 transition count 6378
Deduced a syphon composed of 3094 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6113 place count 5695 transition count 6378
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -403
Deduced a syphon composed of 3189 places in 19 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6208 place count 5695 transition count 6781
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6303 place count 5600 transition count 6591
Deduced a syphon composed of 3094 places in 18 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6398 place count 5600 transition count 6591
Deduced a syphon composed of 3094 places in 18 ms
Applied a total of 6398 rules in 9524 ms. Remains 5600 /6701 variables (removed 1101) and now considering 6591/6001 (removed -590) transitions.
[2023-03-19 11:08:31] [INFO ] Redundant transitions in 413 ms returned []
// Phase 1: matrix 6591 rows 5600 cols
[2023-03-19 11:08:31] [INFO ] Computed 1101 place invariants in 194 ms
[2023-03-19 11:08:37] [INFO ] Dead Transitions using invariants and state equation in 6189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/6701 places, 6591/6001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16147 ms. Remains : 5600/6701 places, 6591/6001 transitions.
Built C files in :
/tmp/ltsmin17272042250422204658
[2023-03-19 11:08:37] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17272042250422204658
Running compilation step : cd /tmp/ltsmin17272042250422204658;'/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/ltsmin17272042250422204658;'/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/ltsmin17272042250422204658;'/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 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1031 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-19 11:08:41] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-19 11:08:44] [INFO ] Implicit Places using invariants in 3194 ms returned []
[2023-03-19 11:08:44] [INFO ] Invariant cache hit.
[2023-03-19 11:08:47] [INFO ] Implicit Places using invariants and state equation in 3034 ms returned []
Implicit Place search using SMT with State Equation took 6230 ms to find 0 implicit places.
[2023-03-19 11:08:47] [INFO ] Invariant cache hit.
[2023-03-19 11:08:53] [INFO ] Dead Transitions using invariants and state equation in 5811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13073 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Built C files in :
/tmp/ltsmin6169169838180123781
[2023-03-19 11:08:53] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6169169838180123781
Running compilation step : cd /tmp/ltsmin6169169838180123781;'/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/ltsmin6169169838180123781;'/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/ltsmin6169169838180123781;'/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 11:08:57] [INFO ] Flatten gal took : 155 ms
[2023-03-19 11:08:57] [INFO ] Flatten gal took : 140 ms
[2023-03-19 11:08:57] [INFO ] Time to serialize gal into /tmp/LTL4849081650655146733.gal : 24 ms
[2023-03-19 11:08:57] [INFO ] Time to serialize properties into /tmp/LTL8158308712260206782.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/LTL4849081650655146733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16269295795511217897.hoa' '-atoms' '/tmp/LTL8158308712260206782.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/LTL8158308712260206782.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16269295795511217897.hoa
Detected timeout of ITS tools.
[2023-03-19 11:09:12] [INFO ] Flatten gal took : 145 ms
[2023-03-19 11:09:12] [INFO ] Flatten gal took : 148 ms
[2023-03-19 11:09:13] [INFO ] Time to serialize gal into /tmp/LTL13283664234437970621.gal : 24 ms
[2023-03-19 11:09:13] [INFO ] Time to serialize properties into /tmp/LTL15576044312427953363.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/LTL13283664234437970621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15576044312427953363.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...277
Read 1 LTL properties
Checking formula 0 : !(((F((F("((p7604==0)||(p4848==1))"))&&(X("(p4709==1)"))))&&(G("(p2192==0)"))))
Formula 0 simplified : G(G!"((p7604==0)||(p4848==1))" | X!"(p4709==1)") | F!"(p2192==0)"
Detected timeout of ITS tools.
[2023-03-19 11:09:28] [INFO ] Flatten gal took : 189 ms
[2023-03-19 11:09:28] [INFO ] Applying decomposition
[2023-03-19 11:09:28] [INFO ] Flatten gal took : 160 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/graph5005090657773361405.txt' '-o' '/tmp/graph5005090657773361405.bin' '-w' '/tmp/graph5005090657773361405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5005090657773361405.bin' '-l' '-1' '-v' '-w' '/tmp/graph5005090657773361405.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:09:28] [INFO ] Decomposing Gal with order
[2023-03-19 11:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:09:31] [INFO ] Removed a total of 997 redundant transitions.
[2023-03-19 11:09:31] [INFO ] Flatten gal took : 311 ms
[2023-03-19 11:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2023-03-19 11:09:31] [INFO ] Time to serialize gal into /tmp/LTL5504319756424150026.gal : 40 ms
[2023-03-19 11:09:31] [INFO ] Time to serialize properties into /tmp/LTL12215587327991964705.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/LTL5504319756424150026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12215587327991964705.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...255
Read 1 LTL properties
Checking formula 0 : !(((F((F("((i69.u2334.p7604==0)||(i43.u1491.p4848==1))"))&&(X("(i42.u1446.p4709==1)"))))&&(G("(i19.u684.p2192==0)"))))
Formula 0 simplified : G(G!"((i69.u2334.p7604==0)||(i43.u1491.p4848==1))" | X!"(i42.u1446.p4709==1)") | F!"(i19.u684.p2192==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8151149106882420600
[2023-03-19 11:09:46] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8151149106882420600
Running compilation step : cd /tmp/ltsmin8151149106882420600;'/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/ltsmin8151149106882420600;'/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/ltsmin8151149106882420600;'/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 ShieldPPPt-PT-100B-LTLCardinality-11 finished in 319009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6705 transition count 4607
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 14 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 6 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8401 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2098
Applied a total of 8408 rules in 2231 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-19 11:09:51] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-19 11:09:54] [INFO ] Implicit Places using invariants in 2536 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2540 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 285 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-19 11:09:54] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:09:57] [INFO ] Implicit Places using invariants in 2462 ms returned []
[2023-03-19 11:09:57] [INFO ] Invariant cache hit.
[2023-03-19 11:10:01] [INFO ] Implicit Places using invariants and state equation in 4375 ms returned []
Implicit Place search using SMT with State Equation took 6839 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11896 ms. Remains : 2496/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1697 0) (EQ s1893 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1403 ms.
Product exploration explored 100000 steps with 0 reset in 1763 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98128 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98128 steps, saw 74357 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:10:08] [INFO ] Invariant cache hit.
[2023-03-19 11:10:08] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:10:09] [INFO ] [Nat]Absence check using 1098 positive place invariants in 253 ms returned sat
[2023-03-19 11:10:10] [INFO ] After 1232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:10:10] [INFO ] After 1419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-19 11:10:10] [INFO ] After 2229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 97 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 103202 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103202 steps, saw 78088 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:10:14] [INFO ] Invariant cache hit.
[2023-03-19 11:10:14] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:10:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 222 ms returned sat
[2023-03-19 11:10:16] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:10:16] [INFO ] After 1458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-19 11:10:16] [INFO ] After 2174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 101 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 144 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-19 11:10:17] [INFO ] Invariant cache hit.
[2023-03-19 11:10:19] [INFO ] Implicit Places using invariants in 2562 ms returned []
[2023-03-19 11:10:19] [INFO ] Invariant cache hit.
[2023-03-19 11:10:24] [INFO ] Implicit Places using invariants and state equation in 4537 ms returned []
Implicit Place search using SMT with State Equation took 7105 ms to find 0 implicit places.
[2023-03-19 11:10:24] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-19 11:10:24] [INFO ] Invariant cache hit.
[2023-03-19 11:10:25] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8540 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 199 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-19 11:10:25] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:10:26] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:10:26] [INFO ] [Nat]Absence check using 1098 positive place invariants in 250 ms returned sat
[2023-03-19 11:10:28] [INFO ] After 1201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:10:28] [INFO ] After 1426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-19 11:10:28] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 122 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-19 11:10:29] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 11:10:31] [INFO ] Implicit Places using invariants in 2504 ms returned []
[2023-03-19 11:10:31] [INFO ] Invariant cache hit.
[2023-03-19 11:10:35] [INFO ] Implicit Places using invariants and state equation in 4286 ms returned []
Implicit Place search using SMT with State Equation took 6794 ms to find 0 implicit places.
[2023-03-19 11:10:35] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-19 11:10:35] [INFO ] Invariant cache hit.
[2023-03-19 11:10:38] [INFO ] Dead Transitions using invariants and state equation in 2052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9049 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 444 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93975 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93975 steps, saw 71435 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:10:41] [INFO ] Invariant cache hit.
[2023-03-19 11:10:42] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:10:42] [INFO ] [Nat]Absence check using 1098 positive place invariants in 244 ms returned sat
[2023-03-19 11:10:44] [INFO ] After 1265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:10:44] [INFO ] After 1441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-19 11:10:44] [INFO ] After 2211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 86 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 96506 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96506 steps, saw 73194 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:10:47] [INFO ] Invariant cache hit.
[2023-03-19 11:10:48] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:10:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 294 ms returned sat
[2023-03-19 11:10:50] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:10:50] [INFO ] After 1569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-19 11:10:50] [INFO ] After 2433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 140 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 96 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-19 11:10:51] [INFO ] Invariant cache hit.
[2023-03-19 11:10:53] [INFO ] Implicit Places using invariants in 2480 ms returned []
[2023-03-19 11:10:53] [INFO ] Invariant cache hit.
[2023-03-19 11:10:57] [INFO ] Implicit Places using invariants and state equation in 4330 ms returned []
Implicit Place search using SMT with State Equation took 6812 ms to find 0 implicit places.
[2023-03-19 11:10:57] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-19 11:10:57] [INFO ] Invariant cache hit.
[2023-03-19 11:11:00] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9099 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 220 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-19 11:11:00] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-19 11:11:00] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:11:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 234 ms returned sat
[2023-03-19 11:11:02] [INFO ] After 1231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:11:02] [INFO ] After 1403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-19 11:11:02] [INFO ] After 2158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1416 ms.
Product exploration explored 100000 steps with 0 reset in 1843 ms.
Built C files in :
/tmp/ltsmin17212868282169707023
[2023-03-19 11:11:06] [INFO ] Too many transitions (2096) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:11:06] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17212868282169707023
Running compilation step : cd /tmp/ltsmin17212868282169707023;'/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/ltsmin17212868282169707023;'/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/ltsmin17212868282169707023;'/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 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 125 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-19 11:11:09] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-19 11:11:12] [INFO ] Implicit Places using invariants in 2495 ms returned []
[2023-03-19 11:11:12] [INFO ] Invariant cache hit.
[2023-03-19 11:11:16] [INFO ] Implicit Places using invariants and state equation in 4289 ms returned []
Implicit Place search using SMT with State Equation took 6789 ms to find 0 implicit places.
[2023-03-19 11:11:16] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-19 11:11:16] [INFO ] Invariant cache hit.
[2023-03-19 11:11:18] [INFO ] Dead Transitions using invariants and state equation in 2059 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9054 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Built C files in :
/tmp/ltsmin11530196791294792523
[2023-03-19 11:11:18] [INFO ] Too many transitions (2096) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:11:19] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11530196791294792523
Running compilation step : cd /tmp/ltsmin11530196791294792523;'/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/ltsmin11530196791294792523;'/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/ltsmin11530196791294792523;'/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 11:11:22] [INFO ] Flatten gal took : 55 ms
[2023-03-19 11:11:22] [INFO ] Flatten gal took : 53 ms
[2023-03-19 11:11:22] [INFO ] Time to serialize gal into /tmp/LTL1546342065977554663.gal : 13 ms
[2023-03-19 11:11:22] [INFO ] Time to serialize properties into /tmp/LTL488464492498362097.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/LTL1546342065977554663.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2215033504930295505.hoa' '-atoms' '/tmp/LTL488464492498362097.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...316
Loading property file /tmp/LTL488464492498362097.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2215033504930295505.hoa
Detected timeout of ITS tools.
[2023-03-19 11:11:37] [INFO ] Flatten gal took : 54 ms
[2023-03-19 11:11:37] [INFO ] Flatten gal took : 54 ms
[2023-03-19 11:11:37] [INFO ] Time to serialize gal into /tmp/LTL18188215869246582302.gal : 9 ms
[2023-03-19 11:11:37] [INFO ] Time to serialize properties into /tmp/LTL16074841551891093967.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/LTL18188215869246582302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16074841551891093967.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p5299==0)||(p5906==1))"))))
Formula 0 simplified : FG!"((p5299==0)||(p5906==1))"
Detected timeout of ITS tools.
[2023-03-19 11:11:52] [INFO ] Flatten gal took : 160 ms
[2023-03-19 11:11:52] [INFO ] Applying decomposition
[2023-03-19 11:11:52] [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/graph14502159755966114735.txt' '-o' '/tmp/graph14502159755966114735.bin' '-w' '/tmp/graph14502159755966114735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14502159755966114735.bin' '-l' '-1' '-v' '-w' '/tmp/graph14502159755966114735.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:11:53] [INFO ] Decomposing Gal with order
[2023-03-19 11:11:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:11:53] [INFO ] Removed a total of 608 redundant transitions.
[2023-03-19 11:11:53] [INFO ] Flatten gal took : 104 ms
[2023-03-19 11:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 31 ms.
[2023-03-19 11:11:53] [INFO ] Time to serialize gal into /tmp/LTL2419242837763327460.gal : 23 ms
[2023-03-19 11:11:53] [INFO ] Time to serialize properties into /tmp/LTL4757284666667529886.ltl : 3 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/LTL2419242837763327460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4757284666667529886.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i28.i1.i1.u545.p5299==0)||(i31.i1.i1.u608.p5906==1))"))))
Formula 0 simplified : FG!"((i28.i1.i1.u545.p5299==0)||(i31.i1.i1.u608.p5906==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1379 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.1078,224644,1,0,344687,336,5767,820652,223,1953,388420
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-12 finished in 139010 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(G(p0)) U p1)))'
Support contains 6 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 6703 transition count 6003
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 6703 transition count 6003
Applied a total of 6 rules in 2193 ms. Remains 6703 /6706 variables (removed 3) and now considering 6003/6006 (removed 3) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2023-03-19 11:12:10] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-19 11:12:13] [INFO ] Implicit Places using invariants in 2885 ms returned []
[2023-03-19 11:12:13] [INFO ] Invariant cache hit.
[2023-03-19 11:12:16] [INFO ] Implicit Places using invariants and state equation in 2936 ms returned []
Implicit Place search using SMT with State Equation took 5824 ms to find 0 implicit places.
[2023-03-19 11:12:16] [INFO ] Invariant cache hit.
[2023-03-19 11:12:22] [INFO ] Dead Transitions using invariants and state equation in 5773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6706 places, 6003/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13792 ms. Remains : 6703/6706 places, 6003/6006 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s894 0) (EQ s3804 1)), p0:(OR (EQ s4938 0) (EQ s4337 1) (EQ s1878 0) (EQ s3048 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 50000 reset in 3395 ms.
Product exploration explored 100000 steps with 50000 reset in 3508 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-14 finished in 21335 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((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&G(p2)))'
Found a Shortening insensitive property : ShieldPPPt-PT-100B-LTLCardinality-11
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3810
Deduced a syphon composed of 797 places in 13 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4390 place count 4510 transition count 3810
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4394 place count 4506 transition count 3806
Iterating global reduction 3 with 4 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3802
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4406 place count 4502 transition count 3802
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 3 with 3390 rules applied. Total rules applied 7796 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2807 transition count 2106
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8001 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8203 place count 2604 transition count 2105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2507 transition count 2105
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 8398 place count 2507 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8400 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8401 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8401 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8405 place count 2502 transition count 2101
Applied a total of 8405 rules in 2380 ms. Remains 2502 /6706 variables (removed 4204) and now considering 2101/6006 (removed 3905) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2023-03-19 11:12:32] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-19 11:12:35] [INFO ] Implicit Places using invariants in 2319 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2328 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/6706 places, 2101/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 154 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-19 11:12:35] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-19 11:12:37] [INFO ] Implicit Places using invariants in 2104 ms returned []
[2023-03-19 11:12:37] [INFO ] Invariant cache hit.
[2023-03-19 11:12:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:12:41] [INFO ] Implicit Places using invariants and state equation in 4287 ms returned []
Implicit Place search using SMT with State Equation took 6414 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2498/6706 places, 2099/6006 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11276 ms. Remains : 2498/6706 places, 2099/6006 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s678 0), p0:(OR (EQ s2448 0) (EQ s1549 1)), p1:(EQ s1500 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1455 ms.
Product exploration explored 100000 steps with 1 reset in 1808 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 749 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:12:46] [INFO ] Invariant cache hit.
[2023-03-19 11:12:46] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:12:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 273 ms returned sat
[2023-03-19 11:12:48] [INFO ] After 1381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:12:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:12:48] [INFO ] After 107ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:12:49] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-19 11:12:49] [INFO ] After 2478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2498 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2497 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2497 transition count 2096
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2495 transition count 2096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2494 transition count 2095
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2494 transition count 2095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2493 transition count 2094
Applied a total of 12 rules in 337 ms. Remains 2493 /2498 variables (removed 5) and now considering 2094/2099 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 2493/2498 places, 2094/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 100678 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100678 steps, saw 72088 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:12:52] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 11:12:53] [INFO ] After 649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:12:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2023-03-19 11:12:55] [INFO ] After 1495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:12:55] [INFO ] After 1665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-19 11:12:55] [INFO ] After 2316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 102 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 109 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-19 11:12:56] [INFO ] Invariant cache hit.
[2023-03-19 11:12:58] [INFO ] Implicit Places using invariants in 2681 ms returned []
[2023-03-19 11:12:58] [INFO ] Invariant cache hit.
[2023-03-19 11:13:03] [INFO ] Implicit Places using invariants and state equation in 4326 ms returned []
Implicit Place search using SMT with State Equation took 7028 ms to find 0 implicit places.
[2023-03-19 11:13:03] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-19 11:13:03] [INFO ] Invariant cache hit.
[2023-03-19 11:13:04] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8949 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 195 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:13:05] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-19 11:13:05] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:13:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 191 ms returned sat
[2023-03-19 11:13:07] [INFO ] After 1319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 11:13:07] [INFO ] After 114ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:07] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-19 11:13:07] [INFO ] After 2158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 595 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-19 11:13:08] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-19 11:13:13] [INFO ] [Real]Absence check using 1098 positive place invariants in 1338 ms returned sat
[2023-03-19 11:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:13:23] [INFO ] [Real]Absence check using state equation in 10591 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 74 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-19 11:13:23] [INFO ] Invariant cache hit.
[2023-03-19 11:13:25] [INFO ] Implicit Places using invariants in 1754 ms returned []
[2023-03-19 11:13:25] [INFO ] Invariant cache hit.
[2023-03-19 11:13:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:13:29] [INFO ] Implicit Places using invariants and state equation in 4122 ms returned []
Implicit Place search using SMT with State Equation took 5892 ms to find 0 implicit places.
[2023-03-19 11:13:29] [INFO ] Invariant cache hit.
[2023-03-19 11:13:31] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8260 ms. Remains : 2498/2498 places, 2099/2099 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 : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:13:32] [INFO ] Invariant cache hit.
[2023-03-19 11:13:33] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:13:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 228 ms returned sat
[2023-03-19 11:13:35] [INFO ] After 1261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:13:35] [INFO ] After 96ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:35] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-19 11:13:35] [INFO ] After 2218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2498 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2497 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2497 transition count 2096
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2495 transition count 2096
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2494 transition count 2095
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2494 transition count 2095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2493 transition count 2094
Applied a total of 12 rules in 416 ms. Remains 2493 /2498 variables (removed 5) and now considering 2094/2099 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 2493/2498 places, 2094/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102399 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102399 steps, saw 73419 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:13:39] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-19 11:13:39] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:13:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 260 ms returned sat
[2023-03-19 11:13:41] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:41] [INFO ] After 1161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-19 11:13:41] [INFO ] After 1814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 78 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 102 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-19 11:13:41] [INFO ] Invariant cache hit.
[2023-03-19 11:13:43] [INFO ] Implicit Places using invariants in 2314 ms returned []
[2023-03-19 11:13:43] [INFO ] Invariant cache hit.
[2023-03-19 11:13:48] [INFO ] Implicit Places using invariants and state equation in 4815 ms returned []
Implicit Place search using SMT with State Equation took 7150 ms to find 0 implicit places.
[2023-03-19 11:13:48] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-19 11:13:48] [INFO ] Invariant cache hit.
[2023-03-19 11:13:50] [INFO ] Dead Transitions using invariants and state equation in 1406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8721 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 191 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-19 11:13:50] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-19 11:13:50] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:13:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 203 ms returned sat
[2023-03-19 11:13:52] [INFO ] After 1206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 11:13:52] [INFO ] After 112ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:13:52] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-19 11:13:52] [INFO ] After 2196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 557 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-19 11:13:54] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-19 11:13:59] [INFO ] [Real]Absence check using 1098 positive place invariants in 1534 ms returned sat
[2023-03-19 11:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:14:09] [INFO ] [Real]Absence check using state equation in 9773 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 1351 ms.
Product exploration explored 100000 steps with 0 reset in 1790 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 106 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-19 11:14:12] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-19 11:14:12] [INFO ] Invariant cache hit.
[2023-03-19 11:14:14] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2114 ms. Remains : 2498/2498 places, 2099/2099 transitions.
Built C files in :
/tmp/ltsmin13684920422843333057
[2023-03-19 11:14:14] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13684920422843333057
Running compilation step : cd /tmp/ltsmin13684920422843333057;'/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/ltsmin13684920422843333057;'/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/ltsmin13684920422843333057;'/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 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 79 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-19 11:14:18] [INFO ] Invariant cache hit.
[2023-03-19 11:14:20] [INFO ] Implicit Places using invariants in 2185 ms returned []
[2023-03-19 11:14:20] [INFO ] Invariant cache hit.
[2023-03-19 11:14:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 11:14:24] [INFO ] Implicit Places using invariants and state equation in 4758 ms returned []
Implicit Place search using SMT with State Equation took 6973 ms to find 0 implicit places.
[2023-03-19 11:14:24] [INFO ] Invariant cache hit.
[2023-03-19 11:14:26] [INFO ] Dead Transitions using invariants and state equation in 1769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8822 ms. Remains : 2498/2498 places, 2099/2099 transitions.
Built C files in :
/tmp/ltsmin4077283158898781999
[2023-03-19 11:14:26] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4077283158898781999
Running compilation step : cd /tmp/ltsmin4077283158898781999;'/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/ltsmin4077283158898781999;'/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/ltsmin4077283158898781999;'/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 11:14:30] [INFO ] Flatten gal took : 56 ms
[2023-03-19 11:14:30] [INFO ] Flatten gal took : 58 ms
[2023-03-19 11:14:30] [INFO ] Time to serialize gal into /tmp/LTL457858882975575243.gal : 10 ms
[2023-03-19 11:14:30] [INFO ] Time to serialize properties into /tmp/LTL15652716512225539799.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/LTL457858882975575243.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8488044781317746685.hoa' '-atoms' '/tmp/LTL15652716512225539799.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...317
Loading property file /tmp/LTL15652716512225539799.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8488044781317746685.hoa
Detected timeout of ITS tools.
[2023-03-19 11:14:45] [INFO ] Flatten gal took : 54 ms
[2023-03-19 11:14:45] [INFO ] Flatten gal took : 57 ms
[2023-03-19 11:14:45] [INFO ] Time to serialize gal into /tmp/LTL8524843792118134168.gal : 9 ms
[2023-03-19 11:14:45] [INFO ] Time to serialize properties into /tmp/LTL4269013527890869554.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/LTL8524843792118134168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4269013527890869554.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((F("((p7604==0)||(p4848==1))"))&&(X("(p4709==1)"))))&&(G("(p2192==0)"))))
Formula 0 simplified : G(G!"((p7604==0)||(p4848==1))" | X!"(p4709==1)") | F!"(p2192==0)"
Detected timeout of ITS tools.
[2023-03-19 11:15:00] [INFO ] Flatten gal took : 104 ms
[2023-03-19 11:15:00] [INFO ] Applying decomposition
[2023-03-19 11:15:00] [INFO ] Flatten gal took : 58 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/graph17949693159154161916.txt' '-o' '/tmp/graph17949693159154161916.bin' '-w' '/tmp/graph17949693159154161916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17949693159154161916.bin' '-l' '-1' '-v' '-w' '/tmp/graph17949693159154161916.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:15:00] [INFO ] Decomposing Gal with order
[2023-03-19 11:15:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:15:00] [INFO ] Removed a total of 611 redundant transitions.
[2023-03-19 11:15:01] [INFO ] Flatten gal took : 92 ms
[2023-03-19 11:15:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 15 ms.
[2023-03-19 11:15:01] [INFO ] Time to serialize gal into /tmp/LTL15128939790136478759.gal : 21 ms
[2023-03-19 11:15:01] [INFO ] Time to serialize properties into /tmp/LTL15937855221561670149.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/LTL15128939790136478759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15937855221561670149.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...256
Read 1 LTL properties
Checking formula 0 : !(((F((F("((i43.i0.i0.u787.p7604==0)||(i27.i0.i0.u498.p4848==1))"))&&(X("(i26.i0.i2.u481.p4709==1)"))))&&(G("(i12.i1.i2.u218.p2192==0)...160
Formula 0 simplified : G(G!"((i43.i0.i0.u787.p7604==0)||(i27.i0.i0.u498.p4848==1))" | X!"(i26.i0.i2.u481.p4709==1)") | F!"(i12.i1.i2.u218.p2192==0)"
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t1606, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i2.u10.t...5954
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16090792598052657827
[2023-03-19 11:15:16] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16090792598052657827
Running compilation step : cd /tmp/ltsmin16090792598052657827;'/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/ltsmin16090792598052657827;'/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/ltsmin16090792598052657827;'/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 ShieldPPPt-PT-100B-LTLCardinality-11 finished in 169257 ms.
[2023-03-19 11:15:19] [INFO ] Flatten gal took : 160 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15515018579018734888
[2023-03-19 11:15:19] [INFO ] Too many transitions (6006) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:15:19] [INFO ] Applying decomposition
[2023-03-19 11:15:19] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15515018579018734888
Running compilation step : cd /tmp/ltsmin15515018579018734888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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 11:15:19] [INFO ] Flatten gal took : 132 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/graph17223573450938158657.txt' '-o' '/tmp/graph17223573450938158657.bin' '-w' '/tmp/graph17223573450938158657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17223573450938158657.bin' '-l' '-1' '-v' '-w' '/tmp/graph17223573450938158657.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:15:20] [INFO ] Decomposing Gal with order
[2023-03-19 11:15:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:15:22] [INFO ] Removed a total of 980 redundant transitions.
[2023-03-19 11:15:22] [INFO ] Flatten gal took : 225 ms
[2023-03-19 11:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-19 11:15:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality13659864993703954773.gal : 47 ms
[2023-03-19 11:15:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality7530920634427580432.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/LTLCardinality13659864993703954773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7530920634427580432.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...277
Read 2 LTL properties
Checking formula 0 : !((F(G(("(((i13.u425.p1346==0)||(i17.u522.p1664==1))||((i62.u2061.p6718==0)||(i56.u1809.p5895==1)))")||(F("((i62.u2061.p6718==0)||(i56...179
Formula 0 simplified : G(F!"(((i13.u425.p1346==0)||(i17.u522.p1664==1))||((i62.u2061.p6718==0)||(i56.u1809.p5895==1)))" & FG!"((i62.u2061.p6718==0)||(i56.u...172
Compilation finished in 25908 ms.
Running link step : cd /tmp/ltsmin15515018579018734888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 144 ms.
Running LTSmin : cd /tmp/ltsmin15515018579018734888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 11:40:59] [INFO ] Applying decomposition
[2023-03-19 11:41:01] [INFO ] Flatten gal took : 1414 ms
[2023-03-19 11:41:02] [INFO ] Decomposing Gal with order
[2023-03-19 11:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:41:21] [INFO ] Removed a total of 297 redundant transitions.
[2023-03-19 11:41:21] [INFO ] Flatten gal took : 606 ms
[2023-03-19 11:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1184 labels/synchronizations in 342 ms.
[2023-03-19 11:41:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality7859668197208617654.gal : 142 ms
[2023-03-19 11:41:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality10044106432916904870.ltl : 6 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/LTLCardinality7859668197208617654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10044106432916904870.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...277
Read 2 LTL properties
Checking formula 0 : !((F(G(("(((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.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...969
Formula 0 simplified : G(F!"(((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.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...962
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15515018579018734888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15515018579018734888;'/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' '(<>((<>((LTLAPp2==true))&&X((LTLAPp3==true))))&&[]((LTLAPp4==true)))' '--buchi-type=spotba'
LTSmin run took 45406 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin15515018579018734888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 4213304 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16135656 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldPPPt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713900699"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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