Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974900172.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679170694092

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:18:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:18:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:18:17] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2023-03-18 20:18:17] [INFO ] Transformed 4003 places.
[2023-03-18 20:18:17] [INFO ] Transformed 4503 transitions.
[2023-03-18 20:18:17] [INFO ] Found NUPN structural information;
[2023-03-18 20:18:17] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 658 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-100B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 4003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Discarding 685 places :
Symmetric choice reduction at 0 with 685 rule applications. Total rules 685 place count 3318 transition count 3818
Iterating global reduction 0 with 685 rules applied. Total rules applied 1370 place count 3318 transition count 3818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1371 place count 3317 transition count 3817
Iterating global reduction 0 with 1 rules applied. Total rules applied 1372 place count 3317 transition count 3817
Applied a total of 1372 rules in 1198 ms. Remains 3317 /4003 variables (removed 686) and now considering 3817/4503 (removed 686) transitions.
// Phase 1: matrix 3817 rows 3317 cols
[2023-03-18 20:18:19] [INFO ] Computed 401 place invariants in 60 ms
[2023-03-18 20:18:23] [INFO ] Implicit Places using invariants in 4486 ms returned []
[2023-03-18 20:18:23] [INFO ] Invariant cache hit.
[2023-03-18 20:18:26] [INFO ] Implicit Places using invariants and state equation in 2696 ms returned []
Implicit Place search using SMT with State Equation took 7289 ms to find 0 implicit places.
[2023-03-18 20:18:26] [INFO ] Invariant cache hit.
[2023-03-18 20:18:30] [INFO ] Dead Transitions using invariants and state equation in 3400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3317/4003 places, 3817/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11895 ms. Remains : 3317/4003 places, 3817/4503 transitions.
Support contains 50 out of 3317 places after structural reductions.
[2023-03-18 20:18:30] [INFO ] Flatten gal took : 459 ms
[2023-03-18 20:18:31] [INFO ] Flatten gal took : 323 ms
[2023-03-18 20:18:31] [INFO ] Input system was already deterministic with 3817 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1384 ms. (steps per millisecond=7 ) properties (out of 32) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-18 20:18:34] [INFO ] Invariant cache hit.
[2023-03-18 20:18:35] [INFO ] After 1567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 20:18:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 296 ms returned sat
[2023-03-18 20:18:42] [INFO ] After 5001ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 20:18:43] [INFO ] Deduced a trap composed of 19 places in 1099 ms of which 31 ms to minimize.
[2023-03-18 20:18:44] [INFO ] Deduced a trap composed of 25 places in 845 ms of which 3 ms to minimize.
[2023-03-18 20:18:45] [INFO ] Deduced a trap composed of 20 places in 1218 ms of which 3 ms to minimize.
[2023-03-18 20:18:47] [INFO ] Deduced a trap composed of 23 places in 1172 ms of which 4 ms to minimize.
[2023-03-18 20:18:48] [INFO ] Deduced a trap composed of 24 places in 1196 ms of which 2 ms to minimize.
[2023-03-18 20:18:49] [INFO ] Deduced a trap composed of 15 places in 802 ms of which 1 ms to minimize.
[2023-03-18 20:18:55] [INFO ] Deduced a trap composed of 43 places in 5718 ms of which 2 ms to minimize.
[2023-03-18 20:18:56] [INFO ] Deduced a trap composed of 55 places in 675 ms of which 1 ms to minimize.
[2023-03-18 20:18:57] [INFO ] Deduced a trap composed of 32 places in 1273 ms of which 1 ms to minimize.
[2023-03-18 20:18:58] [INFO ] Deduced a trap composed of 31 places in 649 ms of which 2 ms to minimize.
[2023-03-18 20:18:59] [INFO ] Deduced a trap composed of 16 places in 629 ms of which 2 ms to minimize.
[2023-03-18 20:19:00] [INFO ] Deduced a trap composed of 45 places in 724 ms of which 1 ms to minimize.
[2023-03-18 20:19:01] [INFO ] Deduced a trap composed of 37 places in 879 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:19:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:19:01] [INFO ] After 25545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 2149 ms.
Support contains 24 out of 3317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 396 place count 3317 transition count 3421
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 792 place count 2921 transition count 3421
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 792 place count 2921 transition count 2921
Deduced a syphon composed of 500 places in 39 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1792 place count 2421 transition count 2921
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1802 place count 2411 transition count 2911
Iterating global reduction 2 with 10 rules applied. Total rules applied 1812 place count 2411 transition count 2911
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1812 place count 2411 transition count 2908
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1818 place count 2408 transition count 2908
Performed 990 Post agglomeration using F-continuation condition.Transition count delta: 990
Deduced a syphon composed of 990 places in 7 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 2 with 1980 rules applied. Total rules applied 3798 place count 1418 transition count 1918
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 198 times.
Drop transitions removed 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 3996 place count 1418 transition count 1918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3997 place count 1417 transition count 1917
Applied a total of 3997 rules in 1138 ms. Remains 1417 /3317 variables (removed 1900) and now considering 1917/3817 (removed 1900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1140 ms. Remains : 1417/3317 places, 1917/3817 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1917 rows 1417 cols
[2023-03-18 20:19:04] [INFO ] Computed 401 place invariants in 31 ms
[2023-03-18 20:19:05] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:19:05] [INFO ] [Nat]Absence check using 401 positive place invariants in 61 ms returned sat
[2023-03-18 20:19:06] [INFO ] After 737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:19:06] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-18 20:19:06] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-18 20:19:06] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-18 20:19:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 353 ms
[2023-03-18 20:19:06] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-18 20:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-18 20:19:06] [INFO ] After 1355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-18 20:19:06] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 56 ms.
Support contains 10 out of 1417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 1917/1917 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1417 transition count 1914
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1414 transition count 1914
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 20 place count 1407 transition count 1907
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 1407 transition count 1907
Applied a total of 23 rules in 244 ms. Remains 1407 /1417 variables (removed 10) and now considering 1907/1917 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 1407/1417 places, 1907/1917 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 153953 steps, run timeout after 3007 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153953 steps, saw 150242 distinct states, run finished after 3010 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1907 rows 1407 cols
[2023-03-18 20:19:10] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-18 20:19:10] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:19:11] [INFO ] [Nat]Absence check using 401 positive place invariants in 61 ms returned sat
[2023-03-18 20:19:11] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:19:11] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-18 20:19:12] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-18 20:19:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-03-18 20:19:12] [INFO ] After 1057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-18 20:19:12] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 53 ms.
Support contains 10 out of 1407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1407/1407 places, 1907/1907 transitions.
Applied a total of 0 rules in 74 ms. Remains 1407 /1407 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1407/1407 places, 1907/1907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1407/1407 places, 1907/1907 transitions.
Applied a total of 0 rules in 77 ms. Remains 1407 /1407 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
[2023-03-18 20:19:12] [INFO ] Invariant cache hit.
[2023-03-18 20:19:13] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-18 20:19:13] [INFO ] Invariant cache hit.
[2023-03-18 20:19:14] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
[2023-03-18 20:19:15] [INFO ] Redundant transitions in 475 ms returned []
[2023-03-18 20:19:15] [INFO ] Invariant cache hit.
[2023-03-18 20:19:16] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3765 ms. Remains : 1407/1407 places, 1907/1907 transitions.
Applied a total of 0 rules in 74 ms. Remains 1407 /1407 variables (removed 0) and now considering 1907/1907 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 20:19:16] [INFO ] Invariant cache hit.
[2023-03-18 20:19:16] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:19:16] [INFO ] [Nat]Absence check using 401 positive place invariants in 60 ms returned sat
[2023-03-18 20:19:17] [INFO ] After 1096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:19:17] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 14 ms to minimize.
[2023-03-18 20:19:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-18 20:19:18] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-18 20:19:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2023-03-18 20:19:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 434 ms
[2023-03-18 20:19:18] [INFO ] After 1673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-18 20:19:18] [INFO ] After 2043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 809 stabilizing places and 809 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U G(p2)))))'
Support contains 8 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 446 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:19:19] [INFO ] Computed 401 place invariants in 32 ms
[2023-03-18 20:19:20] [INFO ] Implicit Places using invariants in 986 ms returned []
[2023-03-18 20:19:20] [INFO ] Invariant cache hit.
[2023-03-18 20:19:25] [INFO ] Implicit Places using invariants and state equation in 5141 ms returned []
Implicit Place search using SMT with State Equation took 6135 ms to find 0 implicit places.
[2023-03-18 20:19:25] [INFO ] Invariant cache hit.
[2023-03-18 20:19:28] [INFO ] Dead Transitions using invariants and state equation in 2572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9154 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s1762 1), p1:(EQ s1790 1), p0:(OR (EQ s2574 0) (EQ s2610 0) (EQ s2630 0) (EQ s1404 0) (EQ s1411 0) (EQ s1432 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 101 reset in 901 ms.
Product exploration explored 100000 steps with 80 reset in 866 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1021 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:19:32] [INFO ] Invariant cache hit.
[2023-03-18 20:19:32] [INFO ] [Real]Absence check using 401 positive place invariants in 197 ms returned sat
[2023-03-18 20:19:33] [INFO ] After 976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:19:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 195 ms returned sat
[2023-03-18 20:19:37] [INFO ] After 3485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:19:38] [INFO ] Deduced a trap composed of 36 places in 880 ms of which 2 ms to minimize.
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 21 places in 800 ms of which 2 ms to minimize.
[2023-03-18 20:19:40] [INFO ] Deduced a trap composed of 24 places in 1053 ms of which 2 ms to minimize.
[2023-03-18 20:19:41] [INFO ] Deduced a trap composed of 34 places in 889 ms of which 2 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 28 places in 896 ms of which 2 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 37 places in 882 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 26 places in 902 ms of which 2 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 35 places in 892 ms of which 4 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 25 places in 833 ms of which 2 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 20 places in 984 ms of which 2 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 30 places in 1056 ms of which 2 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 23 places in 945 ms of which 2 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 21 places in 850 ms of which 2 ms to minimize.
[2023-03-18 20:19:52] [INFO ] Deduced a trap composed of 30 places in 813 ms of which 1 ms to minimize.
[2023-03-18 20:19:53] [INFO ] Deduced a trap composed of 46 places in 988 ms of which 1 ms to minimize.
[2023-03-18 20:19:54] [INFO ] Deduced a trap composed of 22 places in 786 ms of which 2 ms to minimize.
[2023-03-18 20:19:55] [INFO ] Deduced a trap composed of 20 places in 898 ms of which 14 ms to minimize.
[2023-03-18 20:19:56] [INFO ] Deduced a trap composed of 54 places in 978 ms of which 2 ms to minimize.
[2023-03-18 20:19:57] [INFO ] Deduced a trap composed of 55 places in 841 ms of which 1 ms to minimize.
[2023-03-18 20:19:58] [INFO ] Deduced a trap composed of 57 places in 933 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:19:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:19:58] [INFO ] After 25284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1111 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3303 transition count 3406
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2906 transition count 3406
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2906 transition count 2907
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2407 transition count 2907
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 5 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3786 place count 1410 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3987 place count 1410 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3988 place count 1409 transition count 1909
Applied a total of 3988 rules in 528 ms. Remains 1409 /3303 variables (removed 1894) and now considering 1909/3803 (removed 1894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 1409/3303 places, 1909/3803 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 91588 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91588 steps, saw 89385 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:20:03] [INFO ] Computed 401 place invariants in 16 ms
[2023-03-18 20:20:04] [INFO ] [Real]Absence check using 401 positive place invariants in 54 ms returned sat
[2023-03-18 20:20:04] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:20:04] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-18 20:20:05] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 505 ms
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 12 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 570 ms
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-18 20:20:07] [INFO ] After 2989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 403 ms.
[2023-03-18 20:20:08] [INFO ] After 3803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 253 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 71 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 67 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-18 20:20:08] [INFO ] Invariant cache hit.
[2023-03-18 20:20:09] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-18 20:20:09] [INFO ] Invariant cache hit.
[2023-03-18 20:20:10] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2328 ms to find 0 implicit places.
[2023-03-18 20:20:10] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-18 20:20:10] [INFO ] Invariant cache hit.
[2023-03-18 20:20:11] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3443 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 67 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-18 20:20:11] [INFO ] Invariant cache hit.
[2023-03-18 20:20:12] [INFO ] [Real]Absence check using 401 positive place invariants in 72 ms returned sat
[2023-03-18 20:20:12] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:20:12] [INFO ] [Nat]Absence check using 401 positive place invariants in 58 ms returned sat
[2023-03-18 20:20:13] [INFO ] After 959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 868 ms
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-18 20:20:16] [INFO ] After 3339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 683 ms.
[2023-03-18 20:20:16] [INFO ] After 4448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 21 factoid took 1199 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 246 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:20:18] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-18 20:20:19] [INFO ] Implicit Places using invariants in 938 ms returned []
[2023-03-18 20:20:19] [INFO ] Invariant cache hit.
[2023-03-18 20:20:21] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2506 ms to find 0 implicit places.
[2023-03-18 20:20:21] [INFO ] Invariant cache hit.
[2023-03-18 20:20:23] [INFO ] Dead Transitions using invariants and state equation in 2256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5024 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 952 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 20:20:25] [INFO ] Invariant cache hit.
[2023-03-18 20:20:26] [INFO ] [Real]Absence check using 401 positive place invariants in 286 ms returned sat
[2023-03-18 20:20:26] [INFO ] After 1009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 20:20:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 213 ms returned sat
[2023-03-18 20:20:30] [INFO ] After 3593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 20:20:32] [INFO ] Deduced a trap composed of 31 places in 1596 ms of which 3 ms to minimize.
[2023-03-18 20:20:33] [INFO ] Deduced a trap composed of 21 places in 1052 ms of which 2 ms to minimize.
[2023-03-18 20:20:35] [INFO ] Deduced a trap composed of 26 places in 964 ms of which 3 ms to minimize.
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 36 places in 900 ms of which 1 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 29 places in 897 ms of which 2 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 31 places in 905 ms of which 2 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 23 places in 868 ms of which 1 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 23 places in 855 ms of which 2 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 15 places in 783 ms of which 2 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 22 places in 718 ms of which 2 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 34 places in 856 ms of which 2 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 38 places in 859 ms of which 2 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 48 places in 755 ms of which 1 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 19 places in 835 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 1 ms to minimize.
[2023-03-18 20:20:47] [INFO ] Deduced a trap composed of 24 places in 770 ms of which 2 ms to minimize.
[2023-03-18 20:20:48] [INFO ] Deduced a trap composed of 28 places in 852 ms of which 1 ms to minimize.
[2023-03-18 20:20:49] [INFO ] Deduced a trap composed of 29 places in 827 ms of which 2 ms to minimize.
[2023-03-18 20:20:50] [INFO ] Deduced a trap composed of 25 places in 789 ms of which 1 ms to minimize.
[2023-03-18 20:20:50] [INFO ] Deduced a trap composed of 22 places in 804 ms of which 2 ms to minimize.
[2023-03-18 20:20:51] [INFO ] Deduced a trap composed of 27 places in 874 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:20:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:20:51] [INFO ] After 25719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1033 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3303 transition count 3406
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2906 transition count 3406
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2906 transition count 2907
Deduced a syphon composed of 499 places in 9 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2407 transition count 2907
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 5 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3786 place count 1410 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3987 place count 1410 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3988 place count 1409 transition count 1909
Applied a total of 3988 rules in 676 ms. Remains 1409 /3303 variables (removed 1894) and now considering 1909/3803 (removed 1894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 677 ms. Remains : 1409/3303 places, 1909/3803 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:20:54] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-18 20:20:54] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:20:54] [INFO ] [Nat]Absence check using 401 positive place invariants in 56 ms returned sat
[2023-03-18 20:20:55] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:20:55] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-18 20:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-18 20:20:55] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 643 ms
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-18 20:20:56] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-18 20:20:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2023-03-18 20:20:57] [INFO ] After 2301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-18 20:20:57] [INFO ] After 2861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 151 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 65 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 111832 steps, run timeout after 3055 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 111832 steps, saw 109178 distinct states, run finished after 3056 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 20:21:01] [INFO ] Invariant cache hit.
[2023-03-18 20:21:01] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:21:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 54 ms returned sat
[2023-03-18 20:21:02] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:21:02] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:21:02] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-18 20:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2023-03-18 20:21:03] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-18 20:21:03] [INFO ] Deduced a trap composed of 15 places in 807 ms of which 1 ms to minimize.
[2023-03-18 20:21:04] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2023-03-18 20:21:04] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-18 20:21:04] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-18 20:21:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1613 ms
[2023-03-18 20:21:04] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2023-03-18 20:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-18 20:21:04] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-18 20:21:05] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2023-03-18 20:21:05] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2023-03-18 20:21:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-18 20:21:05] [INFO ] After 3710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-18 20:21:05] [INFO ] After 4290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 192 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 72 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 68 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-18 20:21:06] [INFO ] Invariant cache hit.
[2023-03-18 20:21:07] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2023-03-18 20:21:07] [INFO ] Invariant cache hit.
[2023-03-18 20:21:09] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2921 ms to find 0 implicit places.
[2023-03-18 20:21:09] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-18 20:21:09] [INFO ] Invariant cache hit.
[2023-03-18 20:21:09] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3932 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 68 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-18 20:21:10] [INFO ] Invariant cache hit.
[2023-03-18 20:21:10] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:21:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 51 ms returned sat
[2023-03-18 20:21:11] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:21:11] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-18 20:21:11] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2023-03-18 20:21:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-18 20:21:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 900 ms
[2023-03-18 20:21:12] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2023-03-18 20:21:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2023-03-18 20:21:13] [INFO ] After 3193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-18 20:21:14] [INFO ] After 3809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 21 factoid took 922 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 89 reset in 904 ms.
Product exploration explored 100000 steps with 92 reset in 1053 ms.
Built C files in :
/tmp/ltsmin759284268297881602
[2023-03-18 20:21:17] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin759284268297881602
Running compilation step : cd /tmp/ltsmin759284268297881602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin759284268297881602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin759284268297881602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 374 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:21:21] [INFO ] Computed 401 place invariants in 30 ms
[2023-03-18 20:21:22] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2023-03-18 20:21:22] [INFO ] Invariant cache hit.
[2023-03-18 20:21:23] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2023-03-18 20:21:23] [INFO ] Invariant cache hit.
[2023-03-18 20:21:25] [INFO ] Dead Transitions using invariants and state equation in 2484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4863 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Built C files in :
/tmp/ltsmin16356645412065540962
[2023-03-18 20:21:25] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16356645412065540962
Running compilation step : cd /tmp/ltsmin16356645412065540962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16356645412065540962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16356645412065540962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:21:29] [INFO ] Flatten gal took : 129 ms
[2023-03-18 20:21:29] [INFO ] Flatten gal took : 132 ms
[2023-03-18 20:21:29] [INFO ] Time to serialize gal into /tmp/LTL13165790017744284783.gal : 31 ms
[2023-03-18 20:21:29] [INFO ] Time to serialize properties into /tmp/LTL8235220753952285455.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13165790017744284783.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10420690618651258854.hoa' '-atoms' '/tmp/LTL8235220753952285455.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8235220753952285455.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10420690618651258854.hoa
Detected timeout of ITS tools.
[2023-03-18 20:21:44] [INFO ] Flatten gal took : 109 ms
[2023-03-18 20:21:44] [INFO ] Flatten gal took : 120 ms
[2023-03-18 20:21:44] [INFO ] Time to serialize gal into /tmp/LTL17041603487694652938.gal : 19 ms
[2023-03-18 20:21:44] [INFO ] Time to serialize properties into /tmp/LTL13438866922722139339.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17041603487694652938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13438866922722139339.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X("((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))"))&&(("(p2157==1)")U(G("(p2124!=1)"))))))
Formula 0 simplified : G(X!"((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))" | (!"(p2157==1)" R F!"(p2124!=1)"))
Detected timeout of ITS tools.
[2023-03-18 20:22:00] [INFO ] Flatten gal took : 128 ms
[2023-03-18 20:22:00] [INFO ] Applying decomposition
[2023-03-18 20:22:00] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6770229916526662757.txt' '-o' '/tmp/graph6770229916526662757.bin' '-w' '/tmp/graph6770229916526662757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6770229916526662757.bin' '-l' '-1' '-v' '-w' '/tmp/graph6770229916526662757.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:22:00] [INFO ] Decomposing Gal with order
[2023-03-18 20:22:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:22:02] [INFO ] Removed a total of 3591 redundant transitions.
[2023-03-18 20:22:02] [INFO ] Flatten gal took : 553 ms
[2023-03-18 20:22:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2023-03-18 20:22:02] [INFO ] Time to serialize gal into /tmp/LTL6151345861260537767.gal : 100 ms
[2023-03-18 20:22:02] [INFO ] Time to serialize properties into /tmp/LTL10818307105888879764.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6151345861260537767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10818307105888879764.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X("((((i23.i1.i3.u973.p3112==0)||(i24.u986.p3156==0))||((i24.u993.p3181==0)||(i13.i0.i1.u534.p1688==0)))||((i13.i0.i1.u536.p1696...260
Formula 0 simplified : G(X!"((((i23.i1.i3.u973.p3112==0)||(i24.u986.p3156==0))||((i24.u993.p3181==0)||(i13.i0.i1.u534.p1688==0)))||((i13.i0.i1.u536.p1696==...253
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10091420671950561443
[2023-03-18 20:22:17] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10091420671950561443
Running compilation step : cd /tmp/ltsmin10091420671950561443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10091420671950561443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10091420671950561443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-00 finished in 182114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3304 transition count 3804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3304 transition count 3804
Applied a total of 26 rules in 576 ms. Remains 3304 /3317 variables (removed 13) and now considering 3804/3817 (removed 13) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2023-03-18 20:22:21] [INFO ] Computed 401 place invariants in 21 ms
[2023-03-18 20:22:22] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-18 20:22:22] [INFO ] Invariant cache hit.
[2023-03-18 20:22:23] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2023-03-18 20:22:23] [INFO ] Invariant cache hit.
[2023-03-18 20:22:25] [INFO ] Dead Transitions using invariants and state equation in 2277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3304/3317 places, 3804/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4676 ms. Remains : 3304/3317 places, 3804/3817 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s2604 1), p1:(NEQ s2932 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1658 ms.
Product exploration explored 100000 steps with 50000 reset in 1650 ms.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLFireability-03 finished in 8387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3302 transition count 3802
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3302 transition count 3802
Applied a total of 30 rules in 389 ms. Remains 3302 /3317 variables (removed 15) and now considering 3802/3817 (removed 15) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2023-03-18 20:22:29] [INFO ] Computed 401 place invariants in 26 ms
[2023-03-18 20:22:30] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-18 20:22:30] [INFO ] Invariant cache hit.
[2023-03-18 20:22:34] [INFO ] Implicit Places using invariants and state equation in 4173 ms returned []
Implicit Place search using SMT with State Equation took 5165 ms to find 0 implicit places.
[2023-03-18 20:22:34] [INFO ] Invariant cache hit.
[2023-03-18 20:22:37] [INFO ] Dead Transitions using invariants and state equation in 2142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3317 places, 3802/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7701 ms. Remains : 3302/3317 places, 3802/3817 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s3289 1) (NEQ s3298 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 76470 steps with 18 reset in 592 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-04 finished in 8422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 3317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2916 transition count 3416
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2916 transition count 2916
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2416 transition count 2916
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1815 place count 2401 transition count 2901
Iterating global reduction 2 with 15 rules applied. Total rules applied 1830 place count 2401 transition count 2901
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1830 place count 2401 transition count 2896
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1840 place count 2396 transition count 2896
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 8 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 2 with 1982 rules applied. Total rules applied 3822 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3824 place count 1403 transition count 1903
Applied a total of 3824 rules in 841 ms. Remains 1403 /3317 variables (removed 1914) and now considering 1903/3817 (removed 1914) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2023-03-18 20:22:38] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-18 20:22:39] [INFO ] Implicit Places using invariants in 671 ms returned []
[2023-03-18 20:22:39] [INFO ] Invariant cache hit.
[2023-03-18 20:22:40] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2023-03-18 20:22:41] [INFO ] Redundant transitions in 409 ms returned [1902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2023-03-18 20:22:41] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-18 20:22:42] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3317 places, 1902/3817 transitions.
Applied a total of 0 rules in 62 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4320 ms. Remains : 1403/3317 places, 1902/3817 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s516 0) (EQ s519 0) (EQ s528 0)), p1:(EQ s238 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 75 reset in 973 ms.
Product exploration explored 100000 steps with 75 reset in 1140 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 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 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:22:44] [INFO ] Invariant cache hit.
[2023-03-18 20:22:45] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:22:45] [INFO ] [Nat]Absence check using 401 positive place invariants in 109 ms returned sat
[2023-03-18 20:22:46] [INFO ] After 880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:22:46] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-18 20:22:46] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-18 20:22:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1166 ms
[2023-03-18 20:22:47] [INFO ] After 2109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-18 20:22:47] [INFO ] After 2566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 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 1403 transition count 1902
Applied a total of 200 rules in 170 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37534 steps, run visited all 1 properties in 555 ms. (steps per millisecond=67 )
Probabilistic random walk after 37534 steps, saw 36473 distinct states, run finished after 555 ms. (steps per millisecond=67 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 287 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 76 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-18 20:22:49] [INFO ] Invariant cache hit.
[2023-03-18 20:22:50] [INFO ] Implicit Places using invariants in 861 ms returned []
[2023-03-18 20:22:50] [INFO ] Invariant cache hit.
[2023-03-18 20:22:51] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
[2023-03-18 20:22:52] [INFO ] Redundant transitions in 438 ms returned []
[2023-03-18 20:22:52] [INFO ] Invariant cache hit.
[2023-03-18 20:22:53] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3846 ms. Remains : 1403/1403 places, 1902/1902 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:22:53] [INFO ] Invariant cache hit.
[2023-03-18 20:22:53] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:22:54] [INFO ] [Nat]Absence check using 401 positive place invariants in 58 ms returned sat
[2023-03-18 20:22:54] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:22:54] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-18 20:22:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 834 ms
[2023-03-18 20:22:55] [INFO ] After 1506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-18 20:22:55] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 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 1403 transition count 1902
Applied a total of 200 rules in 123 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37534 steps, run visited all 1 properties in 458 ms. (steps per millisecond=81 )
Probabilistic random walk after 37534 steps, saw 36473 distinct states, run finished after 460 ms. (steps per millisecond=81 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 259 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 75 reset in 788 ms.
Product exploration explored 100000 steps with 75 reset in 1036 ms.
Built C files in :
/tmp/ltsmin11986964865371069751
[2023-03-18 20:22:58] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:22:58] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11986964865371069751
Running compilation step : cd /tmp/ltsmin11986964865371069751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11986964865371069751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11986964865371069751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 116 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-18 20:23:02] [INFO ] Invariant cache hit.
[2023-03-18 20:23:02] [INFO ] Implicit Places using invariants in 617 ms returned []
[2023-03-18 20:23:02] [INFO ] Invariant cache hit.
[2023-03-18 20:23:04] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
[2023-03-18 20:23:04] [INFO ] Redundant transitions in 278 ms returned []
[2023-03-18 20:23:04] [INFO ] Invariant cache hit.
[2023-03-18 20:23:05] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3353 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Built C files in :
/tmp/ltsmin3727355301861929102
[2023-03-18 20:23:05] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:23:05] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3727355301861929102
Running compilation step : cd /tmp/ltsmin3727355301861929102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3727355301861929102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3727355301861929102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:23:08] [INFO ] Flatten gal took : 64 ms
[2023-03-18 20:23:08] [INFO ] Flatten gal took : 64 ms
[2023-03-18 20:23:08] [INFO ] Time to serialize gal into /tmp/LTL1493627139891887671.gal : 14 ms
[2023-03-18 20:23:08] [INFO ] Time to serialize properties into /tmp/LTL17596317690559090545.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1493627139891887671.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10413497835581471438.hoa' '-atoms' '/tmp/LTL17596317690559090545.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17596317690559090545.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10413497835581471438.hoa
Detected timeout of ITS tools.
[2023-03-18 20:23:23] [INFO ] Flatten gal took : 62 ms
[2023-03-18 20:23:23] [INFO ] Flatten gal took : 59 ms
[2023-03-18 20:23:23] [INFO ] Time to serialize gal into /tmp/LTL3807538632430133398.gal : 11 ms
[2023-03-18 20:23:23] [INFO ] Time to serialize properties into /tmp/LTL17962392942883402365.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3807538632430133398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17962392942883402365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p1532==0)||(p1540==0))")||(("(p1566==0)")||(F("(p760==0)")))))))
Formula 0 simplified : G(F(!"((p1532==0)||(p1540==0))" & !"(p1566==0)") & FG!"(p760==0)")
Detected timeout of ITS tools.
[2023-03-18 20:23:39] [INFO ] Flatten gal took : 85 ms
[2023-03-18 20:23:39] [INFO ] Applying decomposition
[2023-03-18 20:23:39] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13534192242573312179.txt' '-o' '/tmp/graph13534192242573312179.bin' '-w' '/tmp/graph13534192242573312179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13534192242573312179.bin' '-l' '-1' '-v' '-w' '/tmp/graph13534192242573312179.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:23:39] [INFO ] Decomposing Gal with order
[2023-03-18 20:23:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:23:39] [INFO ] Removed a total of 2101 redundant transitions.
[2023-03-18 20:23:39] [INFO ] Flatten gal took : 116 ms
[2023-03-18 20:23:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2328 labels/synchronizations in 38 ms.
[2023-03-18 20:23:39] [INFO ] Time to serialize gal into /tmp/LTL1349525713793515913.gal : 13 ms
[2023-03-18 20:23:39] [INFO ] Time to serialize properties into /tmp/LTL9176160487825136331.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1349525713793515913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9176160487825136331.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i7.u147.p1532==0)||(i7.u149.p1540==0))")||(("(i7.u152.p1566==0)")||(F("(i3.i0.i1.u68.p760==0)")))))))
Formula 0 simplified : G(F(!"((i7.u147.p1532==0)||(i7.u149.p1540==0))" & !"(i7.u152.p1566==0)") & FG!"(i3.i0.i1.u68.p760==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11834244907471122633
[2023-03-18 20:23:54] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11834244907471122633
Running compilation step : cd /tmp/ltsmin11834244907471122633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11834244907471122633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11834244907471122633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-05 finished in 79940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 3317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3316 transition count 3415
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2915 transition count 3415
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 802 place count 2915 transition count 2915
Deduced a syphon composed of 500 places in 11 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1802 place count 2415 transition count 2915
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1816 place count 2401 transition count 2901
Iterating global reduction 2 with 14 rules applied. Total rules applied 1830 place count 2401 transition count 2901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1830 place count 2401 transition count 2897
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1838 place count 2397 transition count 2897
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 6 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 2 with 1986 rules applied. Total rules applied 3824 place count 1404 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3826 place count 1402 transition count 1902
Applied a total of 3826 rules in 792 ms. Remains 1402 /3317 variables (removed 1915) and now considering 1902/3817 (removed 1915) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-18 20:23:58] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-18 20:23:59] [INFO ] Implicit Places using invariants in 747 ms returned []
[2023-03-18 20:23:59] [INFO ] Invariant cache hit.
[2023-03-18 20:24:00] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2023-03-18 20:24:01] [INFO ] Redundant transitions in 300 ms returned [1901]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2023-03-18 20:24:01] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-18 20:24:01] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/3317 places, 1901/3817 transitions.
Applied a total of 0 rules in 51 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4218 ms. Remains : 1402/3317 places, 1901/3817 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-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:(AND (EQ s369 1) (EQ s371 1) (EQ s375 1) (EQ s418 0))], 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 1325 steps with 0 reset in 15 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-06 finished in 4335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 400 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:24:02] [INFO ] Computed 401 place invariants in 28 ms
[2023-03-18 20:24:03] [INFO ] Implicit Places using invariants in 933 ms returned []
[2023-03-18 20:24:03] [INFO ] Invariant cache hit.
[2023-03-18 20:24:05] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
[2023-03-18 20:24:05] [INFO ] Invariant cache hit.
[2023-03-18 20:24:08] [INFO ] Dead Transitions using invariants and state equation in 2474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6088 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s2665 0) (EQ s3220 0)), p0:(EQ s2534 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 191 reset in 698 ms.
Product exploration explored 100000 steps with 187 reset in 758 ms.
Computed a total of 800 stabilizing places and 800 stable transitions
Computed a total of 800 stabilizing places and 800 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 267 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 246 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
[2023-03-18 20:24:10] [INFO ] Invariant cache hit.
[2023-03-18 20:24:11] [INFO ] Implicit Places using invariants in 965 ms returned []
[2023-03-18 20:24:11] [INFO ] Invariant cache hit.
[2023-03-18 20:24:16] [INFO ] Implicit Places using invariants and state equation in 4566 ms returned []
Implicit Place search using SMT with State Equation took 5547 ms to find 0 implicit places.
[2023-03-18 20:24:16] [INFO ] Invariant cache hit.
[2023-03-18 20:24:18] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7903 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Computed a total of 800 stabilizing places and 800 stable transitions
Computed a total of 800 stabilizing places and 800 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 371 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 192 reset in 534 ms.
Product exploration explored 100000 steps with 189 reset in 568 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 3303 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 398 place count 3303 transition count 3902
Deduced a syphon composed of 599 places in 12 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 599 place count 3303 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 600 place count 3302 transition count 3901
Deduced a syphon composed of 598 places in 13 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 601 place count 3302 transition count 3901
Performed 1297 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1895 places in 9 ms
Iterating global reduction 1 with 1297 rules applied. Total rules applied 1898 place count 3302 transition count 3901
Renaming transitions due to excessive name length > 1024 char.
Discarding 697 places :
Symmetric choice reduction at 1 with 697 rule applications. Total rules 2595 place count 2605 transition count 3204
Deduced a syphon composed of 1198 places in 8 ms
Iterating global reduction 1 with 697 rules applied. Total rules applied 3292 place count 2605 transition count 3204
Deduced a syphon composed of 1198 places in 8 ms
Applied a total of 3292 rules in 2205 ms. Remains 2605 /3303 variables (removed 698) and now considering 3204/3803 (removed 599) transitions.
[2023-03-18 20:24:23] [INFO ] Redundant transitions in 491 ms returned [3203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 3203 rows 2605 cols
[2023-03-18 20:24:23] [INFO ] Computed 401 place invariants in 54 ms
[2023-03-18 20:24:25] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2605/3303 places, 3203/3803 transitions.
Deduced a syphon composed of 1198 places in 7 ms
Applied a total of 0 rules in 112 ms. Remains 2605 /2605 variables (removed 0) and now considering 3203/3203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4523 ms. Remains : 2605/3303 places, 3203/3803 transitions.
Built C files in :
/tmp/ltsmin886099003563372679
[2023-03-18 20:24:25] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin886099003563372679
Running compilation step : cd /tmp/ltsmin886099003563372679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin886099003563372679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin886099003563372679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 261 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:24:28] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-18 20:24:29] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-18 20:24:29] [INFO ] Invariant cache hit.
[2023-03-18 20:24:34] [INFO ] Implicit Places using invariants and state equation in 4486 ms returned []
Implicit Place search using SMT with State Equation took 5482 ms to find 0 implicit places.
[2023-03-18 20:24:34] [INFO ] Invariant cache hit.
[2023-03-18 20:24:36] [INFO ] Dead Transitions using invariants and state equation in 2461 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8205 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Built C files in :
/tmp/ltsmin2424338178374143175
[2023-03-18 20:24:36] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2424338178374143175
Running compilation step : cd /tmp/ltsmin2424338178374143175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2424338178374143175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2424338178374143175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:24:39] [INFO ] Flatten gal took : 87 ms
[2023-03-18 20:24:39] [INFO ] Flatten gal took : 88 ms
[2023-03-18 20:24:39] [INFO ] Time to serialize gal into /tmp/LTL1654125536423357663.gal : 14 ms
[2023-03-18 20:24:39] [INFO ] Time to serialize properties into /tmp/LTL15260202525650713326.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1654125536423357663.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16612135003913835468.hoa' '-atoms' '/tmp/LTL15260202525650713326.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15260202525650713326.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16612135003913835468.hoa
Detected timeout of ITS tools.
[2023-03-18 20:24:55] [INFO ] Flatten gal took : 80 ms
[2023-03-18 20:24:55] [INFO ] Flatten gal took : 77 ms
[2023-03-18 20:24:55] [INFO ] Time to serialize gal into /tmp/LTL17800727524611397768.gal : 17 ms
[2023-03-18 20:24:55] [INFO ] Time to serialize properties into /tmp/LTL4277808548843747290.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17800727524611397768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4277808548843747290.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p3065==1)")||(G("((p3225==0)&&(p3901==0))"))))))
Formula 0 simplified : XG(!"(p3065==1)" & F!"((p3225==0)&&(p3901==0))")
Detected timeout of ITS tools.
[2023-03-18 20:25:10] [INFO ] Flatten gal took : 133 ms
[2023-03-18 20:25:10] [INFO ] Applying decomposition
[2023-03-18 20:25:10] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16579134623155986475.txt' '-o' '/tmp/graph16579134623155986475.bin' '-w' '/tmp/graph16579134623155986475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16579134623155986475.bin' '-l' '-1' '-v' '-w' '/tmp/graph16579134623155986475.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:25:10] [INFO ] Decomposing Gal with order
[2023-03-18 20:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:25:11] [INFO ] Removed a total of 3591 redundant transitions.
[2023-03-18 20:25:11] [INFO ] Flatten gal took : 135 ms
[2023-03-18 20:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-18 20:25:11] [INFO ] Time to serialize gal into /tmp/LTL10358517028682739132.gal : 25 ms
[2023-03-18 20:25:11] [INFO ] Time to serialize properties into /tmp/LTL5032820094056655941.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10358517028682739132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5032820094056655941.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i23.i0.i1.u955.p3065==1)")||(G("((i24.u1005.p3225==0)&&(i29.u1213.p3901==0))"))))))
Formula 0 simplified : XG(!"(i23.i0.i1.u955.p3065==1)" & F!"((i24.u1005.p3225==0)&&(i29.u1213.p3901==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10675055868102483633
[2023-03-18 20:25:26] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10675055868102483633
Running compilation step : cd /tmp/ltsmin10675055868102483633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10675055868102483633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10675055868102483633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-07 finished in 87759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(X(p2)))))))'
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 494 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:25:30] [INFO ] Computed 401 place invariants in 12 ms
[2023-03-18 20:25:31] [INFO ] Implicit Places using invariants in 959 ms returned []
[2023-03-18 20:25:31] [INFO ] Invariant cache hit.
[2023-03-18 20:25:35] [INFO ] Implicit Places using invariants and state equation in 3883 ms returned []
Implicit Place search using SMT with State Equation took 4858 ms to find 0 implicit places.
[2023-03-18 20:25:35] [INFO ] Invariant cache hit.
[2023-03-18 20:25:37] [INFO ] Dead Transitions using invariants and state equation in 2110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7475 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(AND (EQ s700 1) (EQ s709 1) (EQ s728 1)), p1:(EQ s1838 1), p2:(EQ s2044 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 25713 steps with 10 reset in 160 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-08 finished in 7754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(F(p1))&&(p2 U (p3||G(p2)))))))'
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 401 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:25:38] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-18 20:25:38] [INFO ] Implicit Places using invariants in 827 ms returned []
[2023-03-18 20:25:38] [INFO ] Invariant cache hit.
[2023-03-18 20:25:42] [INFO ] Implicit Places using invariants and state equation in 3422 ms returned []
Implicit Place search using SMT with State Equation took 4278 ms to find 0 implicit places.
[2023-03-18 20:25:42] [INFO ] Invariant cache hit.
[2023-03-18 20:25:44] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6745 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3182 1) (EQ s3216 1) (EQ s3237 1)), p3:(AND (NEQ s2256 1) (NEQ s1490 1)), p2:(NEQ s1490 1), p1:(OR (EQ s3182 0) (EQ s3216 0) (EQ s3237 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1102 ms.
Product exploration explored 100000 steps with 33333 reset in 1407 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), true, (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 8 factoid took 207 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLFireability-09 finished in 9677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2916 transition count 3416
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2916 transition count 2916
Deduced a syphon composed of 500 places in 11 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2416 transition count 2916
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1813 place count 2403 transition count 2903
Iterating global reduction 2 with 13 rules applied. Total rules applied 1826 place count 2403 transition count 2903
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1826 place count 2403 transition count 2900
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1832 place count 2400 transition count 2900
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 994
Deduced a syphon composed of 994 places in 6 ms
Reduce places removed 994 places and 0 transitions.
Iterating global reduction 2 with 1988 rules applied. Total rules applied 3820 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3822 place count 1404 transition count 1904
Applied a total of 3822 rules in 742 ms. Remains 1404 /3317 variables (removed 1913) and now considering 1904/3817 (removed 1913) transitions.
// Phase 1: matrix 1904 rows 1404 cols
[2023-03-18 20:25:47] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-18 20:25:48] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-18 20:25:48] [INFO ] Invariant cache hit.
[2023-03-18 20:25:50] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
[2023-03-18 20:25:50] [INFO ] Redundant transitions in 269 ms returned [1903]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2023-03-18 20:25:50] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-18 20:25:51] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/3317 places, 1903/3817 transitions.
Applied a total of 0 rules in 49 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3883 ms. Remains : 1404/3317 places, 1903/3817 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1044 1), p1:(EQ s884 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1368 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-11 finished in 3986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 4 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3302 transition count 3802
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3302 transition count 3802
Applied a total of 30 rules in 325 ms. Remains 3302 /3317 variables (removed 15) and now considering 3802/3817 (removed 15) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2023-03-18 20:25:51] [INFO ] Computed 401 place invariants in 25 ms
[2023-03-18 20:25:52] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-18 20:25:52] [INFO ] Invariant cache hit.
[2023-03-18 20:25:56] [INFO ] Implicit Places using invariants and state equation in 3665 ms returned []
Implicit Place search using SMT with State Equation took 4558 ms to find 0 implicit places.
[2023-03-18 20:25:56] [INFO ] Invariant cache hit.
[2023-03-18 20:25:58] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3317 places, 3802/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7016 ms. Remains : 3302/3317 places, 3802/3817 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1153 1), p0:(AND (EQ s2157 1) (EQ s2193 1) (EQ s2212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-12 finished in 7162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1 U (p2||G(p1))) U p3)))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 401 rules applied. Total rules applied 801 place count 2916 transition count 3415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 802 place count 2915 transition count 3415
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 802 place count 2915 transition count 2916
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1800 place count 2416 transition count 2916
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1812 place count 2404 transition count 2904
Iterating global reduction 3 with 12 rules applied. Total rules applied 1824 place count 2404 transition count 2904
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1824 place count 2404 transition count 2899
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1834 place count 2399 transition count 2899
Performed 990 Post agglomeration using F-continuation condition.Transition count delta: 990
Deduced a syphon composed of 990 places in 6 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 3 with 1980 rules applied. Total rules applied 3814 place count 1409 transition count 1909
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3816 place count 1407 transition count 1907
Applied a total of 3816 rules in 733 ms. Remains 1407 /3317 variables (removed 1910) and now considering 1907/3817 (removed 1910) transitions.
// Phase 1: matrix 1907 rows 1407 cols
[2023-03-18 20:25:59] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-18 20:25:59] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-18 20:25:59] [INFO ] Invariant cache hit.
[2023-03-18 20:26:01] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2023-03-18 20:26:01] [INFO ] Redundant transitions in 287 ms returned [1906]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1906 rows 1407 cols
[2023-03-18 20:26:01] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-18 20:26:02] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1407/3317 places, 1906/3817 transitions.
Applied a total of 0 rules in 61 ms. Remains 1407 /1407 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3937 ms. Remains : 1407/3317 places, 1906/3817 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s177 1), p0:(EQ s67 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 76 reset in 765 ms.
Product exploration explored 100000 steps with 76 reset in 917 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1407 stabilizing places and 4/1906 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 5166 steps, including 3 resets, run visited all 1 properties in 39 ms. (steps per millisecond=132 )
Knowledge obtained : [(AND (NOT p3) p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 1407 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1407/1407 places, 1906/1906 transitions.
Applied a total of 0 rules in 73 ms. Remains 1407 /1407 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-18 20:26:04] [INFO ] Invariant cache hit.
[2023-03-18 20:26:05] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-18 20:26:05] [INFO ] Invariant cache hit.
[2023-03-18 20:26:06] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2023-03-18 20:26:07] [INFO ] Redundant transitions in 260 ms returned []
[2023-03-18 20:26:07] [INFO ] Invariant cache hit.
[2023-03-18 20:26:07] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3184 ms. Remains : 1407/1407 places, 1906/1906 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1407 stabilizing places and 4/1906 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 2622 steps, including 1 resets, run visited all 1 properties in 24 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 76 reset in 1017 ms.
Product exploration explored 100000 steps with 76 reset in 1008 ms.
Built C files in :
/tmp/ltsmin12259262623836684711
[2023-03-18 20:26:10] [INFO ] Too many transitions (1906) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:26:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12259262623836684711
Running compilation step : cd /tmp/ltsmin12259262623836684711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12259262623836684711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12259262623836684711;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1407/1407 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1405 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1404 transition count 1903
Applied a total of 3 rules in 245 ms. Remains 1404 /1407 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2023-03-18 20:26:13] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-18 20:26:14] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-18 20:26:14] [INFO ] Invariant cache hit.
[2023-03-18 20:26:15] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2023-03-18 20:26:16] [INFO ] Redundant transitions in 396 ms returned []
[2023-03-18 20:26:16] [INFO ] Invariant cache hit.
[2023-03-18 20:26:17] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/1407 places, 1903/1906 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3435 ms. Remains : 1404/1407 places, 1903/1906 transitions.
Built C files in :
/tmp/ltsmin4698891849244954332
[2023-03-18 20:26:17] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:26:17] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4698891849244954332
Running compilation step : cd /tmp/ltsmin4698891849244954332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4698891849244954332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4698891849244954332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:26:20] [INFO ] Flatten gal took : 81 ms
[2023-03-18 20:26:20] [INFO ] Flatten gal took : 62 ms
[2023-03-18 20:26:20] [INFO ] Time to serialize gal into /tmp/LTL16853951470784486882.gal : 10 ms
[2023-03-18 20:26:20] [INFO ] Time to serialize properties into /tmp/LTL93625528159361346.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16853951470784486882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11139312863940846185.hoa' '-atoms' '/tmp/LTL93625528159361346.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL93625528159361346.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11139312863940846185.hoa
Detected timeout of ITS tools.
[2023-03-18 20:26:35] [INFO ] Flatten gal took : 86 ms
[2023-03-18 20:26:35] [INFO ] Flatten gal took : 69 ms
[2023-03-18 20:26:35] [INFO ] Time to serialize gal into /tmp/LTL16552829451887918455.gal : 11 ms
[2023-03-18 20:26:35] [INFO ] Time to serialize properties into /tmp/LTL16124714898146994971.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16552829451887918455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16124714898146994971.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p280==0)")||((("(p3920!=1)")U(("((p1702!=1)&&(p3920!=1))")||(G("(p3920!=1)"))))U("(p585==1)"))))))
Formula 0 simplified : FG(!"(p280==0)" & ((!"(p3920!=1)" M !"((p1702!=1)&&(p3920!=1))") R !"(p585==1)"))
Detected timeout of ITS tools.
[2023-03-18 20:26:50] [INFO ] Flatten gal took : 97 ms
[2023-03-18 20:26:50] [INFO ] Applying decomposition
[2023-03-18 20:26:50] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5006609682671357688.txt' '-o' '/tmp/graph5006609682671357688.bin' '-w' '/tmp/graph5006609682671357688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5006609682671357688.bin' '-l' '-1' '-v' '-w' '/tmp/graph5006609682671357688.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:26:51] [INFO ] Decomposing Gal with order
[2023-03-18 20:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:26:51] [INFO ] Removed a total of 2095 redundant transitions.
[2023-03-18 20:26:51] [INFO ] Flatten gal took : 102 ms
[2023-03-18 20:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2300 labels/synchronizations in 53 ms.
[2023-03-18 20:26:51] [INFO ] Time to serialize gal into /tmp/LTL5330727950767594219.gal : 14 ms
[2023-03-18 20:26:51] [INFO ] Time to serialize properties into /tmp/LTL10001649738659712136.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5330727950767594219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10001649738659712136.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.i1.i1.u19.p280==0)")||((("(i20.i1.i0.u392.p3920!=1)")U(("((i8.i0.i0.u166.p1702!=1)&&(i20.i1.i0.u392.p3920!=1))")||(G("(i2...214
Formula 0 simplified : FG(!"(i0.i1.i1.u19.p280==0)" & ((!"(i20.i1.i0.u392.p3920!=1)" M !"((i8.i0.i0.u166.p1702!=1)&&(i20.i1.i0.u392.p3920!=1))") R !"(i2.i0...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15556182565297833308
[2023-03-18 20:27:06] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15556182565297833308
Running compilation step : cd /tmp/ltsmin15556182565297833308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15556182565297833308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15556182565297833308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-13 finished in 71106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||X(F(p2))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 495 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-18 20:27:10] [INFO ] Computed 401 place invariants in 17 ms
[2023-03-18 20:27:10] [INFO ] Implicit Places using invariants in 942 ms returned []
[2023-03-18 20:27:10] [INFO ] Invariant cache hit.
[2023-03-18 20:27:15] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 5082 ms to find 0 implicit places.
[2023-03-18 20:27:15] [INFO ] Invariant cache hit.
[2023-03-18 20:27:17] [INFO ] Dead Transitions using invariants and state equation in 2291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7872 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2883 1), p1:(EQ s2883 0), p2:(EQ s2964 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 129 reset in 567 ms.
Stuttering criterion allowed to conclude after 45843 steps with 53 reset in 257 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-14 finished in 8827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1||F(p2))))))'
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3304 transition count 3804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3304 transition count 3804
Applied a total of 26 rules in 467 ms. Remains 3304 /3317 variables (removed 13) and now considering 3804/3817 (removed 13) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2023-03-18 20:27:18] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-18 20:27:19] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-18 20:27:19] [INFO ] Invariant cache hit.
[2023-03-18 20:27:20] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2023-03-18 20:27:20] [INFO ] Invariant cache hit.
[2023-03-18 20:27:22] [INFO ] Dead Transitions using invariants and state equation in 2075 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3304/3317 places, 3804/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4609 ms. Remains : 3304/3317 places, 3804/3817 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1778 1) (EQ s1781 1) (EQ s1788 1)), p2:(EQ s1619 1), p0:(EQ s2776 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 75 reset in 563 ms.
Product exploration explored 100000 steps with 74 reset in 839 ms.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 521 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :6
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.
[2023-03-18 20:27:25] [INFO ] Invariant cache hit.
[2023-03-18 20:27:26] [INFO ] [Real]Absence check using 401 positive place invariants in 229 ms returned sat
[2023-03-18 20:27:26] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:27:26] [INFO ] [Nat]Absence check using 401 positive place invariants in 157 ms returned sat
[2023-03-18 20:27:28] [INFO ] After 1730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:27:29] [INFO ] Deduced a trap composed of 14 places in 1113 ms of which 2 ms to minimize.
[2023-03-18 20:27:30] [INFO ] Deduced a trap composed of 34 places in 988 ms of which 2 ms to minimize.
[2023-03-18 20:27:32] [INFO ] Deduced a trap composed of 16 places in 1077 ms of which 2 ms to minimize.
[2023-03-18 20:27:33] [INFO ] Deduced a trap composed of 47 places in 928 ms of which 2 ms to minimize.
[2023-03-18 20:27:34] [INFO ] Deduced a trap composed of 42 places in 1013 ms of which 2 ms to minimize.
[2023-03-18 20:27:35] [INFO ] Deduced a trap composed of 26 places in 996 ms of which 1 ms to minimize.
[2023-03-18 20:27:36] [INFO ] Deduced a trap composed of 18 places in 843 ms of which 1 ms to minimize.
[2023-03-18 20:27:37] [INFO ] Deduced a trap composed of 33 places in 840 ms of which 1 ms to minimize.
[2023-03-18 20:27:38] [INFO ] Deduced a trap composed of 29 places in 1051 ms of which 2 ms to minimize.
[2023-03-18 20:27:39] [INFO ] Deduced a trap composed of 26 places in 884 ms of which 2 ms to minimize.
[2023-03-18 20:27:40] [INFO ] Deduced a trap composed of 18 places in 849 ms of which 2 ms to minimize.
[2023-03-18 20:27:41] [INFO ] Deduced a trap composed of 31 places in 1024 ms of which 1 ms to minimize.
[2023-03-18 20:27:42] [INFO ] Deduced a trap composed of 29 places in 955 ms of which 2 ms to minimize.
[2023-03-18 20:27:43] [INFO ] Deduced a trap composed of 23 places in 868 ms of which 1 ms to minimize.
[2023-03-18 20:27:44] [INFO ] Deduced a trap composed of 40 places in 824 ms of which 1 ms to minimize.
[2023-03-18 20:27:45] [INFO ] Deduced a trap composed of 27 places in 906 ms of which 2 ms to minimize.
[2023-03-18 20:27:46] [INFO ] Deduced a trap composed of 31 places in 997 ms of which 2 ms to minimize.
[2023-03-18 20:27:47] [INFO ] Deduced a trap composed of 67 places in 1071 ms of which 1 ms to minimize.
[2023-03-18 20:27:48] [INFO ] Deduced a trap composed of 45 places in 891 ms of which 1 ms to minimize.
[2023-03-18 20:27:49] [INFO ] Deduced a trap composed of 40 places in 885 ms of which 1 ms to minimize.
[2023-03-18 20:27:50] [INFO ] Deduced a trap composed of 39 places in 888 ms of which 1 ms to minimize.
[2023-03-18 20:27:51] [INFO ] Deduced a trap composed of 40 places in 871 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:27:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:27:51] [INFO ] After 25463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3304 transition count 3404
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2904 transition count 3404
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 800 place count 2904 transition count 2905
Deduced a syphon composed of 499 places in 9 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1798 place count 2405 transition count 2905
Performed 999 Post agglomeration using F-continuation condition.Transition count delta: 999
Deduced a syphon composed of 999 places in 5 ms
Reduce places removed 999 places and 0 transitions.
Iterating global reduction 2 with 1998 rules applied. Total rules applied 3796 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 2 with 202 rules applied. Total rules applied 3998 place count 1406 transition count 1906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3999 place count 1405 transition count 1905
Applied a total of 3999 rules in 558 ms. Remains 1405 /3304 variables (removed 1899) and now considering 1905/3804 (removed 1899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 1405/3304 places, 1905/3804 transitions.
Finished random walk after 587 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 592 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-18 20:27:53] [INFO ] Invariant cache hit.
[2023-03-18 20:27:55] [INFO ] [Real]Absence check using 401 positive place invariants in 846 ms returned sat
[2023-03-18 20:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:28:08] [INFO ] [Real]Absence check using state equation in 12336 ms returned unknown
Could not prove EG (NOT p0)
[2023-03-18 20:28:08] [INFO ] Invariant cache hit.
[2023-03-18 20:28:11] [INFO ] [Real]Absence check using 401 positive place invariants in 871 ms returned sat
[2023-03-18 20:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:28:23] [INFO ] [Real]Absence check using state equation in 12105 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Applied a total of 0 rules in 160 ms. Remains 3304 /3304 variables (removed 0) and now considering 3804/3804 (removed 0) transitions.
[2023-03-18 20:28:23] [INFO ] Invariant cache hit.
[2023-03-18 20:28:24] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-18 20:28:24] [INFO ] Invariant cache hit.
[2023-03-18 20:28:28] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned []
Implicit Place search using SMT with State Equation took 4761 ms to find 0 implicit places.
[2023-03-18 20:28:28] [INFO ] Invariant cache hit.
[2023-03-18 20:28:30] [INFO ] Dead Transitions using invariants and state equation in 2381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7303 ms. Remains : 3304/3304 places, 3804/3804 transitions.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 402 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 2520 steps, including 0 resets, run visited all 7 properties in 52 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 509 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-18 20:28:32] [INFO ] Invariant cache hit.
[2023-03-18 20:28:34] [INFO ] [Real]Absence check using 401 positive place invariants in 723 ms returned sat
[2023-03-18 20:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:28:47] [INFO ] [Real]Absence check using state equation in 12448 ms returned unknown
Could not prove EG (NOT p0)
[2023-03-18 20:28:47] [INFO ] Invariant cache hit.
[2023-03-18 20:28:49] [INFO ] [Real]Absence check using 401 positive place invariants in 696 ms returned sat
[2023-03-18 20:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:29:02] [INFO ] [Real]Absence check using state equation in 12469 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 606 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 74 reset in 723 ms.
Product exploration explored 100000 steps with 74 reset in 633 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3304 transition count 3804
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 399 place count 3304 transition count 3903
Deduced a syphon composed of 600 places in 15 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 600 place count 3304 transition count 3903
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 601 place count 3303 transition count 3902
Deduced a syphon composed of 599 places in 15 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 602 place count 3303 transition count 3902
Performed 1298 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1897 places in 12 ms
Iterating global reduction 1 with 1298 rules applied. Total rules applied 1900 place count 3303 transition count 3902
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 2598 place count 2605 transition count 3204
Deduced a syphon composed of 1199 places in 10 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 3296 place count 2605 transition count 3204
Deduced a syphon composed of 1199 places in 11 ms
Applied a total of 3296 rules in 1989 ms. Remains 2605 /3304 variables (removed 699) and now considering 3204/3804 (removed 600) transitions.
[2023-03-18 20:29:07] [INFO ] Redundant transitions in 413 ms returned [3203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 3203 rows 2605 cols
[2023-03-18 20:29:07] [INFO ] Computed 401 place invariants in 54 ms
[2023-03-18 20:29:08] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2605/3304 places, 3203/3804 transitions.
Deduced a syphon composed of 1199 places in 11 ms
Applied a total of 0 rules in 138 ms. Remains 2605 /2605 variables (removed 0) and now considering 3203/3203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4383 ms. Remains : 2605/3304 places, 3203/3804 transitions.
Built C files in :
/tmp/ltsmin3721853849114648294
[2023-03-18 20:29:09] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3721853849114648294
Running compilation step : cd /tmp/ltsmin3721853849114648294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3721853849114648294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3721853849114648294;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Applied a total of 0 rules in 259 ms. Remains 3304 /3304 variables (removed 0) and now considering 3804/3804 (removed 0) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2023-03-18 20:29:12] [INFO ] Computed 401 place invariants in 9 ms
[2023-03-18 20:29:13] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-18 20:29:13] [INFO ] Invariant cache hit.
[2023-03-18 20:29:16] [INFO ] Implicit Places using invariants and state equation in 3648 ms returned []
Implicit Place search using SMT with State Equation took 4476 ms to find 0 implicit places.
[2023-03-18 20:29:16] [INFO ] Invariant cache hit.
[2023-03-18 20:29:18] [INFO ] Dead Transitions using invariants and state equation in 2101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6838 ms. Remains : 3304/3304 places, 3804/3804 transitions.
Built C files in :
/tmp/ltsmin12537908419204874696
[2023-03-18 20:29:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12537908419204874696
Running compilation step : cd /tmp/ltsmin12537908419204874696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12537908419204874696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12537908419204874696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:29:22] [INFO ] Flatten gal took : 79 ms
[2023-03-18 20:29:22] [INFO ] Flatten gal took : 78 ms
[2023-03-18 20:29:22] [INFO ] Time to serialize gal into /tmp/LTL17798037122785254273.gal : 12 ms
[2023-03-18 20:29:22] [INFO ] Time to serialize properties into /tmp/LTL2957398697673202792.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17798037122785254273.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1180790119603139423.hoa' '-atoms' '/tmp/LTL2957398697673202792.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2957398697673202792.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1180790119603139423.hoa
Detected timeout of ITS tools.
[2023-03-18 20:29:37] [INFO ] Flatten gal took : 76 ms
[2023-03-18 20:29:37] [INFO ] Flatten gal took : 77 ms
[2023-03-18 20:29:37] [INFO ] Time to serialize gal into /tmp/LTL11333938609677272192.gal : 11 ms
[2023-03-18 20:29:37] [INFO ] Time to serialize properties into /tmp/LTL7976139743410179587.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11333938609677272192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7976139743410179587.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(p3359==1)"))&&((F("(p1950==1)"))||("(((p2142==1)&&(p2147==1))&&(p2155==1))"))))))
Formula 0 simplified : XG(G!"(p3359==1)" | (!"(((p2142==1)&&(p2147==1))&&(p2155==1))" & G!"(p1950==1)"))
Detected timeout of ITS tools.
[2023-03-18 20:29:52] [INFO ] Flatten gal took : 93 ms
[2023-03-18 20:29:52] [INFO ] Applying decomposition
[2023-03-18 20:29:52] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15922139048091281155.txt' '-o' '/tmp/graph15922139048091281155.bin' '-w' '/tmp/graph15922139048091281155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15922139048091281155.bin' '-l' '-1' '-v' '-w' '/tmp/graph15922139048091281155.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:29:53] [INFO ] Decomposing Gal with order
[2023-03-18 20:29:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:29:53] [INFO ] Removed a total of 3591 redundant transitions.
[2023-03-18 20:29:53] [INFO ] Flatten gal took : 178 ms
[2023-03-18 20:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2023-03-18 20:29:53] [INFO ] Time to serialize gal into /tmp/LTL15375038418717346404.gal : 73 ms
[2023-03-18 20:29:53] [INFO ] Time to serialize properties into /tmp/LTL4195825049190504235.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15375038418717346404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4195825049190504235.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(i24.u1049.p3359==1)"))&&((F("(i13.i1.i1.u616.p1950==1)"))||("(((i15.u675.p2142==1)&&(i15.u676.p2147==1))&&(i15.u678.p2155=...166
Formula 0 simplified : XG(G!"(i24.u1049.p3359==1)" | (!"(((i15.u675.p2142==1)&&(i15.u676.p2147==1))&&(i15.u678.p2155==1))" & G!"(i13.i1.i1.u616.p1950==1)")...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13050865039605267015
[2023-03-18 20:30:08] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13050865039605267015
Running compilation step : cd /tmp/ltsmin13050865039605267015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13050865039605267015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13050865039605267015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-15 finished in 173605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U G(p2)))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-00
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Support contains 8 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 3316 transition count 3418
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 1 with 398 rules applied. Total rules applied 796 place count 2918 transition count 3418
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 796 place count 2918 transition count 2919
Deduced a syphon composed of 499 places in 10 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1794 place count 2419 transition count 2919
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1808 place count 2405 transition count 2905
Iterating global reduction 2 with 14 rules applied. Total rules applied 1822 place count 2405 transition count 2905
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1822 place count 2405 transition count 2901
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1830 place count 2401 transition count 2901
Performed 990 Post agglomeration using F-continuation condition.Transition count delta: 990
Deduced a syphon composed of 990 places in 8 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 2 with 1980 rules applied. Total rules applied 3810 place count 1411 transition count 1911
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3812 place count 1409 transition count 1909
Applied a total of 3812 rules in 877 ms. Remains 1409 /3317 variables (removed 1908) and now considering 1909/3817 (removed 1908) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:30:13] [INFO ] Computed 401 place invariants in 9 ms
[2023-03-18 20:30:13] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-18 20:30:13] [INFO ] Invariant cache hit.
[2023-03-18 20:30:15] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2023-03-18 20:30:15] [INFO ] Invariant cache hit.
[2023-03-18 20:30:15] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1409/3317 places, 1909/3817 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3702 ms. Remains : 1409/3317 places, 1909/3817 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s730 1), p1:(EQ s744 1), p0:(OR (EQ s1086 0) (EQ s1104 0) (EQ s1115 0) (EQ s572 0) (EQ s575 0) (EQ s584 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 507 reset in 757 ms.
Product exploration explored 100000 steps with 476 reset in 951 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 : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 17 factoid took 851 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 20:30:19] [INFO ] Invariant cache hit.
[2023-03-18 20:30:19] [INFO ] [Real]Absence check using 401 positive place invariants in 71 ms returned sat
[2023-03-18 20:30:19] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 20:30:19] [INFO ] [Nat]Absence check using 401 positive place invariants in 46 ms returned sat
[2023-03-18 20:30:20] [INFO ] After 763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 20:30:20] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:30:21] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1294 ms
[2023-03-18 20:30:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-18 20:30:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-18 20:30:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2023-03-18 20:30:23] [INFO ] After 3219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-18 20:30:23] [INFO ] After 3887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 349 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1409 transition count 1909
Applied a total of 201 rules in 159 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:30:24] [INFO ] Computed 401 place invariants in 5 ms
[2023-03-18 20:30:25] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:30:25] [INFO ] [Nat]Absence check using 401 positive place invariants in 62 ms returned sat
[2023-03-18 20:30:25] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-18 20:30:26] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-18 20:30:27] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-18 20:30:27] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-18 20:30:27] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-18 20:30:27] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-18 20:30:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1709 ms
[2023-03-18 20:30:27] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-18 20:30:28] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-18 20:30:28] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-03-18 20:30:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 655 ms
[2023-03-18 20:30:28] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-18 20:30:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-18 20:30:29] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-18 20:30:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 621 ms
[2023-03-18 20:30:29] [INFO ] After 4134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 450 ms.
[2023-03-18 20:30:29] [INFO ] After 4885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 177 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 81 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 126423 steps, run timeout after 3007 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126423 steps, saw 123187 distinct states, run finished after 3008 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 20:30:33] [INFO ] Invariant cache hit.
[2023-03-18 20:30:34] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:30:34] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2023-03-18 20:30:35] [INFO ] After 918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:30:35] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2023-03-18 20:30:35] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-18 20:30:35] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2023-03-18 20:30:35] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-18 20:30:36] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-18 20:30:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 721 ms
[2023-03-18 20:30:36] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-18 20:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-18 20:30:36] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-18 20:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-18 20:30:36] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-18 20:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-18 20:30:36] [INFO ] After 2482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 451 ms.
[2023-03-18 20:30:37] [INFO ] After 3342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 257 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 97 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 80 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-18 20:30:37] [INFO ] Invariant cache hit.
[2023-03-18 20:30:38] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-18 20:30:38] [INFO ] Invariant cache hit.
[2023-03-18 20:30:40] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2023-03-18 20:30:40] [INFO ] Redundant transitions in 110 ms returned []
[2023-03-18 20:30:40] [INFO ] Invariant cache hit.
[2023-03-18 20:30:40] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3173 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-18 20:30:40] [INFO ] Invariant cache hit.
[2023-03-18 20:30:41] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:30:41] [INFO ] [Nat]Absence check using 401 positive place invariants in 49 ms returned sat
[2023-03-18 20:30:42] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:30:42] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-18 20:30:42] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-18 20:30:42] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-18 20:30:42] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-18 20:30:42] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-18 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 580 ms
[2023-03-18 20:30:43] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2023-03-18 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-18 20:30:43] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-18 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-18 20:30:43] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-18 20:30:43] [INFO ] After 1954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-18 20:30:43] [INFO ] After 2590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 17 factoid took 1201 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 80 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:30:45] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-18 20:30:46] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-18 20:30:46] [INFO ] Invariant cache hit.
[2023-03-18 20:30:47] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
[2023-03-18 20:30:47] [INFO ] Invariant cache hit.
[2023-03-18 20:30:48] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2889 ms. Remains : 1409/1409 places, 1909/1909 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 : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 17 factoid took 819 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:30:50] [INFO ] Invariant cache hit.
[2023-03-18 20:30:50] [INFO ] [Real]Absence check using 401 positive place invariants in 46 ms returned sat
[2023-03-18 20:30:50] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:30:51] [INFO ] [Nat]Absence check using 401 positive place invariants in 47 ms returned sat
[2023-03-18 20:30:51] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-18 20:30:52] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-18 20:30:53] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2023-03-18 20:30:53] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-18 20:30:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1227 ms
[2023-03-18 20:30:53] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-18 20:30:53] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2023-03-18 20:30:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-18 20:30:53] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 5 ms to minimize.
[2023-03-18 20:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-18 20:30:53] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2023-03-18 20:30:54] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-18 20:30:54] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2023-03-18 20:30:54] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-18 20:30:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 629 ms
[2023-03-18 20:30:54] [INFO ] After 3750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-18 20:30:55] [INFO ] After 4647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 479 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1409 transition count 1909
Applied a total of 201 rules in 151 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:30:56] [INFO ] Computed 401 place invariants in 5 ms
[2023-03-18 20:30:57] [INFO ] [Real]Absence check using 401 positive place invariants in 48 ms returned sat
[2023-03-18 20:30:57] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 20:30:57] [INFO ] [Nat]Absence check using 401 positive place invariants in 47 ms returned sat
[2023-03-18 20:30:58] [INFO ] After 717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 20:30:58] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-18 20:30:58] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2023-03-18 20:30:58] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-18 20:30:58] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:30:58] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2023-03-18 20:30:58] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-18 20:30:59] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2023-03-18 20:30:59] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-18 20:30:59] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-18 20:30:59] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-18 20:30:59] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-18 20:31:00] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:31:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-18 20:31:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2206 ms
[2023-03-18 20:31:00] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2023-03-18 20:31:00] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-18 20:31:00] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2023-03-18 20:31:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 586 ms
[2023-03-18 20:31:01] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2023-03-18 20:31:01] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2023-03-18 20:31:01] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:31:02] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2023-03-18 20:31:02] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-18 20:31:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 937 ms
[2023-03-18 20:31:02] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-18 20:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-18 20:31:02] [INFO ] After 5133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-18 20:31:03] [INFO ] After 5930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 211 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 80 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 20:31:04] [INFO ] Invariant cache hit.
[2023-03-18 20:31:04] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:31:04] [INFO ] [Nat]Absence check using 401 positive place invariants in 48 ms returned sat
[2023-03-18 20:31:05] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:31:05] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2023-03-18 20:31:05] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2023-03-18 20:31:05] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2023-03-18 20:31:05] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-18 20:31:05] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
[2023-03-18 20:31:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 568 ms
[2023-03-18 20:31:06] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2023-03-18 20:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-18 20:31:06] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-18 20:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-18 20:31:06] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-18 20:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-18 20:31:06] [INFO ] After 1946ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-18 20:31:06] [INFO ] After 2489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 170 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 57 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 108695 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108695 steps, saw 106111 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 20:31:10] [INFO ] Invariant cache hit.
[2023-03-18 20:31:10] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:31:10] [INFO ] [Nat]Absence check using 401 positive place invariants in 48 ms returned sat
[2023-03-18 20:31:11] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:31:11] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-03-18 20:31:11] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-18 20:31:12] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-18 20:31:12] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-18 20:31:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2023-03-18 20:31:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 736 ms
[2023-03-18 20:31:12] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-18 20:31:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-18 20:31:12] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2023-03-18 20:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-18 20:31:13] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-18 20:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-18 20:31:13] [INFO ] After 2264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 447 ms.
[2023-03-18 20:31:13] [INFO ] After 3010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 239 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 88 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 80 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-18 20:31:14] [INFO ] Invariant cache hit.
[2023-03-18 20:31:14] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-18 20:31:14] [INFO ] Invariant cache hit.
[2023-03-18 20:31:16] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-18 20:31:16] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-18 20:31:16] [INFO ] Invariant cache hit.
[2023-03-18 20:31:17] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3145 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-18 20:31:17] [INFO ] Invariant cache hit.
[2023-03-18 20:31:17] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:31:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 69 ms returned sat
[2023-03-18 20:31:18] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:31:18] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-18 20:31:19] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-18 20:31:19] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-18 20:31:19] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-18 20:31:19] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-18 20:31:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 756 ms
[2023-03-18 20:31:19] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-18 20:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-18 20:31:20] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-18 20:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-18 20:31:20] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-18 20:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-18 20:31:20] [INFO ] After 2482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 493 ms.
[2023-03-18 20:31:20] [INFO ] After 3386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 17 factoid took 1043 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 468 reset in 993 ms.
Product exploration explored 100000 steps with 439 reset in 935 ms.
Built C files in :
/tmp/ltsmin2797585823104378054
[2023-03-18 20:31:24] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2797585823104378054
Running compilation step : cd /tmp/ltsmin2797585823104378054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2797585823104378054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2797585823104378054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 85 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-18 20:31:27] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-18 20:31:28] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-18 20:31:28] [INFO ] Invariant cache hit.
[2023-03-18 20:31:29] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1834 ms to find 0 implicit places.
[2023-03-18 20:31:29] [INFO ] Invariant cache hit.
[2023-03-18 20:31:30] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2632 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Built C files in :
/tmp/ltsmin12540432127858263213
[2023-03-18 20:31:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12540432127858263213
Running compilation step : cd /tmp/ltsmin12540432127858263213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12540432127858263213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12540432127858263213;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:31:33] [INFO ] Flatten gal took : 40 ms
[2023-03-18 20:31:33] [INFO ] Flatten gal took : 41 ms
[2023-03-18 20:31:33] [INFO ] Time to serialize gal into /tmp/LTL17330129581122863392.gal : 7 ms
[2023-03-18 20:31:33] [INFO ] Time to serialize properties into /tmp/LTL1555047157037233699.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17330129581122863392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2710194239289599042.hoa' '-atoms' '/tmp/LTL1555047157037233699.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1555047157037233699.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2710194239289599042.hoa
Detected timeout of ITS tools.
[2023-03-18 20:31:48] [INFO ] Flatten gal took : 64 ms
[2023-03-18 20:31:48] [INFO ] Flatten gal took : 67 ms
[2023-03-18 20:31:48] [INFO ] Time to serialize gal into /tmp/LTL14793183929179536343.gal : 10 ms
[2023-03-18 20:31:48] [INFO ] Time to serialize properties into /tmp/LTL1771518489859400846.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14793183929179536343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1771518489859400846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X("((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))"))&&(("(p2157==1)")U(G("(p2124!=1)"))))))
Formula 0 simplified : G(X!"((((p3112==0)||(p3156==0))||((p3181==0)||(p1688==0)))||((p1696==0)||(p1722==0)))" | (!"(p2157==1)" R F!"(p2124!=1)"))
Detected timeout of ITS tools.
[2023-03-18 20:32:04] [INFO ] Flatten gal took : 43 ms
[2023-03-18 20:32:04] [INFO ] Applying decomposition
[2023-03-18 20:32:04] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13458962161724816290.txt' '-o' '/tmp/graph13458962161724816290.bin' '-w' '/tmp/graph13458962161724816290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13458962161724816290.bin' '-l' '-1' '-v' '-w' '/tmp/graph13458962161724816290.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:32:04] [INFO ] Decomposing Gal with order
[2023-03-18 20:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:32:04] [INFO ] Removed a total of 2118 redundant transitions.
[2023-03-18 20:32:04] [INFO ] Flatten gal took : 69 ms
[2023-03-18 20:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2106 labels/synchronizations in 17 ms.
[2023-03-18 20:32:04] [INFO ] Time to serialize gal into /tmp/LTL7358374972821931963.gal : 8 ms
[2023-03-18 20:32:04] [INFO ] Time to serialize properties into /tmp/LTL14873636569757531203.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7358374972821931963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14873636569757531203.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X("((((i17.i1.i1.u311.p3112==0)||(i18.u315.p3156==0))||((i18.u319.p3181==0)||(i9.i0.i1.u164.p1688==0)))||((i9.i0.i1.u165.p1696==...245
Formula 0 simplified : G(X!"((((i17.i1.i1.u311.p3112==0)||(i18.u315.p3156==0))||((i18.u319.p3181==0)||(i9.i0.i1.u164.p1688==0)))||((i9.i0.i1.u165.p1696==0)...238
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6172034460111613539
[2023-03-18 20:32:19] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6172034460111613539
Running compilation step : cd /tmp/ltsmin6172034460111613539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6172034460111613539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6172034460111613539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-00 finished in 130689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-07
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3316 transition count 3417
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 2917 transition count 3417
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 798 place count 2917 transition count 2918
Deduced a syphon composed of 499 places in 9 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1796 place count 2418 transition count 2918
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1810 place count 2404 transition count 2904
Iterating global reduction 2 with 14 rules applied. Total rules applied 1824 place count 2404 transition count 2904
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1824 place count 2404 transition count 2899
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1834 place count 2399 transition count 2899
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 7 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 2 with 1982 rules applied. Total rules applied 3816 place count 1408 transition count 1908
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3818 place count 1406 transition count 1906
Applied a total of 3818 rules in 796 ms. Remains 1406 /3317 variables (removed 1911) and now considering 1906/3817 (removed 1911) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2023-03-18 20:32:23] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-18 20:32:24] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-18 20:32:24] [INFO ] Invariant cache hit.
[2023-03-18 20:32:25] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
[2023-03-18 20:32:25] [INFO ] Invariant cache hit.
[2023-03-18 20:32:26] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1406/3317 places, 1906/3817 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3405 ms. Remains : 1406/3317 places, 1906/3817 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s1125 0) (EQ s1368 0)), p0:(EQ s1067 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22590 reset in 937 ms.
Product exploration explored 100000 steps with 22425 reset in 1315 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 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 42 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-18 20:32:29] [INFO ] Invariant cache hit.
[2023-03-18 20:32:29] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-18 20:32:29] [INFO ] Invariant cache hit.
[2023-03-18 20:32:30] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2023-03-18 20:32:30] [INFO ] Invariant cache hit.
[2023-03-18 20:32:31] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2480 ms. Remains : 1406/1406 places, 1906/1906 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 (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22355 reset in 934 ms.
Product exploration explored 100000 steps with 22571 reset in 1096 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 87 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-18 20:32:35] [INFO ] Redundant transitions in 366 ms returned [1905]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1905 rows 1406 cols
[2023-03-18 20:32:35] [INFO ] Computed 401 place invariants in 5 ms
[2023-03-18 20:32:35] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1406/1406 places, 1905/1906 transitions.
Applied a total of 0 rules in 77 ms. Remains 1406 /1406 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1485 ms. Remains : 1406/1406 places, 1905/1906 transitions.
Built C files in :
/tmp/ltsmin16186221376025045462
[2023-03-18 20:32:36] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16186221376025045462
Running compilation step : cd /tmp/ltsmin16186221376025045462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16186221376025045462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16186221376025045462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 88 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2023-03-18 20:32:39] [INFO ] Computed 401 place invariants in 5 ms
[2023-03-18 20:32:39] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-18 20:32:39] [INFO ] Invariant cache hit.
[2023-03-18 20:32:40] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2023-03-18 20:32:40] [INFO ] Invariant cache hit.
[2023-03-18 20:32:41] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2628 ms. Remains : 1406/1406 places, 1906/1906 transitions.
Built C files in :
/tmp/ltsmin11457980292449182733
[2023-03-18 20:32:41] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11457980292449182733
Running compilation step : cd /tmp/ltsmin11457980292449182733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11457980292449182733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11457980292449182733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:32:44] [INFO ] Flatten gal took : 76 ms
[2023-03-18 20:32:45] [INFO ] Flatten gal took : 69 ms
[2023-03-18 20:32:45] [INFO ] Time to serialize gal into /tmp/LTL5173889007696664207.gal : 10 ms
[2023-03-18 20:32:45] [INFO ] Time to serialize properties into /tmp/LTL10017169931222728402.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5173889007696664207.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1671453823330759560.hoa' '-atoms' '/tmp/LTL10017169931222728402.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10017169931222728402.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1671453823330759560.hoa
Detected timeout of ITS tools.
[2023-03-18 20:33:00] [INFO ] Flatten gal took : 73 ms
[2023-03-18 20:33:00] [INFO ] Flatten gal took : 69 ms
[2023-03-18 20:33:00] [INFO ] Time to serialize gal into /tmp/LTL18240546213200655975.gal : 10 ms
[2023-03-18 20:33:00] [INFO ] Time to serialize properties into /tmp/LTL1978405571416868192.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18240546213200655975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1978405571416868192.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p3065==1)")||(G("((p3225==0)&&(p3901==0))"))))))
Formula 0 simplified : XG(!"(p3065==1)" & F!"((p3225==0)&&(p3901==0))")
Detected timeout of ITS tools.
[2023-03-18 20:33:15] [INFO ] Flatten gal took : 94 ms
[2023-03-18 20:33:15] [INFO ] Applying decomposition
[2023-03-18 20:33:15] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7667981486176861812.txt' '-o' '/tmp/graph7667981486176861812.bin' '-w' '/tmp/graph7667981486176861812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7667981486176861812.bin' '-l' '-1' '-v' '-w' '/tmp/graph7667981486176861812.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:33:15] [INFO ] Decomposing Gal with order
[2023-03-18 20:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:33:15] [INFO ] Removed a total of 2100 redundant transitions.
[2023-03-18 20:33:15] [INFO ] Flatten gal took : 96 ms
[2023-03-18 20:33:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2318 labels/synchronizations in 26 ms.
[2023-03-18 20:33:15] [INFO ] Time to serialize gal into /tmp/LTL12992994331259621323.gal : 11 ms
[2023-03-18 20:33:15] [INFO ] Time to serialize properties into /tmp/LTL17450471416885306201.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12992994331259621323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17450471416885306201.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i16.i1.i0.u304.p3065==1)")||(G("((i17.i1.i0.u322.p3225==0)&&(i21.u392.p3901==0))"))))))
Formula 0 simplified : XG(!"(i16.i1.i0.u304.p3065==1)" & F!"((i17.i1.i0.u322.p3225==0)&&(i21.u392.p3901==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11367869246925991822
[2023-03-18 20:33:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11367869246925991822
Running compilation step : cd /tmp/ltsmin11367869246925991822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11367869246925991822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11367869246925991822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-07 finished in 71285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||((p1 U (p2||G(p1))) U p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1||F(p2))))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-15
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2916 transition count 3416
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 800 place count 2916 transition count 2917
Deduced a syphon composed of 499 places in 11 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1798 place count 2417 transition count 2917
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1811 place count 2404 transition count 2904
Iterating global reduction 2 with 13 rules applied. Total rules applied 1824 place count 2404 transition count 2904
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1824 place count 2404 transition count 2900
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1832 place count 2400 transition count 2900
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 8 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 2 with 1986 rules applied. Total rules applied 3818 place count 1407 transition count 1907
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3820 place count 1405 transition count 1905
Applied a total of 3820 rules in 759 ms. Remains 1405 /3317 variables (removed 1912) and now considering 1905/3817 (removed 1912) transitions.
// Phase 1: matrix 1905 rows 1405 cols
[2023-03-18 20:33:35] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-18 20:33:35] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-03-18 20:33:35] [INFO ] Invariant cache hit.
[2023-03-18 20:33:37] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
[2023-03-18 20:33:37] [INFO ] Invariant cache hit.
[2023-03-18 20:33:37] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1405/3317 places, 1905/3817 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3388 ms. Remains : 1405/3317 places, 1905/3817 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s736 1) (EQ s738 1) (EQ s742 1)), p2:(EQ s665 1), p0:(EQ s1173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 486 reset in 850 ms.
Product exploration explored 100000 steps with 486 reset in 1049 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1405 stabilizing places and 2/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1943 steps, including 1 resets, run visited all 7 properties in 26 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 922 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-18 20:33:41] [INFO ] Invariant cache hit.
[2023-03-18 20:33:43] [INFO ] [Real]Absence check using 401 positive place invariants in 181 ms returned sat
[2023-03-18 20:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:33:46] [INFO ] [Real]Absence check using state equation in 3143 ms returned sat
[2023-03-18 20:33:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:33:47] [INFO ] [Nat]Absence check using 401 positive place invariants in 174 ms returned sat
[2023-03-18 20:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:33:50] [INFO ] [Nat]Absence check using state equation in 2572 ms returned sat
[2023-03-18 20:33:50] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 115 ms.
[2023-03-18 20:34:01] [INFO ] Added : 445 causal constraints over 89 iterations in 11085 ms. Result :unknown
Could not prove EG (NOT p0)
[2023-03-18 20:34:01] [INFO ] Invariant cache hit.
[2023-03-18 20:34:02] [INFO ] [Real]Absence check using 401 positive place invariants in 164 ms returned sat
[2023-03-18 20:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:34:05] [INFO ] [Real]Absence check using state equation in 2580 ms returned sat
[2023-03-18 20:34:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:34:06] [INFO ] [Nat]Absence check using 401 positive place invariants in 232 ms returned sat
[2023-03-18 20:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:34:10] [INFO ] [Nat]Absence check using state equation in 3220 ms returned sat
[2023-03-18 20:34:10] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 121 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:34:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 68 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2023-03-18 20:34:20] [INFO ] Invariant cache hit.
[2023-03-18 20:34:21] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-18 20:34:21] [INFO ] Invariant cache hit.
[2023-03-18 20:34:22] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2023-03-18 20:34:22] [INFO ] Invariant cache hit.
[2023-03-18 20:34:23] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2963 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1405 stabilizing places and 2/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 459 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 596 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 583 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-18 20:34:25] [INFO ] Invariant cache hit.
[2023-03-18 20:34:26] [INFO ] [Real]Absence check using 401 positive place invariants in 180 ms returned sat
[2023-03-18 20:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:34:29] [INFO ] [Real]Absence check using state equation in 3072 ms returned sat
[2023-03-18 20:34:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:34:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 165 ms returned sat
[2023-03-18 20:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:34:33] [INFO ] [Nat]Absence check using state equation in 2517 ms returned sat
[2023-03-18 20:34:33] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 96 ms.
[2023-03-18 20:34:45] [INFO ] Deduced a trap composed of 2 places in 874 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:34:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-18 20:34:45] [INFO ] Invariant cache hit.
[2023-03-18 20:34:46] [INFO ] [Real]Absence check using 401 positive place invariants in 174 ms returned sat
[2023-03-18 20:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:34:49] [INFO ] [Real]Absence check using state equation in 2497 ms returned sat
[2023-03-18 20:34:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:34:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 184 ms returned sat
[2023-03-18 20:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:34:53] [INFO ] [Nat]Absence check using state equation in 2647 ms returned sat
[2023-03-18 20:34:53] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 104 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:35:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 489 reset in 915 ms.
Product exploration explored 100000 steps with 488 reset in 900 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 78 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2023-03-18 20:35:07] [INFO ] Redundant transitions in 361 ms returned [1904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1904 rows 1405 cols
[2023-03-18 20:35:07] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-18 20:35:08] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1405/1405 places, 1904/1905 transitions.
Applied a total of 0 rules in 49 ms. Remains 1405 /1405 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1330 ms. Remains : 1405/1405 places, 1904/1905 transitions.
Built C files in :
/tmp/ltsmin12381387030069555900
[2023-03-18 20:35:08] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12381387030069555900
Running compilation step : cd /tmp/ltsmin12381387030069555900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12381387030069555900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12381387030069555900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 95 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
// Phase 1: matrix 1905 rows 1405 cols
[2023-03-18 20:35:11] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-18 20:35:12] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-18 20:35:12] [INFO ] Invariant cache hit.
[2023-03-18 20:35:13] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2023-03-18 20:35:13] [INFO ] Invariant cache hit.
[2023-03-18 20:35:14] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3025 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Built C files in :
/tmp/ltsmin16242835169319829078
[2023-03-18 20:35:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16242835169319829078
Running compilation step : cd /tmp/ltsmin16242835169319829078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16242835169319829078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16242835169319829078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:35:17] [INFO ] Flatten gal took : 44 ms
[2023-03-18 20:35:17] [INFO ] Flatten gal took : 44 ms
[2023-03-18 20:35:17] [INFO ] Time to serialize gal into /tmp/LTL2040326677967912374.gal : 7 ms
[2023-03-18 20:35:17] [INFO ] Time to serialize properties into /tmp/LTL7310367725196140515.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2040326677967912374.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15970678570144922068.hoa' '-atoms' '/tmp/LTL7310367725196140515.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7310367725196140515.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15970678570144922068.hoa
Detected timeout of ITS tools.
[2023-03-18 20:35:32] [INFO ] Flatten gal took : 45 ms
[2023-03-18 20:35:32] [INFO ] Flatten gal took : 46 ms
[2023-03-18 20:35:32] [INFO ] Time to serialize gal into /tmp/LTL13700548176601856148.gal : 7 ms
[2023-03-18 20:35:32] [INFO ] Time to serialize properties into /tmp/LTL13679770613356531975.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13700548176601856148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13679770613356531975.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(p3359==1)"))&&((F("(p1950==1)"))||("(((p2142==1)&&(p2147==1))&&(p2155==1))"))))))
Formula 0 simplified : XG(G!"(p3359==1)" | (!"(((p2142==1)&&(p2147==1))&&(p2155==1))" & G!"(p1950==1)"))
Detected timeout of ITS tools.
[2023-03-18 20:35:47] [INFO ] Flatten gal took : 76 ms
[2023-03-18 20:35:47] [INFO ] Applying decomposition
[2023-03-18 20:35:47] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17737070442609690851.txt' '-o' '/tmp/graph17737070442609690851.bin' '-w' '/tmp/graph17737070442609690851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17737070442609690851.bin' '-l' '-1' '-v' '-w' '/tmp/graph17737070442609690851.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:35:47] [INFO ] Decomposing Gal with order
[2023-03-18 20:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:35:48] [INFO ] Removed a total of 2109 redundant transitions.
[2023-03-18 20:35:48] [INFO ] Flatten gal took : 94 ms
[2023-03-18 20:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2174 labels/synchronizations in 24 ms.
[2023-03-18 20:35:48] [INFO ] Time to serialize gal into /tmp/LTL13081845086160095955.gal : 12 ms
[2023-03-18 20:35:48] [INFO ] Time to serialize properties into /tmp/LTL9638216391675156863.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13081845086160095955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9638216391675156863.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(i19.i0.i0.u336.p3359==1)"))&&((F("(i10.u190.p1950==1)"))||("(((i11.u209.p2142==1)&&(i11.u211.p2147==1))&&(i11.u212.p2155==...165
Formula 0 simplified : XG(G!"(i19.i0.i0.u336.p3359==1)" | (!"(((i11.u209.p2142==1)&&(i11.u211.p2147==1))&&(i11.u212.p2155==1))" & G!"(i10.u190.p1950==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin30662784080562365
[2023-03-18 20:36:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin30662784080562365
Running compilation step : cd /tmp/ltsmin30662784080562365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin30662784080562365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin30662784080562365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVs-PT-100B-LTLFireability-15 finished in 152125 ms.
[2023-03-18 20:36:06] [INFO ] Flatten gal took : 136 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15035707317435966608
[2023-03-18 20:36:06] [INFO ] Too many transitions (3817) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:36:06] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15035707317435966608
Running compilation step : cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 20:36:06] [INFO ] Applying decomposition
[2023-03-18 20:36:06] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5827172681557373812.txt' '-o' '/tmp/graph5827172681557373812.bin' '-w' '/tmp/graph5827172681557373812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5827172681557373812.bin' '-l' '-1' '-v' '-w' '/tmp/graph5827172681557373812.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:36:07] [INFO ] Decomposing Gal with order
[2023-03-18 20:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:36:07] [INFO ] Removed a total of 3591 redundant transitions.
[2023-03-18 20:36:07] [INFO ] Flatten gal took : 216 ms
[2023-03-18 20:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2023-03-18 20:36:07] [INFO ] Time to serialize gal into /tmp/LTLFireability16072098155853210919.gal : 42 ms
[2023-03-18 20:36:07] [INFO ] Time to serialize properties into /tmp/LTLFireability8459894152353403852.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16072098155853210919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8459894152353403852.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F((X("((((i24.u972.p3112==0)||(i25.i0.i0.u984.p3156==0))||((i25.i0.i1.u991.p3181==0)||(i12.u533.p1688==0)))||((i12.u535.p1696==0)||...236
Formula 0 simplified : G(X!"((((i24.u972.p3112==0)||(i25.i0.i0.u984.p3156==0))||((i25.i0.i1.u991.p3181==0)||(i12.u533.p1688==0)))||((i12.u535.p1696==0)||(i...229
Compilation finished in 9687 ms.
Running link step : cd /tmp/ltsmin15035707317435966608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&((LTLAPp1==true) U []((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))&&((LTLAPp1==true) U []((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[]((LTLAPp6==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 21:02:05] [INFO ] Applying decomposition
[2023-03-18 21:02:05] [INFO ] Flatten gal took : 219 ms
[2023-03-18 21:02:05] [INFO ] Decomposing Gal with order
[2023-03-18 21:02:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:02:07] [INFO ] Removed a total of 2097 redundant transitions.
[2023-03-18 21:02:07] [INFO ] Flatten gal took : 364 ms
[2023-03-18 21:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 3192 labels/synchronizations in 126 ms.
[2023-03-18 21:02:08] [INFO ] Time to serialize gal into /tmp/LTLFireability16841757962553885104.gal : 85 ms
[2023-03-18 21:02:08] [INFO ] Time to serialize properties into /tmp/LTLFireability7129865848739845920.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16841757962553885104.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7129865848739845920.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F((X("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u643.p3112==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1242
Formula 0 simplified : G(X!"((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u643.p3112==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...1235
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[]((LTLAPp6==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15035707317435966608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp7==true)||(((LTLAPp8==true) U ((LTLAPp9==true)||[]((LTLAPp8==true)))) U (LTLAPp10==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8822768 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16026256 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905974900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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