Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716958999257

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 05:03:21] [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]
[2024-05-29 05:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:03:21] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-05-29 05:03:21] [INFO ] Transformed 7003 places.
[2024-05-29 05:03:21] [INFO ] Transformed 6503 transitions.
[2024-05-29 05:03:21] [INFO ] Found NUPN structural information;
[2024-05-29 05:03:21] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1086 places :
Symmetric choice reduction at 0 with 1086 rule applications. Total rules 1086 place count 5917 transition count 5417
Iterating global reduction 0 with 1086 rules applied. Total rules applied 2172 place count 5917 transition count 5417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2173 place count 5916 transition count 5416
Iterating global reduction 0 with 1 rules applied. Total rules applied 2174 place count 5916 transition count 5416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2175 place count 5915 transition count 5415
Iterating global reduction 0 with 1 rules applied. Total rules applied 2176 place count 5915 transition count 5415
Applied a total of 2176 rules in 3855 ms. Remains 5915 /7003 variables (removed 1088) and now considering 5415/6503 (removed 1088) transitions.
// Phase 1: matrix 5415 rows 5915 cols
[2024-05-29 05:03:26] [INFO ] Computed 901 invariants in 67 ms
[2024-05-29 05:03:28] [INFO ] Implicit Places using invariants in 2557 ms returned []
[2024-05-29 05:03:28] [INFO ] Invariant cache hit.
[2024-05-29 05:03:30] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 4630 ms to find 0 implicit places.
[2024-05-29 05:03:30] [INFO ] Invariant cache hit.
[2024-05-29 05:03:35] [INFO ] Dead Transitions using invariants and state equation in 4527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5915/7003 places, 5415/6503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13017 ms. Remains : 5915/7003 places, 5415/6503 transitions.
Support contains 44 out of 5915 places after structural reductions.
[2024-05-29 05:03:36] [INFO ] Flatten gal took : 529 ms
[2024-05-29 05:03:36] [INFO ] Flatten gal took : 245 ms
[2024-05-29 05:03:36] [INFO ] Input system was already deterministic with 5415 transitions.
Support contains 41 out of 5915 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-29 05:03:38] [INFO ] Invariant cache hit.
[2024-05-29 05:03:39] [INFO ] After 1912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 05:03:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 621 ms returned sat
[2024-05-29 05:03:49] [INFO ] After 6593ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2024-05-29 05:03:53] [INFO ] Deduced a trap composed of 23 places in 3389 ms of which 20 ms to minimize.
[2024-05-29 05:03:57] [INFO ] Deduced a trap composed of 21 places in 4365 ms of which 5 ms to minimize.
[2024-05-29 05:04:01] [INFO ] Deduced a trap composed of 20 places in 3503 ms of which 5 ms to minimize.
[2024-05-29 05:04:05] [INFO ] Deduced a trap composed of 18 places in 3521 ms of which 4 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 05:04:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 05:04:05] [INFO ] After 25256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 1 properties in 3364 ms.
Support contains 26 out of 5915 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Drop transitions removed 1188 transitions
Trivial Post-agglo rules discarded 1188 transitions
Performed 1188 trivial Post agglomeration. Transition count delta: 1188
Iterating post reduction 0 with 1188 rules applied. Total rules applied 1188 place count 5915 transition count 4227
Reduce places removed 1188 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1191 rules applied. Total rules applied 2379 place count 4727 transition count 4224
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2382 place count 4724 transition count 4224
Performed 790 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 790 Pre rules applied. Total rules applied 2382 place count 4724 transition count 3434
Deduced a syphon composed of 790 places in 10 ms
Reduce places removed 790 places and 0 transitions.
Iterating global reduction 3 with 1580 rules applied. Total rules applied 3962 place count 3934 transition count 3434
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 3963 place count 3933 transition count 3433
Iterating global reduction 3 with 1 rules applied. Total rules applied 3964 place count 3933 transition count 3433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3964 place count 3933 transition count 3432
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3966 place count 3932 transition count 3432
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7362 place count 2234 transition count 1734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7363 place count 2234 transition count 1733
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 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7365 place count 2233 transition count 1732
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
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 7567 place count 2132 transition count 1795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7769 place count 2031 transition count 1859
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 94 places in 6 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 7957 place count 1937 transition count 1920
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7958 place count 1937 transition count 1919
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 7959 place count 1937 transition count 1918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7960 place count 1936 transition count 1918
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 8058 place count 1936 transition count 1918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8059 place count 1935 transition count 1917
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8061 place count 1933 transition count 1917
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8061 place count 1933 transition count 1916
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8063 place count 1932 transition count 1916
Applied a total of 8063 rules in 1901 ms. Remains 1932 /5915 variables (removed 3983) and now considering 1916/5415 (removed 3499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1902 ms. Remains : 1932/5915 places, 1916/5415 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 61112 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61112 steps, saw 39436 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1916 rows 1932 cols
[2024-05-29 05:04:15] [INFO ] Computed 899 invariants in 6 ms
[2024-05-29 05:04:15] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 05:04:16] [INFO ] [Nat]Absence check using 899 positive place invariants in 236 ms returned sat
[2024-05-29 05:04:18] [INFO ] After 1474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 05:04:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-29 05:04:18] [INFO ] After 654ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 05:04:19] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2024-05-29 05:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-29 05:04:20] [INFO ] After 1914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 652 ms.
[2024-05-29 05:04:20] [INFO ] After 5085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 657 ms.
Support contains 22 out of 1932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1932/1932 places, 1916/1916 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 1932 transition count 1915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1931 transition count 1915
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1931 transition count 1914
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 4 place count 1930 transition count 1914
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1927 transition count 1911
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 1926 transition count 1910
Applied a total of 11 rules in 175 ms. Remains 1926 /1932 variables (removed 6) and now considering 1910/1916 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 1926/1932 places, 1910/1916 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 60558 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60558 steps, saw 38695 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1910 rows 1926 cols
[2024-05-29 05:04:26] [INFO ] Computed 899 invariants in 7 ms
[2024-05-29 05:04:26] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:04:27] [INFO ] [Nat]Absence check using 899 positive place invariants in 173 ms returned sat
[2024-05-29 05:04:29] [INFO ] After 1471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:04:29] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 05:04:29] [INFO ] After 550ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:04:30] [INFO ] After 1511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 578 ms.
[2024-05-29 05:04:31] [INFO ] After 4501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 981 ms.
Support contains 22 out of 1926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1926/1926 places, 1910/1910 transitions.
Applied a total of 0 rules in 57 ms. Remains 1926 /1926 variables (removed 0) and now considering 1910/1910 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1926/1926 places, 1910/1910 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1926/1926 places, 1910/1910 transitions.
Applied a total of 0 rules in 56 ms. Remains 1926 /1926 variables (removed 0) and now considering 1910/1910 (removed 0) transitions.
[2024-05-29 05:04:32] [INFO ] Invariant cache hit.
[2024-05-29 05:04:33] [INFO ] Implicit Places using invariants in 1392 ms returned [1915]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1399 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1925/1926 places, 1910/1910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1924 transition count 1909
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1924 transition count 1909
Applied a total of 2 rules in 90 ms. Remains 1924 /1925 variables (removed 1) and now considering 1909/1910 (removed 1) transitions.
// Phase 1: matrix 1909 rows 1924 cols
[2024-05-29 05:04:33] [INFO ] Computed 898 invariants in 11 ms
[2024-05-29 05:04:35] [INFO ] Implicit Places using invariants in 1483 ms returned []
[2024-05-29 05:04:35] [INFO ] Invariant cache hit.
[2024-05-29 05:04:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 05:04:38] [INFO ] Implicit Places using invariants and state equation in 3159 ms returned []
Implicit Place search using SMT with State Equation took 4645 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1924/1926 places, 1909/1910 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6191 ms. Remains : 1924/1926 places, 1909/1910 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 63001 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 63001 steps, saw 39962 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 05:04:42] [INFO ] Invariant cache hit.
[2024-05-29 05:04:43] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:04:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 175 ms returned sat
[2024-05-29 05:04:45] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:04:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 05:04:46] [INFO ] After 556ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:04:46] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2024-05-29 05:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-29 05:04:47] [INFO ] After 1658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 575 ms.
[2024-05-29 05:04:47] [INFO ] After 4536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 498 ms.
Support contains 22 out of 1924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1924/1924 places, 1909/1909 transitions.
Applied a total of 0 rules in 50 ms. Remains 1924 /1924 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1924/1924 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1924/1924 places, 1909/1909 transitions.
Applied a total of 0 rules in 49 ms. Remains 1924 /1924 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-05-29 05:04:48] [INFO ] Invariant cache hit.
[2024-05-29 05:04:49] [INFO ] Implicit Places using invariants in 1334 ms returned []
[2024-05-29 05:04:49] [INFO ] Invariant cache hit.
[2024-05-29 05:04:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 05:04:52] [INFO ] Implicit Places using invariants and state equation in 3037 ms returned []
Implicit Place search using SMT with State Equation took 4376 ms to find 0 implicit places.
[2024-05-29 05:04:53] [INFO ] Redundant transitions in 157 ms returned []
[2024-05-29 05:04:53] [INFO ] Invariant cache hit.
[2024-05-29 05:04:54] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5949 ms. Remains : 1924/1924 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 208 times.
Drop transitions removed 208 transitions
Iterating global reduction 0 with 208 rules applied. Total rules applied 208 place count 1924 transition count 1909
Applied a total of 208 rules in 96 ms. Remains 1924 /1924 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1909 rows 1924 cols
[2024-05-29 05:04:54] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:04:55] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 05:04:55] [INFO ] [Nat]Absence check using 898 positive place invariants in 167 ms returned sat
[2024-05-29 05:04:57] [INFO ] After 1434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 05:04:57] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-29 05:04:58] [INFO ] After 837ms SMT Verify possible using 202 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 05:04:58] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 05:04:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-05-29 05:04:59] [INFO ] After 2223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 728 ms.
[2024-05-29 05:05:00] [INFO ] After 5299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1600 stabilizing places and 1600 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(!p0) U (X(p1)||F(p2))) U p0))))'
Support contains 4 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5903 transition count 5403
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5903 transition count 5403
Applied a total of 24 rules in 1495 ms. Remains 5903 /5915 variables (removed 12) and now considering 5403/5415 (removed 12) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2024-05-29 05:05:02] [INFO ] Computed 901 invariants in 27 ms
[2024-05-29 05:05:04] [INFO ] Implicit Places using invariants in 2149 ms returned []
[2024-05-29 05:05:04] [INFO ] Invariant cache hit.
[2024-05-29 05:05:06] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 4340 ms to find 0 implicit places.
[2024-05-29 05:05:06] [INFO ] Invariant cache hit.
[2024-05-29 05:05:10] [INFO ] Dead Transitions using invariants and state equation in 4332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5915 places, 5403/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10170 ms. Remains : 5903/5915 places, 5403/5415 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 393 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s3436 0) (EQ s3579 1)), p2:(NEQ s5796 1), p1:(EQ s2550 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3136 ms.
Product exploration explored 100000 steps with 33333 reset in 2987 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5903 stabilizing places and 1598/5403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-00 finished in 16934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U G(p1))))'
Support contains 5 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5903 transition count 5403
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5903 transition count 5403
Applied a total of 24 rules in 1500 ms. Remains 5903 /5915 variables (removed 12) and now considering 5403/5415 (removed 12) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2024-05-29 05:05:19] [INFO ] Computed 901 invariants in 27 ms
[2024-05-29 05:05:21] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2024-05-29 05:05:21] [INFO ] Invariant cache hit.
[2024-05-29 05:05:23] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 4154 ms to find 0 implicit places.
[2024-05-29 05:05:23] [INFO ] Invariant cache hit.
[2024-05-29 05:05:27] [INFO ] Dead Transitions using invariants and state equation in 4094 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5915 places, 5403/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9779 ms. Remains : 5903/5915 places, 5403/5415 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s4612 1) (OR (EQ s108 0) (EQ s3649 1))), p0:(OR (EQ s2619 0) (EQ s1712 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24971 reset in 2326 ms.
Product exploration explored 100000 steps with 25080 reset in 2379 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 (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 05:05:33] [INFO ] Invariant cache hit.
[2024-05-29 05:05:34] [INFO ] [Real]Absence check using 901 positive place invariants in 557 ms returned sat
[2024-05-29 05:05:39] [INFO ] After 6261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:05:40] [INFO ] [Nat]Absence check using 901 positive place invariants in 550 ms returned sat
[2024-05-29 05:05:46] [INFO ] After 5083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:05:48] [INFO ] Deduced a trap composed of 27 places in 2308 ms of which 4 ms to minimize.
[2024-05-29 05:05:51] [INFO ] Deduced a trap composed of 18 places in 2285 ms of which 3 ms to minimize.
[2024-05-29 05:05:53] [INFO ] Deduced a trap composed of 23 places in 2296 ms of which 3 ms to minimize.
[2024-05-29 05:05:55] [INFO ] Deduced a trap composed of 23 places in 2276 ms of which 23 ms to minimize.
[2024-05-29 05:05:58] [INFO ] Deduced a trap composed of 18 places in 2268 ms of which 3 ms to minimize.
[2024-05-29 05:06:00] [INFO ] Deduced a trap composed of 21 places in 2269 ms of which 4 ms to minimize.
[2024-05-29 05:06:03] [INFO ] Deduced a trap composed of 17 places in 2233 ms of which 3 ms to minimize.
[2024-05-29 05:06:05] [INFO ] Deduced a trap composed of 26 places in 2202 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 05:06:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 05:06:05] [INFO ] After 26225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 463 ms.
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3405
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3905 transition count 3405
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7388 place count 2209 transition count 1709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7389 place count 2209 transition count 1708
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 7391 place count 2208 transition count 1707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 7593 place count 2107 transition count 1774
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7795 place count 2006 transition count 1840
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7987 place count 1910 transition count 1905
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7988 place count 1910 transition count 1904
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7989 place count 1910 transition count 1903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7990 place count 1909 transition count 1903
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8090 place count 1909 transition count 1903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8091 place count 1908 transition count 1902
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8093 place count 1906 transition count 1902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8093 place count 1906 transition count 1901
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8095 place count 1905 transition count 1901
Applied a total of 8095 rules in 1655 ms. Remains 1905 /5903 variables (removed 3998) and now considering 1901/5403 (removed 3502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1656 ms. Remains : 1905/5903 places, 1901/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 76160 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76160 steps, saw 48095 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1905 cols
[2024-05-29 05:06:11] [INFO ] Computed 899 invariants in 4 ms
[2024-05-29 05:06:11] [INFO ] [Real]Absence check using 899 positive place invariants in 144 ms returned sat
[2024-05-29 05:06:12] [INFO ] After 1522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:06:13] [INFO ] [Nat]Absence check using 899 positive place invariants in 152 ms returned sat
[2024-05-29 05:06:14] [INFO ] After 957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:06:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 05:06:14] [INFO ] After 190ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 05:06:14] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2024-05-29 05:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-29 05:06:15] [INFO ] After 659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-29 05:06:15] [INFO ] After 2384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 213 ms.
Support contains 5 out of 1905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1905/1905 places, 1901/1901 transitions.
Applied a total of 0 rules in 47 ms. Remains 1905 /1905 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1905/1905 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1905/1905 places, 1901/1901 transitions.
Applied a total of 0 rules in 59 ms. Remains 1905 /1905 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-05-29 05:06:15] [INFO ] Invariant cache hit.
[2024-05-29 05:06:17] [INFO ] Implicit Places using invariants in 1557 ms returned [1894]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1571 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1904/1905 places, 1901/1901 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1903 transition count 1900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1900
Applied a total of 2 rules in 84 ms. Remains 1903 /1904 variables (removed 1) and now considering 1900/1901 (removed 1) transitions.
// Phase 1: matrix 1900 rows 1903 cols
[2024-05-29 05:06:17] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:06:18] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2024-05-29 05:06:18] [INFO ] Invariant cache hit.
[2024-05-29 05:06:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:06:21] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 4157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1903/1905 places, 1900/1901 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5873 ms. Remains : 1903/1905 places, 1900/1901 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 83900 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83900 steps, saw 53331 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 05:06:25] [INFO ] Invariant cache hit.
[2024-05-29 05:06:25] [INFO ] [Real]Absence check using 898 positive place invariants in 154 ms returned sat
[2024-05-29 05:06:26] [INFO ] After 1357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:06:26] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2024-05-29 05:06:27] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:06:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:06:28] [INFO ] After 236ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 05:06:28] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2024-05-29 05:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2024-05-29 05:06:28] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2024-05-29 05:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-05-29 05:06:28] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-05-29 05:06:29] [INFO ] After 2619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 211 ms.
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1900/1900 transitions.
Applied a total of 0 rules in 47 ms. Remains 1903 /1903 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1903/1903 places, 1900/1900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1900/1900 transitions.
Applied a total of 0 rules in 47 ms. Remains 1903 /1903 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-05-29 05:06:29] [INFO ] Invariant cache hit.
[2024-05-29 05:06:30] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2024-05-29 05:06:30] [INFO ] Invariant cache hit.
[2024-05-29 05:06:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:06:33] [INFO ] Implicit Places using invariants and state equation in 2870 ms returned []
Implicit Place search using SMT with State Equation took 4495 ms to find 0 implicit places.
[2024-05-29 05:06:33] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-29 05:06:33] [INFO ] Invariant cache hit.
[2024-05-29 05:06:35] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5973 ms. Remains : 1903/1903 places, 1900/1900 transitions.
Partial Free-agglomeration rule applied 206 times.
Drop transitions removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 206 place count 1903 transition count 1900
Applied a total of 206 rules in 94 ms. Remains 1903 /1903 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1900 rows 1903 cols
[2024-05-29 05:06:35] [INFO ] Computed 898 invariants in 4 ms
[2024-05-29 05:06:35] [INFO ] [Real]Absence check using 898 positive place invariants in 150 ms returned sat
[2024-05-29 05:06:36] [INFO ] After 1390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:06:37] [INFO ] [Nat]Absence check using 898 positive place invariants in 154 ms returned sat
[2024-05-29 05:06:38] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:06:38] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-29 05:06:38] [INFO ] After 613ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 05:06:39] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2024-05-29 05:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2024-05-29 05:06:39] [INFO ] After 1358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 596 ms.
[2024-05-29 05:06:40] [INFO ] After 3512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
// Phase 1: matrix 5403 rows 5903 cols
[2024-05-29 05:06:40] [INFO ] Computed 901 invariants in 23 ms
[2024-05-29 05:06:50] [INFO ] [Real]Absence check using 901 positive place invariants in 4717 ms returned sat
[2024-05-29 05:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:06:56] [INFO ] [Real]Absence check using state equation in 5887 ms returned unknown
Could not prove EG (NOT p1)
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 727 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
[2024-05-29 05:06:56] [INFO ] Invariant cache hit.
[2024-05-29 05:06:58] [INFO ] Implicit Places using invariants in 2125 ms returned []
[2024-05-29 05:06:58] [INFO ] Invariant cache hit.
[2024-05-29 05:07:00] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 4098 ms to find 0 implicit places.
[2024-05-29 05:07:00] [INFO ] Invariant cache hit.
[2024-05-29 05:07:04] [INFO ] Dead Transitions using invariants and state equation in 4074 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8913 ms. Remains : 5903/5903 places, 5403/5403 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 (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 05:07:05] [INFO ] Invariant cache hit.
[2024-05-29 05:07:07] [INFO ] [Real]Absence check using 901 positive place invariants in 562 ms returned sat
[2024-05-29 05:07:12] [INFO ] After 6205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:07:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 548 ms returned sat
[2024-05-29 05:07:18] [INFO ] After 5091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:07:21] [INFO ] Deduced a trap composed of 27 places in 2311 ms of which 3 ms to minimize.
[2024-05-29 05:07:23] [INFO ] Deduced a trap composed of 18 places in 2310 ms of which 4 ms to minimize.
[2024-05-29 05:07:26] [INFO ] Deduced a trap composed of 23 places in 2307 ms of which 4 ms to minimize.
[2024-05-29 05:07:28] [INFO ] Deduced a trap composed of 23 places in 2250 ms of which 3 ms to minimize.
[2024-05-29 05:07:30] [INFO ] Deduced a trap composed of 18 places in 2280 ms of which 3 ms to minimize.
[2024-05-29 05:07:33] [INFO ] Deduced a trap composed of 21 places in 2413 ms of which 3 ms to minimize.
[2024-05-29 05:07:35] [INFO ] Deduced a trap composed of 17 places in 2148 ms of which 3 ms to minimize.
[2024-05-29 05:07:38] [INFO ] Deduced a trap composed of 26 places in 2204 ms of which 9 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 05:07:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 05:07:38] [INFO ] After 26279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 466 ms.
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3405
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3905 transition count 3405
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 3 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7388 place count 2209 transition count 1709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7389 place count 2209 transition count 1708
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 7391 place count 2208 transition count 1707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 7593 place count 2107 transition count 1774
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7795 place count 2006 transition count 1840
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7987 place count 1910 transition count 1905
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7988 place count 1910 transition count 1904
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7989 place count 1910 transition count 1903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7990 place count 1909 transition count 1903
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8090 place count 1909 transition count 1903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8091 place count 1908 transition count 1902
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8093 place count 1906 transition count 1902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8093 place count 1906 transition count 1901
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8095 place count 1905 transition count 1901
Applied a total of 8095 rules in 1207 ms. Remains 1905 /5903 variables (removed 3998) and now considering 1901/5403 (removed 3502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1208 ms. Remains : 1905/5903 places, 1901/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81379 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81379 steps, saw 51209 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1901 rows 1905 cols
[2024-05-29 05:07:43] [INFO ] Computed 899 invariants in 3 ms
[2024-05-29 05:07:44] [INFO ] [Real]Absence check using 899 positive place invariants in 167 ms returned sat
[2024-05-29 05:07:45] [INFO ] After 1444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:07:45] [INFO ] [Nat]Absence check using 899 positive place invariants in 166 ms returned sat
[2024-05-29 05:07:46] [INFO ] After 1010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:07:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 05:07:46] [INFO ] After 194ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 05:07:47] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:07:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-29 05:07:47] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 200 ms.
[2024-05-29 05:07:47] [INFO ] After 2420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 118 ms.
Support contains 5 out of 1905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1905/1905 places, 1901/1901 transitions.
Applied a total of 0 rules in 48 ms. Remains 1905 /1905 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1905/1905 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1905/1905 places, 1901/1901 transitions.
Applied a total of 0 rules in 47 ms. Remains 1905 /1905 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-05-29 05:07:47] [INFO ] Invariant cache hit.
[2024-05-29 05:07:49] [INFO ] Implicit Places using invariants in 1468 ms returned [1894]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1472 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1904/1905 places, 1901/1901 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1903 transition count 1900
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1900
Applied a total of 2 rules in 88 ms. Remains 1903 /1904 variables (removed 1) and now considering 1900/1901 (removed 1) transitions.
// Phase 1: matrix 1900 rows 1903 cols
[2024-05-29 05:07:49] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 05:07:50] [INFO ] Implicit Places using invariants in 1447 ms returned []
[2024-05-29 05:07:50] [INFO ] Invariant cache hit.
[2024-05-29 05:07:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:07:53] [INFO ] Implicit Places using invariants and state equation in 2787 ms returned []
Implicit Place search using SMT with State Equation took 4235 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1903/1905 places, 1900/1901 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5842 ms. Remains : 1903/1905 places, 1900/1901 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 74207 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74207 steps, saw 47039 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 05:07:57] [INFO ] Invariant cache hit.
[2024-05-29 05:07:57] [INFO ] [Real]Absence check using 898 positive place invariants in 166 ms returned sat
[2024-05-29 05:07:58] [INFO ] After 1454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:07:59] [INFO ] [Nat]Absence check using 898 positive place invariants in 175 ms returned sat
[2024-05-29 05:08:00] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:08:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:08:00] [INFO ] After 190ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 05:08:00] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-29 05:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-05-29 05:08:00] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-29 05:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-29 05:08:01] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 213 ms.
[2024-05-29 05:08:01] [INFO ] After 2652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 386 ms.
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1900/1900 transitions.
Applied a total of 0 rules in 52 ms. Remains 1903 /1903 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1903/1903 places, 1900/1900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1900/1900 transitions.
Applied a total of 0 rules in 52 ms. Remains 1903 /1903 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2024-05-29 05:08:01] [INFO ] Invariant cache hit.
[2024-05-29 05:08:03] [INFO ] Implicit Places using invariants in 1460 ms returned []
[2024-05-29 05:08:03] [INFO ] Invariant cache hit.
[2024-05-29 05:08:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:08:06] [INFO ] Implicit Places using invariants and state equation in 2937 ms returned []
Implicit Place search using SMT with State Equation took 4399 ms to find 0 implicit places.
[2024-05-29 05:08:06] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-29 05:08:06] [INFO ] Invariant cache hit.
[2024-05-29 05:08:07] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5780 ms. Remains : 1903/1903 places, 1900/1900 transitions.
Partial Free-agglomeration rule applied 206 times.
Drop transitions removed 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 206 place count 1903 transition count 1900
Applied a total of 206 rules in 92 ms. Remains 1903 /1903 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1900 rows 1903 cols
[2024-05-29 05:08:07] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:08:08] [INFO ] [Real]Absence check using 898 positive place invariants in 170 ms returned sat
[2024-05-29 05:08:09] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 05:08:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 170 ms returned sat
[2024-05-29 05:08:10] [INFO ] After 950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 05:08:10] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-29 05:08:11] [INFO ] After 642ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 05:08:11] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2024-05-29 05:08:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2024-05-29 05:08:12] [INFO ] After 1353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 620 ms.
[2024-05-29 05:08:12] [INFO ] After 3485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
// Phase 1: matrix 5403 rows 5903 cols
[2024-05-29 05:08:13] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 05:08:22] [INFO ] [Real]Absence check using 901 positive place invariants in 4641 ms returned sat
[2024-05-29 05:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:08:28] [INFO ] [Real]Absence check using state equation in 5651 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 24947 reset in 2338 ms.
Product exploration explored 100000 steps with 25002 reset in 2350 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 5403
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 1198 place count 5903 transition count 5706
Deduced a syphon composed of 1600 places in 17 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 1600 place count 5903 transition count 5706
Performed 1994 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3594 places in 10 ms
Iterating global reduction 1 with 1994 rules applied. Total rules applied 3594 place count 5903 transition count 5706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3595 place count 5903 transition count 5705
Renaming transitions due to excessive name length > 1024 char.
Discarding 799 places :
Symmetric choice reduction at 2 with 799 rule applications. Total rules 4394 place count 5104 transition count 4906
Deduced a syphon composed of 2795 places in 9 ms
Iterating global reduction 2 with 799 rules applied. Total rules applied 5193 place count 5104 transition count 4906
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2796 places in 9 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5194 place count 5104 transition count 4906
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5196 place count 5102 transition count 4904
Deduced a syphon composed of 2794 places in 8 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5198 place count 5102 transition count 4904
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2895 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5299 place count 5102 transition count 5434
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5400 place count 5001 transition count 5232
Deduced a syphon composed of 2794 places in 9 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5501 place count 5001 transition count 5232
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -531
Deduced a syphon composed of 2895 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5602 place count 5001 transition count 5763
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5703 place count 4900 transition count 5561
Deduced a syphon composed of 2794 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5804 place count 4900 transition count 5561
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -534
Deduced a syphon composed of 2895 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5905 place count 4900 transition count 6095
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6006 place count 4799 transition count 5893
Deduced a syphon composed of 2794 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6107 place count 4799 transition count 5893
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -502
Deduced a syphon composed of 2889 places in 13 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6202 place count 4799 transition count 6395
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6298 place count 4703 transition count 6203
Deduced a syphon composed of 2793 places in 12 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6394 place count 4703 transition count 6203
Deduced a syphon composed of 2793 places in 12 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6403 place count 4703 transition count 6194
Deduced a syphon composed of 2793 places in 12 ms
Applied a total of 6403 rules in 7629 ms. Remains 4703 /5903 variables (removed 1200) and now considering 6194/5403 (removed -791) transitions.
[2024-05-29 05:08:41] [INFO ] Redundant transitions in 286 ms returned []
// Phase 1: matrix 6194 rows 4703 cols
[2024-05-29 05:08:41] [INFO ] Computed 901 invariants in 110 ms
[2024-05-29 05:08:45] [INFO ] Dead Transitions using invariants and state equation in 4121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4703/5903 places, 6194/5403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12083 ms. Remains : 4703/5903 places, 6194/5403 transitions.
Built C files in :
/tmp/ltsmin4064088506936745794
[2024-05-29 05:08:45] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4064088506936745794
Running compilation step : cd /tmp/ltsmin4064088506936745794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4064088506936745794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4064088506936745794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 5 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 771 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2024-05-29 05:08:49] [INFO ] Computed 901 invariants in 16 ms
[2024-05-29 05:08:51] [INFO ] Implicit Places using invariants in 2082 ms returned []
[2024-05-29 05:08:51] [INFO ] Invariant cache hit.
[2024-05-29 05:08:53] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 4062 ms to find 0 implicit places.
[2024-05-29 05:08:53] [INFO ] Invariant cache hit.
[2024-05-29 05:08:58] [INFO ] Dead Transitions using invariants and state equation in 4347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9181 ms. Remains : 5903/5903 places, 5403/5403 transitions.
Built C files in :
/tmp/ltsmin16493935330471437440
[2024-05-29 05:08:58] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16493935330471437440
Running compilation step : cd /tmp/ltsmin16493935330471437440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16493935330471437440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16493935330471437440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 05:09:01] [INFO ] Flatten gal took : 156 ms
[2024-05-29 05:09:01] [INFO ] Flatten gal took : 142 ms
[2024-05-29 05:09:01] [INFO ] Time to serialize gal into /tmp/LTL16534591504861375029.gal : 54 ms
[2024-05-29 05:09:01] [INFO ] Time to serialize properties into /tmp/LTL653722203980873024.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16534591504861375029.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18323525611352021469.hoa' '-atoms' '/tmp/LTL653722203980873024.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL653722203980873024.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18323525611352021469.hoa
Detected timeout of ITS tools.
[2024-05-29 05:09:17] [INFO ] Flatten gal took : 148 ms
[2024-05-29 05:09:17] [INFO ] Flatten gal took : 138 ms
[2024-05-29 05:09:17] [INFO ] Time to serialize gal into /tmp/LTL15828440720636656680.gal : 29 ms
[2024-05-29 05:09:17] [INFO ] Time to serialize properties into /tmp/LTL15636724185441461298.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15828440720636656680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15636724185441461298.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((p3091==0)||(p2014==1))")))U(G("((p5463==1)&&((p108==0)||(p4319==1)))")))))
Formula 0 simplified : X(XF!"((p3091==0)||(p2014==1))" R F!"((p5463==1)&&((p108==0)||(p4319==1)))")
Detected timeout of ITS tools.
[2024-05-29 05:09:32] [INFO ] Flatten gal took : 120 ms
[2024-05-29 05:09:32] [INFO ] Applying decomposition
[2024-05-29 05:09:32] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph8638383412635557015.txt' '-o' '/tmp/graph8638383412635557015.bin' '-w' '/tmp/graph8638383412635557015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8638383412635557015.bin' '-l' '-1' '-v' '-w' '/tmp/graph8638383412635557015.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:09:33] [INFO ] Decomposing Gal with order
[2024-05-29 05:09:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:09:35] [INFO ] Removed a total of 992 redundant transitions.
[2024-05-29 05:09:35] [INFO ] Flatten gal took : 340 ms
[2024-05-29 05:09:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2024-05-29 05:09:35] [INFO ] Time to serialize gal into /tmp/LTL8678765446028854692.gal : 133 ms
[2024-05-29 05:09:35] [INFO ] Time to serialize properties into /tmp/LTL13047541658877268182.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8678765446028854692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13047541658877268182.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(G("((i27.i1.i2.u976.p3091==0)||(i17.i1.i6.u641.p2014==1))")))U(G("((i48.u1714.p5463==1)&&((i2.i0.i0.u47.p108==0)||(i39.i0.i2.u...177
Formula 0 simplified : X(XF!"((i27.i1.i2.u976.p3091==0)||(i17.i1.i6.u641.p2014==1))" R F!"((i48.u1714.p5463==1)&&((i2.i0.i0.u47.p108==0)||(i39.i0.i2.u1357....168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2027747417012717180
[2024-05-29 05:09:50] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2027747417012717180
Running compilation step : cd /tmp/ltsmin2027747417012717180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2027747417012717180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2027747417012717180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-02 finished in 275964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5902 transition count 5402
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5902 transition count 5402
Applied a total of 26 rules in 1892 ms. Remains 5902 /5915 variables (removed 13) and now considering 5402/5415 (removed 13) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2024-05-29 05:09:55] [INFO ] Computed 901 invariants in 30 ms
[2024-05-29 05:09:57] [INFO ] Implicit Places using invariants in 2256 ms returned []
[2024-05-29 05:09:57] [INFO ] Invariant cache hit.
[2024-05-29 05:09:59] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 4244 ms to find 0 implicit places.
[2024-05-29 05:09:59] [INFO ] Invariant cache hit.
[2024-05-29 05:10:03] [INFO ] Dead Transitions using invariants and state equation in 4275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5915 places, 5402/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10417 ms. Remains : 5902/5915 places, 5402/5415 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s2535 0) (EQ s4430 1)), p0:(OR (EQ s4865 0) (EQ s4703 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1474 ms.
Product exploration explored 100000 steps with 0 reset in 1994 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 p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:10:08] [INFO ] Invariant cache hit.
[2024-05-29 05:10:08] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:10:10] [INFO ] [Nat]Absence check using 901 positive place invariants in 583 ms returned sat
[2024-05-29 05:10:15] [INFO ] After 5300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:10:17] [INFO ] Deduced a trap composed of 31 places in 2236 ms of which 3 ms to minimize.
[2024-05-29 05:10:20] [INFO ] Deduced a trap composed of 21 places in 2388 ms of which 4 ms to minimize.
[2024-05-29 05:10:22] [INFO ] Deduced a trap composed of 25 places in 2299 ms of which 4 ms to minimize.
[2024-05-29 05:10:25] [INFO ] Deduced a trap composed of 12 places in 2229 ms of which 4 ms to minimize.
[2024-05-29 05:10:27] [INFO ] Deduced a trap composed of 27 places in 2299 ms of which 3 ms to minimize.
[2024-05-29 05:10:30] [INFO ] Deduced a trap composed of 36 places in 2192 ms of which 3 ms to minimize.
[2024-05-29 05:10:32] [INFO ] Deduced a trap composed of 20 places in 2290 ms of which 3 ms to minimize.
[2024-05-29 05:10:35] [INFO ] Deduced a trap composed of 17 places in 2115 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 05:10:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 05:10:35] [INFO ] After 26203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 139 ms.
Support contains 2 out of 5902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3404
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 3996 place count 3904 transition count 3404
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7398 place count 2203 transition count 1703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2203 transition count 1702
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 7401 place count 2202 transition count 1701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7603 place count 2101 transition count 1767
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7805 place count 2000 transition count 1833
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7997 place count 1904 transition count 1898
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7998 place count 1904 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8098 place count 1904 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8099 place count 1903 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8101 place count 1901 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8101 place count 1901 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8103 place count 1900 transition count 1895
Applied a total of 8103 rules in 1255 ms. Remains 1900 /5902 variables (removed 4002) and now considering 1895/5402 (removed 3507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1259 ms. Remains : 1900/5902 places, 1895/5402 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 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 93139 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93139 steps, saw 59253 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1900 cols
[2024-05-29 05:10:39] [INFO ] Computed 899 invariants in 8 ms
[2024-05-29 05:10:39] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:10:40] [INFO ] [Nat]Absence check using 899 positive place invariants in 157 ms returned sat
[2024-05-29 05:10:41] [INFO ] After 848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:10:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 05:10:41] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:10:41] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-29 05:10:41] [INFO ] After 1476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 49 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1900/1900 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1895/1895 transitions.
Applied a total of 0 rules in 48 ms. Remains 1900 /1900 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2024-05-29 05:10:41] [INFO ] Invariant cache hit.
[2024-05-29 05:10:42] [INFO ] Implicit Places using invariants in 1334 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1337 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1900 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1894
Applied a total of 2 rules in 91 ms. Remains 1898 /1899 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:10:42] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:10:44] [INFO ] Implicit Places using invariants in 1356 ms returned []
[2024-05-29 05:10:44] [INFO ] Invariant cache hit.
[2024-05-29 05:10:47] [INFO ] Implicit Places using invariants and state equation in 2868 ms returned []
Implicit Place search using SMT with State Equation took 4225 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1898/1900 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5702 ms. Remains : 1898/1900 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) 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 94431 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94431 steps, saw 59592 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:10:50] [INFO ] Invariant cache hit.
[2024-05-29 05:10:50] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:10:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 163 ms returned sat
[2024-05-29 05:10:52] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:10:52] [INFO ] After 975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 05:10:52] [INFO ] After 1472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:10:52] [INFO ] Invariant cache hit.
[2024-05-29 05:10:53] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2024-05-29 05:10:53] [INFO ] Invariant cache hit.
[2024-05-29 05:10:56] [INFO ] Implicit Places using invariants and state equation in 2598 ms returned []
Implicit Place search using SMT with State Equation took 3991 ms to find 0 implicit places.
[2024-05-29 05:10:56] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-29 05:10:56] [INFO ] Invariant cache hit.
[2024-05-29 05:10:57] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5412 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 95 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:10:57] [INFO ] Computed 898 invariants in 9 ms
[2024-05-29 05:10:58] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:10:58] [INFO ] [Nat]Absence check using 898 positive place invariants in 164 ms returned sat
[2024-05-29 05:10:59] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:10:59] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-29 05:10:59] [INFO ] After 338ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:10:59] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 05:10:59] [INFO ] After 1867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 90 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 79 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 5902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5902/5902 places, 5402/5402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1197 transitions
Trivial Post-agglo rules discarded 1197 transitions
Performed 1197 trivial Post agglomeration. Transition count delta: 1197
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5901 transition count 4204
Reduce places removed 1197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2395 place count 4704 transition count 4203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3403
Deduced a syphon composed of 800 places in 10 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 3996 place count 3903 transition count 3403
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7390 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7391 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7393 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7595 place count 2104 transition count 1770
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7797 place count 2003 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 7989 place count 1907 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7991 place count 1905 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 7993 place count 1903 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 7993 place count 1903 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7995 place count 1902 transition count 1898
Applied a total of 7995 rules in 1254 ms. Remains 1902 /5902 variables (removed 4000) and now considering 1898/5402 (removed 3504) transitions.
// Phase 1: matrix 1898 rows 1902 cols
[2024-05-29 05:11:01] [INFO ] Computed 899 invariants in 7 ms
[2024-05-29 05:11:02] [INFO ] Implicit Places using invariants in 1309 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1314 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5902 places, 1898/5402 transitions.
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 2 place count 1900 transition count 1897
Applied a total of 2 rules in 103 ms. Remains 1900 /1901 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2024-05-29 05:11:02] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 05:11:04] [INFO ] Implicit Places using invariants in 1330 ms returned []
[2024-05-29 05:11:04] [INFO ] Invariant cache hit.
[2024-05-29 05:11:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:11:07] [INFO ] Implicit Places using invariants and state equation in 3048 ms returned []
Implicit Place search using SMT with State Equation took 4383 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5902 places, 1897/5402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7056 ms. Remains : 1900/5902 places, 1897/5402 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 p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 235 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 75 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:11:07] [INFO ] Invariant cache hit.
[2024-05-29 05:11:08] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:11:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 153 ms returned sat
[2024-05-29 05:11:09] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:11:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:11:09] [INFO ] After 65ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:11:09] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:11:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-05-29 05:11:09] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 05:11:09] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1896
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 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 193 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 1898/1900 places, 1894/1897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101160 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101160 steps, saw 62657 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:11:13] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 05:11:13] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:11:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2024-05-29 05:11:14] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:11:14] [INFO ] After 962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-29 05:11:14] [INFO ] After 1441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 47 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:11:15] [INFO ] Invariant cache hit.
[2024-05-29 05:11:16] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2024-05-29 05:11:16] [INFO ] Invariant cache hit.
[2024-05-29 05:11:19] [INFO ] Implicit Places using invariants and state equation in 2689 ms returned []
Implicit Place search using SMT with State Equation took 4123 ms to find 0 implicit places.
[2024-05-29 05:11:19] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-29 05:11:19] [INFO ] Invariant cache hit.
[2024-05-29 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5474 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 117 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:11:20] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:11:20] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:11:21] [INFO ] [Nat]Absence check using 898 positive place invariants in 146 ms returned sat
[2024-05-29 05:11:22] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:11:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 05:11:22] [INFO ] After 60ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:11:22] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-29 05:11:22] [INFO ] After 1483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 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 56 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1433 ms.
Product exploration explored 100000 steps with 0 reset in 1854 ms.
Built C files in :
/tmp/ltsmin10177782998658157966
[2024-05-29 05:11:26] [INFO ] Too many transitions (1897) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:11:26] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10177782998658157966
Running compilation step : cd /tmp/ltsmin10177782998658157966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10177782998658157966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10177782998658157966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 55 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2024-05-29 05:11:29] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:11:30] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2024-05-29 05:11:30] [INFO ] Invariant cache hit.
[2024-05-29 05:11:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:11:33] [INFO ] Implicit Places using invariants and state equation in 2667 ms returned []
Implicit Place search using SMT with State Equation took 4104 ms to find 0 implicit places.
[2024-05-29 05:11:33] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-29 05:11:33] [INFO ] Invariant cache hit.
[2024-05-29 05:11:34] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5536 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Built C files in :
/tmp/ltsmin5180148603701751541
[2024-05-29 05:11:34] [INFO ] Too many transitions (1897) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:11:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5180148603701751541
Running compilation step : cd /tmp/ltsmin5180148603701751541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5180148603701751541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5180148603701751541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 05:11:37] [INFO ] Flatten gal took : 76 ms
[2024-05-29 05:11:37] [INFO ] Flatten gal took : 105 ms
[2024-05-29 05:11:38] [INFO ] Time to serialize gal into /tmp/LTL18124141688846166721.gal : 44 ms
[2024-05-29 05:11:38] [INFO ] Time to serialize properties into /tmp/LTL17709456643673109823.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18124141688846166721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut377638615479618516.hoa' '-atoms' '/tmp/LTL17709456643673109823.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17709456643673109823.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut377638615479618516.hoa
Detected timeout of ITS tools.
[2024-05-29 05:11:53] [INFO ] Flatten gal took : 54 ms
[2024-05-29 05:11:53] [INFO ] Flatten gal took : 64 ms
[2024-05-29 05:11:53] [INFO ] Time to serialize gal into /tmp/LTL5872638826791232778.gal : 9 ms
[2024-05-29 05:11:53] [INFO ] Time to serialize properties into /tmp/LTL12798409662239211045.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5872638826791232778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12798409662239211045.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p5766==0)||(p5571==1))")))||(G("((p2995==0)||(p5247==1))")))))
Formula 0 simplified : X(GF!"((p5766==0)||(p5571==1))" & F!"((p2995==0)||(p5247==1))")
Detected timeout of ITS tools.
[2024-05-29 05:12:08] [INFO ] Flatten gal took : 47 ms
[2024-05-29 05:12:08] [INFO ] Applying decomposition
[2024-05-29 05:12:08] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14800263368918146578.txt' '-o' '/tmp/graph14800263368918146578.bin' '-w' '/tmp/graph14800263368918146578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14800263368918146578.bin' '-l' '-1' '-v' '-w' '/tmp/graph14800263368918146578.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:12:08] [INFO ] Decomposing Gal with order
[2024-05-29 05:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:12:09] [INFO ] Removed a total of 2172 redundant transitions.
[2024-05-29 05:12:09] [INFO ] Flatten gal took : 153 ms
[2024-05-29 05:12:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 978 labels/synchronizations in 44 ms.
[2024-05-29 05:12:09] [INFO ] Time to serialize gal into /tmp/LTL12647589589536574496.gal : 18 ms
[2024-05-29 05:12:09] [INFO ] Time to serialize properties into /tmp/LTL5379924092403662071.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12647589589536574496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5379924092403662071.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i36.u657.p5766==0)||(i35.i0.i1.u635.p5571==1))")))||(G("((i17.u335.p2995==0)||(i33.i0.i1.u598.p5247==1))")))))
Formula 0 simplified : X(GF!"((i36.u657.p5766==0)||(i35.i0.i1.u635.p5571==1))" & F!"((i17.u335.p2995==0)||(i33.i0.i1.u598.p5247==1))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1201_t401_t408, i0.i0.i0.t1202_t405_t408, i0.i0.i0.u1.t1204, i0.i1.t1, i0.i1...7011
Computing Next relation with stutter on 5.48772e+124 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5884648197239711050
[2024-05-29 05:12:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5884648197239711050
Running compilation step : cd /tmp/ltsmin5884648197239711050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5884648197239711050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5884648197239711050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-03 finished in 153858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 5915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5914 transition count 4218
Reduce places removed 1196 places and 0 transitions.
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2392 place count 4718 transition count 4218
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2392 place count 4718 transition count 3424
Deduced a syphon composed of 794 places in 12 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 3980 place count 3924 transition count 3424
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 3992 place count 3912 transition count 3412
Iterating global reduction 2 with 12 rules applied. Total rules applied 4004 place count 3912 transition count 3412
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 4004 place count 3912 transition count 3401
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 4026 place count 3901 transition count 3401
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 3 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7416 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7417 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7419 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7621 place count 2104 transition count 1770
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7823 place count 2003 transition count 1838
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
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 8017 place count 1906 transition count 1903
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8019 place count 1904 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8021 place count 1902 transition count 1901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8021 place count 1902 transition count 1900
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 8023 place count 1901 transition count 1900
Applied a total of 8023 rules in 1631 ms. Remains 1901 /5915 variables (removed 4014) and now considering 1900/5415 (removed 3515) transitions.
// Phase 1: matrix 1900 rows 1901 cols
[2024-05-29 05:12:29] [INFO ] Computed 899 invariants in 2 ms
[2024-05-29 05:12:30] [INFO ] Implicit Places using invariants in 1435 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1437 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1900/5915 places, 1900/5415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1899 transition count 1899
Applied a total of 2 rules in 105 ms. Remains 1899 /1900 variables (removed 1) and now considering 1899/1900 (removed 1) transitions.
// Phase 1: matrix 1899 rows 1899 cols
[2024-05-29 05:12:30] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 05:12:32] [INFO ] Implicit Places using invariants in 1501 ms returned []
[2024-05-29 05:12:32] [INFO ] Invariant cache hit.
[2024-05-29 05:12:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 05:12:34] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 4238 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1899/5915 places, 1899/5415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7413 ms. Remains : 1899/5915 places, 1899/5415 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s455 0) (EQ s1095 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 1201 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-04 finished in 8671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5903 transition count 5403
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5903 transition count 5403
Applied a total of 24 rules in 1593 ms. Remains 5903 /5915 variables (removed 12) and now considering 5403/5415 (removed 12) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2024-05-29 05:12:37] [INFO ] Computed 901 invariants in 19 ms
[2024-05-29 05:12:39] [INFO ] Implicit Places using invariants in 2022 ms returned []
[2024-05-29 05:12:39] [INFO ] Invariant cache hit.
[2024-05-29 05:12:41] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 4000 ms to find 0 implicit places.
[2024-05-29 05:12:41] [INFO ] Invariant cache hit.
[2024-05-29 05:12:45] [INFO ] Dead Transitions using invariants and state equation in 4134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5915 places, 5403/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9737 ms. Remains : 5903/5915 places, 5403/5415 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s1742 0) (EQ s4434 1)) (OR (EQ s1024 0) (EQ s4854 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1240 ms.
Product exploration explored 100000 steps with 0 reset in 1778 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222482 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222482 steps, saw 211711 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:12:52] [INFO ] Invariant cache hit.
[2024-05-29 05:12:53] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:12:54] [INFO ] [Nat]Absence check using 901 positive place invariants in 552 ms returned sat
[2024-05-29 05:12:59] [INFO ] After 4772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:01] [INFO ] Deduced a trap composed of 22 places in 2302 ms of which 3 ms to minimize.
[2024-05-29 05:13:04] [INFO ] Deduced a trap composed of 19 places in 2221 ms of which 3 ms to minimize.
[2024-05-29 05:13:06] [INFO ] Deduced a trap composed of 15 places in 2249 ms of which 3 ms to minimize.
[2024-05-29 05:13:08] [INFO ] Deduced a trap composed of 17 places in 2255 ms of which 3 ms to minimize.
[2024-05-29 05:13:11] [INFO ] Deduced a trap composed of 17 places in 2254 ms of which 3 ms to minimize.
[2024-05-29 05:13:13] [INFO ] Deduced a trap composed of 21 places in 2236 ms of which 4 ms to minimize.
[2024-05-29 05:13:16] [INFO ] Deduced a trap composed of 28 places in 2223 ms of which 3 ms to minimize.
[2024-05-29 05:13:18] [INFO ] Deduced a trap composed of 21 places in 2247 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 05:13:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 05:13:18] [INFO ] After 25497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 105 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 10 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 3 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 2 with 3402 rules applied. Total rules applied 7396 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7397 place count 2205 transition count 1704
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7399 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7601 place count 2103 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7803 place count 2002 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7995 place count 1906 transition count 1899
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7996 place count 1906 transition count 1898
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7997 place count 1906 transition count 1897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7998 place count 1905 transition count 1897
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8098 place count 1905 transition count 1897
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8099 place count 1904 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8101 place count 1902 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8101 place count 1902 transition count 1895
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1895
Applied a total of 8103 rules in 1264 ms. Remains 1901 /5903 variables (removed 4002) and now considering 1895/5403 (removed 3508) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1264 ms. Remains : 1901/5903 places, 1895/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 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 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97993 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97993 steps, saw 62341 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1895 rows 1901 cols
[2024-05-29 05:13:23] [INFO ] Computed 899 invariants in 6 ms
[2024-05-29 05:13:23] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:13:23] [INFO ] [Nat]Absence check using 899 positive place invariants in 163 ms returned sat
[2024-05-29 05:13:24] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 05:13:24] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:24] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-29 05:13:24] [INFO ] After 1558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 49 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1901/1901 places, 1895/1895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1895/1895 transitions.
Applied a total of 0 rules in 49 ms. Remains 1901 /1901 variables (removed 0) and now considering 1895/1895 (removed 0) transitions.
[2024-05-29 05:13:25] [INFO ] Invariant cache hit.
[2024-05-29 05:13:26] [INFO ] Implicit Places using invariants in 1453 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1454 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1900/1901 places, 1895/1895 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1899 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1899 transition count 1894
Applied a total of 2 rules in 120 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:13:26] [INFO ] Computed 898 invariants in 10 ms
[2024-05-29 05:13:28] [INFO ] Implicit Places using invariants in 1468 ms returned []
[2024-05-29 05:13:28] [INFO ] Invariant cache hit.
[2024-05-29 05:13:31] [INFO ] Implicit Places using invariants and state equation in 3036 ms returned []
Implicit Place search using SMT with State Equation took 4504 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1899/1901 places, 1894/1895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6127 ms. Remains : 1899/1901 places, 1894/1895 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99498 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99498 steps, saw 63029 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:13:34] [INFO ] Invariant cache hit.
[2024-05-29 05:13:34] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:13:35] [INFO ] [Nat]Absence check using 898 positive place invariants in 146 ms returned sat
[2024-05-29 05:13:35] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:36] [INFO ] After 925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-29 05:13:36] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 46 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:13:36] [INFO ] Invariant cache hit.
[2024-05-29 05:13:37] [INFO ] Implicit Places using invariants in 1472 ms returned []
[2024-05-29 05:13:37] [INFO ] Invariant cache hit.
[2024-05-29 05:13:40] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 4163 ms to find 0 implicit places.
[2024-05-29 05:13:40] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-29 05:13:40] [INFO ] Invariant cache hit.
[2024-05-29 05:13:41] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5524 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 95 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:13:41] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:13:42] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:13:42] [INFO ] [Nat]Absence check using 898 positive place invariants in 171 ms returned sat
[2024-05-29 05:13:43] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:43] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-29 05:13:43] [INFO ] After 265ms SMT Verify possible using 196 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:43] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 05:13:43] [INFO ] After 1844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5902 transition count 4204
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4704 transition count 4204
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4704 transition count 3405
Deduced a syphon composed of 799 places in 10 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3905 transition count 3405
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 7392 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7393 place count 2206 transition count 1705
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 7395 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7597 place count 2104 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7799 place count 2003 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 7991 place count 1907 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7993 place count 1905 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7995 place count 1903 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 7995 place count 1903 transition count 1897
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 7997 place count 1902 transition count 1897
Applied a total of 7997 rules in 1187 ms. Remains 1902 /5903 variables (removed 4001) and now considering 1897/5403 (removed 3506) transitions.
// Phase 1: matrix 1897 rows 1902 cols
[2024-05-29 05:13:45] [INFO ] Computed 899 invariants in 6 ms
[2024-05-29 05:13:46] [INFO ] Implicit Places using invariants in 1450 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1452 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5903 places, 1897/5403 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1896
Applied a total of 2 rules in 93 ms. Remains 1900 /1901 variables (removed 1) and now considering 1896/1897 (removed 1) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2024-05-29 05:13:46] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:13:48] [INFO ] Implicit Places using invariants in 1439 ms returned []
[2024-05-29 05:13:48] [INFO ] Invariant cache hit.
[2024-05-29 05:13:51] [INFO ] Implicit Places using invariants and state equation in 2769 ms returned []
Implicit Place search using SMT with State Equation took 4210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5903 places, 1896/5403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6944 ms. Remains : 1900/5903 places, 1896/5403 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 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 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112370 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112370 steps, saw 67387 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:13:54] [INFO ] Invariant cache hit.
[2024-05-29 05:13:54] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:13:55] [INFO ] [Nat]Absence check using 898 positive place invariants in 156 ms returned sat
[2024-05-29 05:13:55] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:13:56] [INFO ] After 964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-29 05:13:56] [INFO ] After 1432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1899 transition count 1894
Applied a total of 3 rules in 98 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1899/1900 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107648 steps, run timeout after 3013 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107648 steps, saw 66841 distinct states, run finished after 3013 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:13:59] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:13:59] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:14:00] [INFO ] [Nat]Absence check using 898 positive place invariants in 171 ms returned sat
[2024-05-29 05:14:01] [INFO ] After 926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:14:01] [INFO ] After 1033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 05:14:01] [INFO ] After 1552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 58 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 56 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:14:01] [INFO ] Invariant cache hit.
[2024-05-29 05:14:02] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2024-05-29 05:14:02] [INFO ] Invariant cache hit.
[2024-05-29 05:14:05] [INFO ] Implicit Places using invariants and state equation in 2956 ms returned []
Implicit Place search using SMT with State Equation took 4386 ms to find 0 implicit places.
[2024-05-29 05:14:05] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-29 05:14:05] [INFO ] Invariant cache hit.
[2024-05-29 05:14:07] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5802 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 98 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:14:07] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:14:07] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:14:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 169 ms returned sat
[2024-05-29 05:14:08] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:14:09] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-29 05:14:09] [INFO ] After 1503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1307 ms.
Product exploration explored 100000 steps with 0 reset in 1781 ms.
Built C files in :
/tmp/ltsmin14406506678460886397
[2024-05-29 05:14:12] [INFO ] Too many transitions (1896) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:14:12] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14406506678460886397
Running compilation step : cd /tmp/ltsmin14406506678460886397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14406506678460886397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14406506678460886397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 60 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2024-05-29 05:14:15] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 05:14:17] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2024-05-29 05:14:17] [INFO ] Invariant cache hit.
[2024-05-29 05:14:19] [INFO ] Implicit Places using invariants and state equation in 2738 ms returned []
Implicit Place search using SMT with State Equation took 4206 ms to find 0 implicit places.
[2024-05-29 05:14:19] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 05:14:19] [INFO ] Invariant cache hit.
[2024-05-29 05:14:21] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5557 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Built C files in :
/tmp/ltsmin386571440606849321
[2024-05-29 05:14:21] [INFO ] Too many transitions (1896) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:14:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin386571440606849321
Running compilation step : cd /tmp/ltsmin386571440606849321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin386571440606849321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin386571440606849321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 05:14:24] [INFO ] Flatten gal took : 44 ms
[2024-05-29 05:14:24] [INFO ] Flatten gal took : 45 ms
[2024-05-29 05:14:24] [INFO ] Time to serialize gal into /tmp/LTL12110129327898642917.gal : 12 ms
[2024-05-29 05:14:24] [INFO ] Time to serialize properties into /tmp/LTL2403487726752391942.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12110129327898642917.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6611464910641505238.hoa' '-atoms' '/tmp/LTL2403487726752391942.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2403487726752391942.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6611464910641505238.hoa
Detected timeout of ITS tools.
[2024-05-29 05:14:39] [INFO ] Flatten gal took : 45 ms
[2024-05-29 05:14:39] [INFO ] Flatten gal took : 44 ms
[2024-05-29 05:14:39] [INFO ] Time to serialize gal into /tmp/LTL2880071504512855147.gal : 8 ms
[2024-05-29 05:14:39] [INFO ] Time to serialize properties into /tmp/LTL2684530698993379074.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2880071504512855147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2684530698993379074.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p2049==0)||(p5251==1))&&((p1197==0)||(p5752==1)))"))))
Formula 0 simplified : XF!"(((p2049==0)||(p5251==1))&&((p1197==0)||(p5752==1)))"
Detected timeout of ITS tools.
[2024-05-29 05:14:54] [INFO ] Flatten gal took : 47 ms
[2024-05-29 05:14:54] [INFO ] Applying decomposition
[2024-05-29 05:14:54] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6090098894181721028.txt' '-o' '/tmp/graph6090098894181721028.bin' '-w' '/tmp/graph6090098894181721028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6090098894181721028.bin' '-l' '-1' '-v' '-w' '/tmp/graph6090098894181721028.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:14:54] [INFO ] Decomposing Gal with order
[2024-05-29 05:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:14:55] [INFO ] Removed a total of 2158 redundant transitions.
[2024-05-29 05:14:55] [INFO ] Flatten gal took : 153 ms
[2024-05-29 05:14:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 976 labels/synchronizations in 45 ms.
[2024-05-29 05:14:55] [INFO ] Time to serialize gal into /tmp/LTL12291841654046112764.gal : 48 ms
[2024-05-29 05:14:55] [INFO ] Time to serialize properties into /tmp/LTL652457338410810764.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12291841654046112764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL652457338410810764.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i11.u225.p2049==0)||(i32.i2.i1.u597.p5251==1))&&((i5.i2.i0.u127.p1197==0)||(i35.i1.i2.u653.p5752==1)))"))))
Formula 0 simplified : XF!"(((i11.u225.p2049==0)||(i32.i2.i1.u597.p5251==1))&&((i5.i2.i0.u127.p1197==0)||(i35.i1.i2.u653.p5752==1)))"
Reverse transition relation is NOT exact ! Due to transitions i5.i2.i0.u127.t102.t528, i5.i2.i0.u127.t102.t529, Intersection with reachable at each step e...213
Computing Next relation with stutter on 5.48772e+124 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7608420597969918629
[2024-05-29 05:15:10] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7608420597969918629
Running compilation step : cd /tmp/ltsmin7608420597969918629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7608420597969918629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7608420597969918629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 157452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5914 transition count 4218
Reduce places removed 1196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2393 place count 4718 transition count 4217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2394 place count 4717 transition count 4217
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 794 Pre rules applied. Total rules applied 2394 place count 4717 transition count 3423
Deduced a syphon composed of 794 places in 11 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 3 with 1588 rules applied. Total rules applied 3982 place count 3923 transition count 3423
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 3994 place count 3911 transition count 3411
Iterating global reduction 3 with 12 rules applied. Total rules applied 4006 place count 3911 transition count 3411
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 4006 place count 3911 transition count 3400
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 4028 place count 3900 transition count 3400
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 3 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7420 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7421 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7423 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7625 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7827 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8021 place count 1904 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8023 place count 1902 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8025 place count 1900 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8025 place count 1900 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8027 place count 1899 transition count 1898
Applied a total of 8027 rules in 1596 ms. Remains 1899 /5915 variables (removed 4016) and now considering 1898/5415 (removed 3517) transitions.
// Phase 1: matrix 1898 rows 1899 cols
[2024-05-29 05:15:15] [INFO ] Computed 899 invariants in 4 ms
[2024-05-29 05:15:16] [INFO ] Implicit Places using invariants in 1402 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1403 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5915 places, 1898/5415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1897
Applied a total of 2 rules in 97 ms. Remains 1897 /1898 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1897 cols
[2024-05-29 05:15:16] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:15:18] [INFO ] Implicit Places using invariants in 1464 ms returned []
[2024-05-29 05:15:18] [INFO ] Invariant cache hit.
[2024-05-29 05:15:19] [INFO ] State equation strengthened by 324 read => feed constraints.
[2024-05-29 05:15:26] [INFO ] Implicit Places using invariants and state equation in 8411 ms returned []
Implicit Place search using SMT with State Equation took 9877 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5915 places, 1897/5415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12974 ms. Remains : 1897/5915 places, 1897/5415 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s668 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-06 finished in 13069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&G(!p0))))'
Support contains 5 out of 5915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5914 transition count 4218
Reduce places removed 1196 places and 0 transitions.
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2392 place count 4718 transition count 4218
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2392 place count 4718 transition count 3425
Deduced a syphon composed of 793 places in 10 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3978 place count 3925 transition count 3425
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3987 place count 3916 transition count 3416
Iterating global reduction 2 with 9 rules applied. Total rules applied 3996 place count 3916 transition count 3416
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 3996 place count 3916 transition count 3408
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 4012 place count 3908 transition count 3408
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 2 with 3398 rules applied. Total rules applied 7410 place count 2209 transition count 1709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7411 place count 2209 transition count 1708
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 7413 place count 2208 transition count 1707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7615 place count 2107 transition count 1772
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7817 place count 2006 transition count 1840
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
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 8011 place count 1909 transition count 1905
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8013 place count 1907 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8015 place count 1905 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8015 place count 1905 transition count 1902
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 8017 place count 1904 transition count 1902
Applied a total of 8017 rules in 1615 ms. Remains 1904 /5915 variables (removed 4011) and now considering 1902/5415 (removed 3513) transitions.
// Phase 1: matrix 1902 rows 1904 cols
[2024-05-29 05:15:28] [INFO ] Computed 899 invariants in 8 ms
[2024-05-29 05:15:29] [INFO ] Implicit Places using invariants in 1391 ms returned [1893]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1393 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/5915 places, 1902/5415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1901
Applied a total of 2 rules in 97 ms. Remains 1902 /1903 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
// Phase 1: matrix 1901 rows 1902 cols
[2024-05-29 05:15:29] [INFO ] Computed 898 invariants in 8 ms
[2024-05-29 05:15:31] [INFO ] Implicit Places using invariants in 1478 ms returned []
[2024-05-29 05:15:31] [INFO ] Invariant cache hit.
[2024-05-29 05:15:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 05:15:34] [INFO ] Implicit Places using invariants and state equation in 3080 ms returned []
Implicit Place search using SMT with State Equation took 4560 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1902/5915 places, 1901/5415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7665 ms. Remains : 1902/5915 places, 1901/5415 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, true, (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s516 1), p1:(OR (NOT (OR (EQ s613 0) (EQ s814 1))) (EQ s1729 0) (EQ s321 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-08 finished in 7782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 5901 transition count 5401
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 5901 transition count 5401
Applied a total of 28 rules in 1729 ms. Remains 5901 /5915 variables (removed 14) and now considering 5401/5415 (removed 14) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2024-05-29 05:15:36] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 05:15:38] [INFO ] Implicit Places using invariants in 2045 ms returned []
[2024-05-29 05:15:38] [INFO ] Invariant cache hit.
[2024-05-29 05:15:40] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned []
Implicit Place search using SMT with State Equation took 4204 ms to find 0 implicit places.
[2024-05-29 05:15:40] [INFO ] Invariant cache hit.
[2024-05-29 05:15:44] [INFO ] Dead Transitions using invariants and state equation in 4086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5915 places, 5401/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10021 ms. Remains : 5901/5915 places, 5401/5415 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s5325 1), p0:(AND (EQ s520 0) (EQ s2148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-09 finished in 10243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5902 transition count 5402
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5902 transition count 5402
Applied a total of 26 rules in 1666 ms. Remains 5902 /5915 variables (removed 13) and now considering 5402/5415 (removed 13) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2024-05-29 05:15:46] [INFO ] Computed 901 invariants in 22 ms
[2024-05-29 05:15:48] [INFO ] Implicit Places using invariants in 2139 ms returned []
[2024-05-29 05:15:48] [INFO ] Invariant cache hit.
[2024-05-29 05:15:50] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 4145 ms to find 0 implicit places.
[2024-05-29 05:15:50] [INFO ] Invariant cache hit.
[2024-05-29 05:15:54] [INFO ] Dead Transitions using invariants and state equation in 4112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5915 places, 5402/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9931 ms. Remains : 5902/5915 places, 5402/5415 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-12 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 (EQ s3703 0) (EQ s2338 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 1423 ms.
Stack based approach found an accepted trace after 2603 steps with 0 reset with depth 2604 and stack size 2604 in 32 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-12 finished in 11512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 5902 transition count 5402
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 5902 transition count 5402
Applied a total of 26 rules in 1628 ms. Remains 5902 /5915 variables (removed 13) and now considering 5402/5415 (removed 13) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2024-05-29 05:15:57] [INFO ] Computed 901 invariants in 15 ms
[2024-05-29 05:15:59] [INFO ] Implicit Places using invariants in 1924 ms returned []
[2024-05-29 05:15:59] [INFO ] Invariant cache hit.
[2024-05-29 05:16:01] [INFO ] Implicit Places using invariants and state equation in 1949 ms returned []
Implicit Place search using SMT with State Equation took 3902 ms to find 0 implicit places.
[2024-05-29 05:16:01] [INFO ] Invariant cache hit.
[2024-05-29 05:16:05] [INFO ] Dead Transitions using invariants and state equation in 4011 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5915 places, 5402/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9550 ms. Remains : 5902/5915 places, 5402/5415 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5090 0) (EQ s2541 1) (EQ s3750 0) (EQ s2460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4428 ms.
Product exploration explored 100000 steps with 50000 reset in 4383 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-13 finished in 18589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 5901 transition count 5401
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 5901 transition count 5401
Applied a total of 28 rules in 1687 ms. Remains 5901 /5915 variables (removed 14) and now considering 5401/5415 (removed 14) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2024-05-29 05:16:16] [INFO ] Computed 901 invariants in 23 ms
[2024-05-29 05:16:18] [INFO ] Implicit Places using invariants in 2021 ms returned []
[2024-05-29 05:16:18] [INFO ] Invariant cache hit.
[2024-05-29 05:16:20] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 3894 ms to find 0 implicit places.
[2024-05-29 05:16:20] [INFO ] Invariant cache hit.
[2024-05-29 05:16:24] [INFO ] Dead Transitions using invariants and state equation in 4327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5915 places, 5401/5415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9910 ms. Remains : 5901/5915 places, 5401/5415 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2832 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-15 finished in 10073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U G(p1))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-02
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 5 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5914 transition count 4218
Reduce places removed 1196 places and 0 transitions.
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2392 place count 4718 transition count 4218
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2392 place count 4718 transition count 3424
Deduced a syphon composed of 794 places in 10 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 3980 place count 3924 transition count 3424
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 3991 place count 3913 transition count 3413
Iterating global reduction 2 with 11 rules applied. Total rules applied 4002 place count 3913 transition count 3413
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4002 place count 3913 transition count 3403
Deduced a syphon composed of 10 places in 9 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 4022 place count 3903 transition count 3403
Performed 1693 Post agglomeration using F-continuation condition.Transition count delta: 1693
Deduced a syphon composed of 1693 places in 4 ms
Reduce places removed 1693 places and 0 transitions.
Iterating global reduction 2 with 3386 rules applied. Total rules applied 7408 place count 2210 transition count 1710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2210 transition count 1709
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2209 transition count 1708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 7613 place count 2108 transition count 1775
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7815 place count 2007 transition count 1841
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
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 8007 place count 1911 transition count 1906
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8009 place count 1909 transition count 1904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8011 place count 1907 transition count 1904
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8011 place count 1907 transition count 1903
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 8013 place count 1906 transition count 1903
Applied a total of 8013 rules in 1555 ms. Remains 1906 /5915 variables (removed 4009) and now considering 1903/5415 (removed 3512) transitions.
// Phase 1: matrix 1903 rows 1906 cols
[2024-05-29 05:16:26] [INFO ] Computed 899 invariants in 5 ms
[2024-05-29 05:16:28] [INFO ] Implicit Places using invariants in 1426 ms returned [1895]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1428 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1905/5915 places, 1903/5415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1904 transition count 1902
Applied a total of 2 rules in 101 ms. Remains 1904 /1905 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
// Phase 1: matrix 1902 rows 1904 cols
[2024-05-29 05:16:28] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 05:16:29] [INFO ] Implicit Places using invariants in 1335 ms returned []
[2024-05-29 05:16:29] [INFO ] Invariant cache hit.
[2024-05-29 05:16:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:16:32] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 4189 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1904/5915 places, 1902/5415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7277 ms. Remains : 1904/5915 places, 1902/5415 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1488 1) (OR (EQ s3 0) (EQ s1168 1))), p0:(OR (EQ s833 0) (EQ s533 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-02 finished in 7563 ms.
FORMULA ShieldIIPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-03
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1195 place count 5914 transition count 4219
Reduce places removed 1195 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2391 place count 4719 transition count 4218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2392 place count 4718 transition count 4218
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 793 Pre rules applied. Total rules applied 2392 place count 4718 transition count 3425
Deduced a syphon composed of 793 places in 10 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 3 with 1586 rules applied. Total rules applied 3978 place count 3925 transition count 3425
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 3989 place count 3914 transition count 3414
Iterating global reduction 3 with 11 rules applied. Total rules applied 4000 place count 3914 transition count 3414
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 4000 place count 3914 transition count 3403
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 4022 place count 3903 transition count 3403
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 3 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7416 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7417 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7419 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7621 place count 2104 transition count 1770
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 7823 place count 2003 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8015 place count 1907 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8017 place count 1905 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8019 place count 1903 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8019 place count 1903 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8021 place count 1902 transition count 1898
Applied a total of 8021 rules in 1639 ms. Remains 1902 /5915 variables (removed 4013) and now considering 1898/5415 (removed 3517) transitions.
// Phase 1: matrix 1898 rows 1902 cols
[2024-05-29 05:16:34] [INFO ] Computed 899 invariants in 3 ms
[2024-05-29 05:16:35] [INFO ] Implicit Places using invariants in 1473 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1475 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1901/5915 places, 1898/5415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1897
Applied a total of 2 rules in 121 ms. Remains 1900 /1901 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2024-05-29 05:16:35] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:16:37] [INFO ] Implicit Places using invariants in 1371 ms returned []
[2024-05-29 05:16:37] [INFO ] Invariant cache hit.
[2024-05-29 05:16:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:16:39] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 4084 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1900/5915 places, 1897/5415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7320 ms. Remains : 1900/5915 places, 1897/5415 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s801 0) (EQ s1423 1)), p0:(OR (EQ s1564 0) (EQ s1512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1172 ms.
Product exploration explored 100000 steps with 0 reset in 1624 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 p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2024-05-29 05:16:43] [INFO ] Invariant cache hit.
[2024-05-29 05:16:43] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:16:43] [INFO ] [Nat]Absence check using 898 positive place invariants in 163 ms returned sat
[2024-05-29 05:16:44] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:16:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:16:44] [INFO ] After 59ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:16:44] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-29 05:16:44] [INFO ] After 1553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1896
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 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 193 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 1898/1900 places, 1894/1897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) 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 107854 steps, run timeout after 3009 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107854 steps, saw 66973 distinct states, run finished after 3009 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:16:48] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 05:16:48] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:16:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 174 ms returned sat
[2024-05-29 05:16:50] [INFO ] After 897ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:16:50] [INFO ] After 1006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-29 05:16:50] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 57 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 47 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:16:50] [INFO ] Invariant cache hit.
[2024-05-29 05:16:51] [INFO ] Implicit Places using invariants in 1430 ms returned []
[2024-05-29 05:16:51] [INFO ] Invariant cache hit.
[2024-05-29 05:16:54] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 4256 ms to find 0 implicit places.
[2024-05-29 05:16:54] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-29 05:16:54] [INFO ] Invariant cache hit.
[2024-05-29 05:16:55] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5699 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 111 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:16:56] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:16:56] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:16:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 155 ms returned sat
[2024-05-29 05:16:57] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:16:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 05:16:57] [INFO ] After 65ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:16:57] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-29 05:16:57] [INFO ] After 1548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 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 57 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 50 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2024-05-29 05:16:58] [INFO ] Computed 898 invariants in 4 ms
[2024-05-29 05:16:59] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2024-05-29 05:16:59] [INFO ] Invariant cache hit.
[2024-05-29 05:17:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:17:02] [INFO ] Implicit Places using invariants and state equation in 2841 ms returned []
Implicit Place search using SMT with State Equation took 4277 ms to find 0 implicit places.
[2024-05-29 05:17:02] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 05:17:02] [INFO ] Invariant cache hit.
[2024-05-29 05:17:03] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5689 ms. Remains : 1900/1900 places, 1897/1897 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 p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 137 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 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:17:04] [INFO ] Invariant cache hit.
[2024-05-29 05:17:04] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:17:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2024-05-29 05:17:06] [INFO ] After 852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:17:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:17:06] [INFO ] After 63ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:17:06] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-29 05:17:06] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1896
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 1 with 2 rules applied. Total rules applied 3 place count 1899 transition count 1895
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1899 transition count 1895
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1898 transition count 1894
Applied a total of 5 rules in 224 ms. Remains 1898 /1900 variables (removed 2) and now considering 1894/1897 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 1898/1900 places, 1894/1897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 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 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101832 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101832 steps, saw 63042 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:17:09] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:17:10] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:17:10] [INFO ] [Nat]Absence check using 898 positive place invariants in 186 ms returned sat
[2024-05-29 05:17:11] [INFO ] After 832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:17:11] [INFO ] After 942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 05:17:11] [INFO ] After 1460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 59 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 1894/1894 transitions.
Applied a total of 0 rules in 74 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:17:11] [INFO ] Invariant cache hit.
[2024-05-29 05:17:13] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-29 05:17:13] [INFO ] Invariant cache hit.
[2024-05-29 05:17:15] [INFO ] Implicit Places using invariants and state equation in 2575 ms returned []
Implicit Place search using SMT with State Equation took 4015 ms to find 0 implicit places.
[2024-05-29 05:17:15] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 05:17:15] [INFO ] Invariant cache hit.
[2024-05-29 05:17:17] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5410 ms. Remains : 1898/1898 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1898 transition count 1894
Applied a total of 200 rules in 168 ms. Remains 1898 /1898 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1898 cols
[2024-05-29 05:17:17] [INFO ] Computed 898 invariants in 2 ms
[2024-05-29 05:17:17] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:17:17] [INFO ] [Nat]Absence check using 898 positive place invariants in 154 ms returned sat
[2024-05-29 05:17:18] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:17:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 05:17:18] [INFO ] After 59ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 05:17:18] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-29 05:17:18] [INFO ] After 1533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 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 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1255 ms.
Product exploration explored 100000 steps with 0 reset in 1701 ms.
Built C files in :
/tmp/ltsmin8084229089045666638
[2024-05-29 05:17:22] [INFO ] Too many transitions (1897) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:17:22] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8084229089045666638
Running compilation step : cd /tmp/ltsmin8084229089045666638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8084229089045666638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8084229089045666638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1897/1897 transitions.
Applied a total of 0 rules in 56 ms. Remains 1900 /1900 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1900 cols
[2024-05-29 05:17:25] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 05:17:26] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2024-05-29 05:17:26] [INFO ] Invariant cache hit.
[2024-05-29 05:17:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 05:17:29] [INFO ] Implicit Places using invariants and state equation in 2783 ms returned []
Implicit Place search using SMT with State Equation took 4243 ms to find 0 implicit places.
[2024-05-29 05:17:29] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 05:17:29] [INFO ] Invariant cache hit.
[2024-05-29 05:17:31] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5629 ms. Remains : 1900/1900 places, 1897/1897 transitions.
Built C files in :
/tmp/ltsmin3270616581010781339
[2024-05-29 05:17:31] [INFO ] Too many transitions (1897) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:17:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3270616581010781339
Running compilation step : cd /tmp/ltsmin3270616581010781339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3270616581010781339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3270616581010781339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 05:17:34] [INFO ] Flatten gal took : 44 ms
[2024-05-29 05:17:34] [INFO ] Flatten gal took : 46 ms
[2024-05-29 05:17:34] [INFO ] Time to serialize gal into /tmp/LTL2544117391709267773.gal : 8 ms
[2024-05-29 05:17:34] [INFO ] Time to serialize properties into /tmp/LTL6444321257254174067.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2544117391709267773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9212268696817654590.hoa' '-atoms' '/tmp/LTL6444321257254174067.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6444321257254174067.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9212268696817654590.hoa
Detected timeout of ITS tools.
[2024-05-29 05:17:49] [INFO ] Flatten gal took : 44 ms
[2024-05-29 05:17:49] [INFO ] Flatten gal took : 44 ms
[2024-05-29 05:17:49] [INFO ] Time to serialize gal into /tmp/LTL11906945783418285772.gal : 8 ms
[2024-05-29 05:17:49] [INFO ] Time to serialize properties into /tmp/LTL15497538032343108662.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11906945783418285772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15497538032343108662.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p5766==0)||(p5571==1))")))||(G("((p2995==0)||(p5247==1))")))))
Formula 0 simplified : X(GF!"((p5766==0)||(p5571==1))" & F!"((p2995==0)||(p5247==1))")
Detected timeout of ITS tools.
[2024-05-29 05:18:04] [INFO ] Flatten gal took : 43 ms
[2024-05-29 05:18:04] [INFO ] Applying decomposition
[2024-05-29 05:18:04] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11265890276723862910.txt' '-o' '/tmp/graph11265890276723862910.bin' '-w' '/tmp/graph11265890276723862910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11265890276723862910.bin' '-l' '-1' '-v' '-w' '/tmp/graph11265890276723862910.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:18:04] [INFO ] Decomposing Gal with order
[2024-05-29 05:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:18:04] [INFO ] Removed a total of 2172 redundant transitions.
[2024-05-29 05:18:04] [INFO ] Flatten gal took : 97 ms
[2024-05-29 05:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 986 labels/synchronizations in 35 ms.
[2024-05-29 05:18:05] [INFO ] Time to serialize gal into /tmp/LTL14820687064638793514.gal : 14 ms
[2024-05-29 05:18:05] [INFO ] Time to serialize properties into /tmp/LTL4243458502328234259.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14820687064638793514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4243458502328234259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i36.i1.i1.u657.p5766==0)||(i35.i1.i1.u635.p5571==1))")))||(G("((i18.i1.i2.u335.p2995==0)||(i33.i0.i0.u598.p5247==1))"))))...156
Formula 0 simplified : X(GF!"((i36.i1.i1.u657.p5766==0)||(i35.i1.i1.u635.p5571==1))" & F!"((i18.i1.i2.u335.p2995==0)||(i33.i0.i0.u598.p5247==1))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1199_t400_t407, i0.i0.i1.t1200_t403_t406, i0.i0.i1.u1.t1202, i0.i1.t1, i0.i1...7088
Computing Next relation with stutter on 5.48772e+124 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12268048821588891416
[2024-05-29 05:18:20] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12268048821588891416
Running compilation step : cd /tmp/ltsmin12268048821588891416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12268048821588891416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12268048821588891416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-03 finished in 110822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-100B-LTLCardinality-05
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 5915 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5915/5915 places, 5415/5415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5914 transition count 4218
Reduce places removed 1196 places and 0 transitions.
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2392 place count 4718 transition count 4218
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2392 place count 4718 transition count 3425
Deduced a syphon composed of 793 places in 9 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3978 place count 3925 transition count 3425
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 3989 place count 3914 transition count 3414
Iterating global reduction 2 with 11 rules applied. Total rules applied 4000 place count 3914 transition count 3414
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4000 place count 3914 transition count 3404
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 4020 place count 3904 transition count 3404
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7416 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7417 place count 2206 transition count 1705
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7419 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 7621 place count 2104 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
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 7823 place count 2003 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8015 place count 1907 transition count 1900
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8017 place count 1905 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8019 place count 1903 transition count 1898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8019 place count 1903 transition count 1897
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 8021 place count 1902 transition count 1897
Applied a total of 8021 rules in 1557 ms. Remains 1902 /5915 variables (removed 4013) and now considering 1897/5415 (removed 3518) transitions.
// Phase 1: matrix 1897 rows 1902 cols
[2024-05-29 05:18:24] [INFO ] Computed 899 invariants in 8 ms
[2024-05-29 05:18:26] [INFO ] Implicit Places using invariants in 1457 ms returned [1891]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1459 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1901/5915 places, 1897/5415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1896
Applied a total of 2 rules in 93 ms. Remains 1900 /1901 variables (removed 1) and now considering 1896/1897 (removed 1) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2024-05-29 05:18:26] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:18:27] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2024-05-29 05:18:27] [INFO ] Invariant cache hit.
[2024-05-29 05:18:30] [INFO ] Implicit Places using invariants and state equation in 2887 ms returned []
Implicit Place search using SMT with State Equation took 4313 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1900/5915 places, 1896/5415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7427 ms. Remains : 1900/5915 places, 1896/5415 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s539 0) (EQ s1425 1)) (OR (EQ s304 0) (EQ s1562 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1297 ms.
Product exploration explored 100000 steps with 0 reset in 1936 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 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 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103695 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103695 steps, saw 62177 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:18:37] [INFO ] Invariant cache hit.
[2024-05-29 05:18:37] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:18:38] [INFO ] [Nat]Absence check using 898 positive place invariants in 165 ms returned sat
[2024-05-29 05:18:39] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:18:39] [INFO ] After 1122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-29 05:18:39] [INFO ] After 1627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1899 transition count 1894
Applied a total of 3 rules in 115 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1899/1900 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 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 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102583 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102583 steps, saw 63511 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:18:42] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 05:18:43] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:18:43] [INFO ] [Nat]Absence check using 898 positive place invariants in 168 ms returned sat
[2024-05-29 05:18:44] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:18:44] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-29 05:18:44] [INFO ] After 1480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 69 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 69 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 72 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:18:44] [INFO ] Invariant cache hit.
[2024-05-29 05:18:46] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2024-05-29 05:18:46] [INFO ] Invariant cache hit.
[2024-05-29 05:18:48] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 4097 ms to find 0 implicit places.
[2024-05-29 05:18:48] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-29 05:18:48] [INFO ] Invariant cache hit.
[2024-05-29 05:18:50] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5554 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 108 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:18:50] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 05:18:50] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:18:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 159 ms returned sat
[2024-05-29 05:18:51] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:18:52] [INFO ] After 987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 05:18:52] [INFO ] After 1481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 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 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 51 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2024-05-29 05:18:52] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 05:18:53] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2024-05-29 05:18:53] [INFO ] Invariant cache hit.
[2024-05-29 05:18:56] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 4155 ms to find 0 implicit places.
[2024-05-29 05:18:56] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-29 05:18:56] [INFO ] Invariant cache hit.
[2024-05-29 05:18:57] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5582 ms. Remains : 1900/1900 places, 1896/1896 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 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 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 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 149 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104482 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104482 steps, saw 62609 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:19:01] [INFO ] Invariant cache hit.
[2024-05-29 05:19:01] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:19:02] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2024-05-29 05:19:02] [INFO ] After 857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:19:03] [INFO ] After 964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 05:19:03] [INFO ] After 1479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1900 transition count 1895
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1900 transition count 1894
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1899 transition count 1894
Applied a total of 3 rules in 147 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1896 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1899/1900 places, 1894/1896 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103121 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103121 steps, saw 63891 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:19:06] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:19:06] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:19:07] [INFO ] [Nat]Absence check using 898 positive place invariants in 179 ms returned sat
[2024-05-29 05:19:08] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:19:08] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-29 05:19:08] [INFO ] After 1533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 56 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1894/1894 transitions.
Applied a total of 0 rules in 58 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2024-05-29 05:19:08] [INFO ] Invariant cache hit.
[2024-05-29 05:19:09] [INFO ] Implicit Places using invariants in 1361 ms returned []
[2024-05-29 05:19:09] [INFO ] Invariant cache hit.
[2024-05-29 05:19:12] [INFO ] Implicit Places using invariants and state equation in 2682 ms returned []
Implicit Place search using SMT with State Equation took 4073 ms to find 0 implicit places.
[2024-05-29 05:19:12] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-29 05:19:12] [INFO ] Invariant cache hit.
[2024-05-29 05:19:13] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5433 ms. Remains : 1899/1899 places, 1894/1894 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1899 transition count 1894
Applied a total of 199 rules in 116 ms. Remains 1899 /1899 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1894 rows 1899 cols
[2024-05-29 05:19:14] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 05:19:14] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:19:14] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2024-05-29 05:19:15] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:19:15] [INFO ] After 967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 05:19:15] [INFO ] After 1456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 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 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1211 ms.
Product exploration explored 100000 steps with 0 reset in 1613 ms.
Built C files in :
/tmp/ltsmin11090041343612345475
[2024-05-29 05:19:18] [INFO ] Too many transitions (1896) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:19:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11090041343612345475
Running compilation step : cd /tmp/ltsmin11090041343612345475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11090041343612345475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin11090041343612345475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1900/1900 places, 1896/1896 transitions.
Applied a total of 0 rules in 64 ms. Remains 1900 /1900 variables (removed 0) and now considering 1896/1896 (removed 0) transitions.
// Phase 1: matrix 1896 rows 1900 cols
[2024-05-29 05:19:21] [INFO ] Computed 898 invariants in 5 ms
[2024-05-29 05:19:23] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2024-05-29 05:19:23] [INFO ] Invariant cache hit.
[2024-05-29 05:19:26] [INFO ] Implicit Places using invariants and state equation in 2925 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
[2024-05-29 05:19:26] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-29 05:19:26] [INFO ] Invariant cache hit.
[2024-05-29 05:19:27] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5750 ms. Remains : 1900/1900 places, 1896/1896 transitions.
Built C files in :
/tmp/ltsmin3319268827028643755
[2024-05-29 05:19:27] [INFO ] Too many transitions (1896) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:19:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3319268827028643755
Running compilation step : cd /tmp/ltsmin3319268827028643755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3319268827028643755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3319268827028643755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 05:19:30] [INFO ] Flatten gal took : 57 ms
[2024-05-29 05:19:30] [INFO ] Flatten gal took : 51 ms
[2024-05-29 05:19:30] [INFO ] Time to serialize gal into /tmp/LTL4540436040373677884.gal : 8 ms
[2024-05-29 05:19:30] [INFO ] Time to serialize properties into /tmp/LTL14232057345387904051.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4540436040373677884.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10867509229334340457.hoa' '-atoms' '/tmp/LTL14232057345387904051.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14232057345387904051.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10867509229334340457.hoa
Detected timeout of ITS tools.
[2024-05-29 05:19:45] [INFO ] Flatten gal took : 45 ms
[2024-05-29 05:19:46] [INFO ] Flatten gal took : 48 ms
[2024-05-29 05:19:46] [INFO ] Time to serialize gal into /tmp/LTL871249408073732061.gal : 10 ms
[2024-05-29 05:19:46] [INFO ] Time to serialize properties into /tmp/LTL5712000605826362457.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL871249408073732061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5712000605826362457.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p2049==0)||(p5251==1))&&((p1197==0)||(p5752==1)))"))))
Formula 0 simplified : XF!"(((p2049==0)||(p5251==1))&&((p1197==0)||(p5752==1)))"
Detected timeout of ITS tools.
[2024-05-29 05:20:01] [INFO ] Flatten gal took : 48 ms
[2024-05-29 05:20:01] [INFO ] Applying decomposition
[2024-05-29 05:20:01] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8691066952815896260.txt' '-o' '/tmp/graph8691066952815896260.bin' '-w' '/tmp/graph8691066952815896260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8691066952815896260.bin' '-l' '-1' '-v' '-w' '/tmp/graph8691066952815896260.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:20:01] [INFO ] Decomposing Gal with order
[2024-05-29 05:20:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:20:01] [INFO ] Removed a total of 2161 redundant transitions.
[2024-05-29 05:20:01] [INFO ] Flatten gal took : 87 ms
[2024-05-29 05:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 980 labels/synchronizations in 23 ms.
[2024-05-29 05:20:01] [INFO ] Time to serialize gal into /tmp/LTL13997996293846738951.gal : 18 ms
[2024-05-29 05:20:01] [INFO ] Time to serialize properties into /tmp/LTL7680327184855503419.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13997996293846738951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7680327184855503419.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i12.i0.i1.u228.p2049==0)||(i32.i1.i2.u598.p5251==1))&&((i6.u127.p1197==0)||(i35.i1.i2.u654.p5752==1)))"))))
Formula 0 simplified : XF!"(((i12.i0.i1.u228.p2049==0)||(i32.i1.i2.u598.p5251==1))&&((i6.u127.p1197==0)||(i35.i1.i2.u654.p5752==1)))"
Reverse transition relation is NOT exact ! Due to transitions i6.u127.t102.t528, i6.u127.t102.t529, Intersection with reachable at each step enabled. (des...201
Computing Next relation with stutter on 5.48772e+124 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14959150492190292564
[2024-05-29 05:20:16] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14959150492190292564
Running compilation step : cd /tmp/ltsmin14959150492190292564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14959150492190292564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14959150492190292564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-100B-LTLCardinality-05 finished in 116563 ms.
[2024-05-29 05:20:19] [INFO ] Flatten gal took : 107 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15878352837889398694
[2024-05-29 05:20:19] [INFO ] Too many transitions (5415) to apply POR reductions. Disabling POR matrices.
[2024-05-29 05:20:19] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15878352837889398694
Running compilation step : cd /tmp/ltsmin15878352837889398694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 05:20:19] [INFO ] Applying decomposition
[2024-05-29 05:20:20] [INFO ] Flatten gal took : 128 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17555171514839131675.txt' '-o' '/tmp/graph17555171514839131675.bin' '-w' '/tmp/graph17555171514839131675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17555171514839131675.bin' '-l' '-1' '-v' '-w' '/tmp/graph17555171514839131675.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:20:20] [INFO ] Decomposing Gal with order
[2024-05-29 05:20:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:20:21] [INFO ] Removed a total of 982 redundant transitions.
[2024-05-29 05:20:21] [INFO ] Flatten gal took : 207 ms
[2024-05-29 05:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-29 05:20:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality1617420314641538467.gal : 41 ms
[2024-05-29 05:20:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality18159130091220616283.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1617420314641538467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18159130091220616283.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((F(G("((i51.i0.i1.u1817.p5766==0)||(i49.i0.i2.u1753.p5571==1))")))||(G("((i26.u952.p2995==0)||(i46.i1.i4.u1655.p5247==1))")))))
Formula 0 simplified : X(GF!"((i51.i0.i1.u1817.p5766==0)||(i49.i0.i2.u1753.p5571==1))" & F!"((i26.u952.p2995==0)||(i46.i1.i4.u1655.p5247==1))")
Compilation finished in 20451 ms.
Running link step : cd /tmp/ltsmin15878352837889398694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin15878352837889398694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 05:46:02] [INFO ] Applying decomposition
[2024-05-29 05:46:02] [INFO ] Flatten gal took : 258 ms
[2024-05-29 05:46:02] [INFO ] Decomposing Gal with order
[2024-05-29 05:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:46:08] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-29 05:46:08] [INFO ] Flatten gal took : 700 ms
[2024-05-29 05:46:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 41 ms.
[2024-05-29 05:46:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality10240685011541452054.gal : 141 ms
[2024-05-29 05:46:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality13287634942211240085.ltl : 24 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10240685011541452054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13287634942211240085.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X((F(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u2290.p5766==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...530
Formula 0 simplified : X(GF!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.u2290.p5766==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...520
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15878352837889398694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15878352837889398694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp4==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6307184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16035568 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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ShieldIIPt-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-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 r373-tall-171683788800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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