Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716948749338

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 02:12:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 02:12:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:12:31] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2024-05-29 02:12:32] [INFO ] Transformed 6003 places.
[2024-05-29 02:12:32] [INFO ] Transformed 5903 transitions.
[2024-05-29 02:12:32] [INFO ] Found NUPN structural information;
[2024-05-29 02:12:32] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 683 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 691 places :
Symmetric choice reduction at 0 with 691 rule applications. Total rules 691 place count 5312 transition count 5212
Iterating global reduction 0 with 691 rules applied. Total rules applied 1382 place count 5312 transition count 5212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1383 place count 5311 transition count 5211
Iterating global reduction 0 with 1 rules applied. Total rules applied 1384 place count 5311 transition count 5211
Applied a total of 1384 rules in 2028 ms. Remains 5311 /6003 variables (removed 692) and now considering 5211/5903 (removed 692) transitions.
// Phase 1: matrix 5211 rows 5311 cols
[2024-05-29 02:12:34] [INFO ] Computed 901 invariants in 59 ms
[2024-05-29 02:12:36] [INFO ] Implicit Places using invariants in 2086 ms returned []
[2024-05-29 02:12:36] [INFO ] Invariant cache hit.
[2024-05-29 02:12:38] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 4117 ms to find 0 implicit places.
[2024-05-29 02:12:38] [INFO ] Invariant cache hit.
[2024-05-29 02:12:42] [INFO ] Dead Transitions using invariants and state equation in 4030 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5311/6003 places, 5211/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10178 ms. Remains : 5311/6003 places, 5211/5903 transitions.
Support contains 43 out of 5311 places after structural reductions.
[2024-05-29 02:12:43] [INFO ] Flatten gal took : 323 ms
[2024-05-29 02:12:43] [INFO ] Flatten gal took : 177 ms
[2024-05-29 02:12:43] [INFO ] Input system was already deterministic with 5211 transitions.
Support contains 41 out of 5311 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-29 02:12:44] [INFO ] Invariant cache hit.
[2024-05-29 02:12:45] [INFO ] After 1181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 02:12:47] [INFO ] [Nat]Absence check using 901 positive place invariants in 608 ms returned sat
[2024-05-29 02:12:54] [INFO ] After 5813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 02:12:56] [INFO ] Deduced a trap composed of 25 places in 2326 ms of which 12 ms to minimize.
[2024-05-29 02:12:58] [INFO ] Deduced a trap composed of 14 places in 2119 ms of which 4 ms to minimize.
[2024-05-29 02:13:01] [INFO ] Deduced a trap composed of 27 places in 2256 ms of which 4 ms to minimize.
[2024-05-29 02:13:03] [INFO ] Deduced a trap composed of 22 places in 2147 ms of which 3 ms to minimize.
[2024-05-29 02:13:05] [INFO ] Deduced a trap composed of 25 places in 2103 ms of which 3 ms to minimize.
[2024-05-29 02:13:08] [INFO ] Deduced a trap composed of 22 places in 2253 ms of which 3 ms to minimize.
[2024-05-29 02:13:10] [INFO ] Deduced a trap composed of 16 places in 2157 ms of which 3 ms to minimize.
[2024-05-29 02:13:12] [INFO ] Deduced a trap composed of 20 places in 2223 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:13:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:13:12] [INFO ] After 27162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 2186 ms.
Support contains 18 out of 5311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5311 transition count 4711
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4811 transition count 4710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4810 transition count 4710
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1002 place count 4810 transition count 4211
Deduced a syphon composed of 499 places in 23 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2000 place count 4311 transition count 4211
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2006 place count 4305 transition count 4205
Iterating global reduction 3 with 6 rules applied. Total rules applied 2012 place count 4305 transition count 4205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2012 place count 4305 transition count 4204
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2014 place count 4304 transition count 4204
Performed 1788 Post agglomeration using F-continuation condition.Transition count delta: 1788
Deduced a syphon composed of 1788 places in 14 ms
Reduce places removed 1788 places and 0 transitions.
Iterating global reduction 3 with 3576 rules applied. Total rules applied 5590 place count 2516 transition count 2416
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 688 times.
Drop transitions removed 688 transitions
Iterating global reduction 3 with 688 rules applied. Total rules applied 6278 place count 2516 transition count 2416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6279 place count 2515 transition count 2415
Applied a total of 6279 rules in 1865 ms. Remains 2515 /5311 variables (removed 2796) and now considering 2415/5211 (removed 2796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1866 ms. Remains : 2515/5311 places, 2415/5211 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2415 rows 2515 cols
[2024-05-29 02:13:18] [INFO ] Computed 901 invariants in 76 ms
[2024-05-29 02:13:18] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 02:13:18] [INFO ] [Nat]Absence check using 897 positive place invariants in 170 ms returned sat
[2024-05-29 02:13:18] [INFO ] [Nat]Absence check using 897 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-29 02:13:20] [INFO ] After 1764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 02:13:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:13:21] [INFO ] After 418ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 02:13:21] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2024-05-29 02:13:21] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:13:22] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2024-05-29 02:13:22] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2024-05-29 02:13:22] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 02:13:22] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-05-29 02:13:22] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2024-05-29 02:13:23] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:13:23] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 02:13:23] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2024-05-29 02:13:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2351 ms
[2024-05-29 02:13:23] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:13:24] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:13:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2024-05-29 02:13:24] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:13:25] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2024-05-29 02:13:25] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:13:25] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:13:25] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2024-05-29 02:13:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1129 ms
[2024-05-29 02:13:25] [INFO ] After 4840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 396 ms.
[2024-05-29 02:13:26] [INFO ] After 7738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 294 ms.
Support contains 10 out of 2515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2515/2515 places, 2415/2415 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 2511 transition count 2411
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 2511 transition count 2411
Applied a total of 13 rules in 294 ms. Remains 2511 /2515 variables (removed 4) and now considering 2411/2415 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 2511/2515 places, 2411/2415 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 101298 steps, run timeout after 3007 ms. (steps per millisecond=33 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 101298 steps, saw 100359 distinct states, run finished after 3010 ms. (steps per millisecond=33 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 2411 rows 2511 cols
[2024-05-29 02:13:30] [INFO ] Computed 901 invariants in 66 ms
[2024-05-29 02:13:31] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:13:31] [INFO ] [Nat]Absence check using 898 positive place invariants in 182 ms returned sat
[2024-05-29 02:13:31] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:13:33] [INFO ] After 1647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:13:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:13:33] [INFO ] After 164ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 02:13:33] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2024-05-29 02:13:33] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:13:34] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:13:34] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:13:34] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 02:13:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 993 ms
[2024-05-29 02:13:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:13:34] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:13:35] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 02:13:35] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 02:13:35] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:13:35] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:13:35] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-29 02:13:35] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-29 02:13:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1471 ms
[2024-05-29 02:13:36] [INFO ] After 2747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2024-05-29 02:13:36] [INFO ] After 5162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 105 ms.
Support contains 4 out of 2511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2511/2511 places, 2411/2411 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2511 transition count 2410
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 2510 transition count 2410
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 2506 transition count 2406
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 2506 transition count 2406
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2503 transition count 2404
Applied a total of 16 rules in 500 ms. Remains 2503 /2511 variables (removed 8) and now considering 2404/2411 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 2503/2511 places, 2404/2411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 116263 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116263 steps, saw 115224 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:13:40] [INFO ] Computed 900 invariants in 29 ms
[2024-05-29 02:13:40] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:13:41] [INFO ] [Nat]Absence check using 897 positive place invariants in 203 ms returned sat
[2024-05-29 02:13:41] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:13:42] [INFO ] After 1459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:13:43] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2024-05-29 02:13:43] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2024-05-29 02:13:43] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:13:43] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:13:43] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:13:44] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:13:44] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:13:44] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:13:44] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:13:44] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2024-05-29 02:13:44] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-29 02:13:45] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:13:45] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:13:45] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-05-29 02:13:45] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:13:45] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 13 ms to minimize.
[2024-05-29 02:13:46] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:13:46] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-29 02:13:46] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:13:46] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:13:46] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2024-05-29 02:13:47] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-29 02:13:47] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2024-05-29 02:13:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-29 02:13:47] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2024-05-29 02:13:47] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4756 ms
[2024-05-29 02:13:47] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:13:48] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 02:13:48] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-29 02:13:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 02:13:48] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2024-05-29 02:13:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 866 ms
[2024-05-29 02:13:48] [INFO ] After 7262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-29 02:13:48] [INFO ] After 8077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 124 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 110 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2024-05-29 02:13:49] [INFO ] Invariant cache hit.
[2024-05-29 02:13:51] [INFO ] Implicit Places using invariants in 2110 ms returned []
[2024-05-29 02:13:51] [INFO ] Invariant cache hit.
[2024-05-29 02:13:55] [INFO ] Implicit Places using invariants and state equation in 4192 ms returned []
Implicit Place search using SMT with State Equation took 6303 ms to find 0 implicit places.
[2024-05-29 02:13:55] [INFO ] Redundant transitions in 172 ms returned []
[2024-05-29 02:13:55] [INFO ] Invariant cache hit.
[2024-05-29 02:13:57] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8419 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 114 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:13:57] [INFO ] Invariant cache hit.
[2024-05-29 02:13:58] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:13:58] [INFO ] [Nat]Absence check using 897 positive place invariants in 183 ms returned sat
[2024-05-29 02:13:58] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 02:14:00] [INFO ] After 1441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:14:00] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:14:00] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2024-05-29 02:14:00] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-29 02:14:00] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2024-05-29 02:14:00] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-29 02:14:01] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:14:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1076 ms
[2024-05-29 02:14:01] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-29 02:14:01] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 02:14:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 386 ms
[2024-05-29 02:14:01] [INFO ] After 3032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-29 02:14:01] [INFO ] After 3812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 1203 stabilizing places and 1203 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 4 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 5304 transition count 5204
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 5304 transition count 5204
Applied a total of 14 rules in 1353 ms. Remains 5304 /5311 variables (removed 7) and now considering 5204/5211 (removed 7) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2024-05-29 02:14:03] [INFO ] Computed 901 invariants in 26 ms
[2024-05-29 02:14:05] [INFO ] Implicit Places using invariants in 2153 ms returned []
[2024-05-29 02:14:05] [INFO ] Invariant cache hit.
[2024-05-29 02:14:07] [INFO ] Implicit Places using invariants and state equation in 2021 ms returned []
Implicit Place search using SMT with State Equation took 4176 ms to find 0 implicit places.
[2024-05-29 02:14:07] [INFO ] Invariant cache hit.
[2024-05-29 02:14:11] [INFO ] Dead Transitions using invariants and state equation in 4171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5311 places, 5204/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9703 ms. Remains : 5304/5311 places, 5204/5211 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 398 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s3273 0) (EQ s204 1)), p0:(OR (EQ s3087 0) (EQ s2056 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 1762 ms.
Product exploration explored 100000 steps with 8 reset in 2013 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 166891 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166891 steps, saw 164399 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 02:14:20] [INFO ] Invariant cache hit.
[2024-05-29 02:14:20] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 02:14:22] [INFO ] [Nat]Absence check using 901 positive place invariants in 554 ms returned sat
[2024-05-29 02:14:27] [INFO ] After 4689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:14:29] [INFO ] Deduced a trap composed of 23 places in 2148 ms of which 3 ms to minimize.
[2024-05-29 02:14:31] [INFO ] Deduced a trap composed of 29 places in 2080 ms of which 3 ms to minimize.
[2024-05-29 02:14:34] [INFO ] Deduced a trap composed of 20 places in 2057 ms of which 4 ms to minimize.
[2024-05-29 02:14:36] [INFO ] Deduced a trap composed of 19 places in 2052 ms of which 3 ms to minimize.
[2024-05-29 02:14:38] [INFO ] Deduced a trap composed of 23 places in 2049 ms of which 3 ms to minimize.
[2024-05-29 02:14:40] [INFO ] Deduced a trap composed of 25 places in 2033 ms of which 4 ms to minimize.
[2024-05-29 02:14:42] [INFO ] Deduced a trap composed of 23 places in 2039 ms of which 3 ms to minimize.
[2024-05-29 02:14:45] [INFO ] Deduced a trap composed of 33 places in 1998 ms of which 3 ms to minimize.
[2024-05-29 02:14:47] [INFO ] Deduced a trap composed of 33 places in 1957 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:14:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:14:47] [INFO ] After 26380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 304 ms.
Support contains 4 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 5204/5204 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5304 transition count 4703
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4803 transition count 4703
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4803 transition count 4202
Deduced a syphon composed of 501 places in 22 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4302 transition count 4202
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 12 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6297 place count 2504 transition count 2404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6298 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6299 place count 2502 transition count 2403
Applied a total of 6299 rules in 1323 ms. Remains 2502 /5304 variables (removed 2802) and now considering 2403/5204 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1323 ms. Remains : 2502/5304 places, 2403/5204 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2024-05-29 02:14:49] [INFO ] Computed 900 invariants in 29 ms
[2024-05-29 02:14:49] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:14:50] [INFO ] [Nat]Absence check using 899 positive place invariants in 182 ms returned sat
[2024-05-29 02:14:50] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 02:14:51] [INFO ] After 1281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:14:51] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:14:51] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 02:14:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 02:14:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-29 02:14:52] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-05-29 02:14:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 835 ms
[2024-05-29 02:14:52] [INFO ] After 2177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 02:14:52] [INFO ] After 2805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 107 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Finished random walk after 2914 steps, including 0 resets, run visited all 1 properties in 52 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 5204/5204 transitions.
Applied a total of 0 rules in 692 ms. Remains 5304 /5304 variables (removed 0) and now considering 5204/5204 (removed 0) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2024-05-29 02:14:53] [INFO ] Computed 901 invariants in 33 ms
[2024-05-29 02:14:55] [INFO ] Implicit Places using invariants in 2041 ms returned []
[2024-05-29 02:14:56] [INFO ] Invariant cache hit.
[2024-05-29 02:14:57] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 4034 ms to find 0 implicit places.
[2024-05-29 02:14:57] [INFO ] Invariant cache hit.
[2024-05-29 02:15:01] [INFO ] Dead Transitions using invariants and state equation in 3819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8549 ms. Remains : 5304/5304 places, 5204/5204 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 184336 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184336 steps, saw 181511 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 02:15:05] [INFO ] Invariant cache hit.
[2024-05-29 02:15:06] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 02:15:07] [INFO ] [Nat]Absence check using 901 positive place invariants in 570 ms returned sat
[2024-05-29 02:15:12] [INFO ] After 4709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:15:14] [INFO ] Deduced a trap composed of 23 places in 2017 ms of which 3 ms to minimize.
[2024-05-29 02:15:17] [INFO ] Deduced a trap composed of 29 places in 2048 ms of which 3 ms to minimize.
[2024-05-29 02:15:19] [INFO ] Deduced a trap composed of 20 places in 2079 ms of which 3 ms to minimize.
[2024-05-29 02:15:21] [INFO ] Deduced a trap composed of 19 places in 2052 ms of which 3 ms to minimize.
[2024-05-29 02:15:23] [INFO ] Deduced a trap composed of 23 places in 2011 ms of which 3 ms to minimize.
[2024-05-29 02:15:26] [INFO ] Deduced a trap composed of 25 places in 2010 ms of which 3 ms to minimize.
[2024-05-29 02:15:28] [INFO ] Deduced a trap composed of 23 places in 2005 ms of which 3 ms to minimize.
[2024-05-29 02:15:30] [INFO ] Deduced a trap composed of 33 places in 2009 ms of which 3 ms to minimize.
[2024-05-29 02:15:32] [INFO ] Deduced a trap composed of 33 places in 1966 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:15:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:15:32] [INFO ] After 26082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 293 ms.
Support contains 4 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 5204/5204 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5304 transition count 4703
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4803 transition count 4703
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4803 transition count 4202
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4302 transition count 4202
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 12 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6297 place count 2504 transition count 2404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6298 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6299 place count 2502 transition count 2403
Applied a total of 6299 rules in 1201 ms. Remains 2502 /5304 variables (removed 2802) and now considering 2403/5204 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1202 ms. Remains : 2502/5304 places, 2403/5204 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2024-05-29 02:15:34] [INFO ] Computed 900 invariants in 16 ms
[2024-05-29 02:15:34] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:15:35] [INFO ] [Nat]Absence check using 899 positive place invariants in 181 ms returned sat
[2024-05-29 02:15:35] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 02:15:36] [INFO ] After 1326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:15:36] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 02:15:36] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:15:37] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-29 02:15:37] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 02:15:37] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:15:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 887 ms
[2024-05-29 02:15:37] [INFO ] After 2276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 02:15:37] [INFO ] After 2870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 118 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150154 steps, run timeout after 3003 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150154 steps, saw 148930 distinct states, run finished after 3006 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:15:41] [INFO ] Invariant cache hit.
[2024-05-29 02:15:41] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:15:41] [INFO ] [Nat]Absence check using 899 positive place invariants in 187 ms returned sat
[2024-05-29 02:15:41] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:15:43] [INFO ] After 1383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:15:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-29 02:15:43] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:15:43] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 02:15:43] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:15:44] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 02:15:44] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:15:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1041 ms
[2024-05-29 02:15:44] [INFO ] After 2498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 02:15:44] [INFO ] After 3138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 102 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 122 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:15:44] [INFO ] Invariant cache hit.
[2024-05-29 02:15:46] [INFO ] Implicit Places using invariants in 2106 ms returned []
[2024-05-29 02:15:46] [INFO ] Invariant cache hit.
[2024-05-29 02:15:51] [INFO ] Implicit Places using invariants and state equation in 4433 ms returned []
Implicit Place search using SMT with State Equation took 6541 ms to find 0 implicit places.
[2024-05-29 02:15:51] [INFO ] Redundant transitions in 123 ms returned []
[2024-05-29 02:15:51] [INFO ] Invariant cache hit.
[2024-05-29 02:15:53] [INFO ] Dead Transitions using invariants and state equation in 1765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8561 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 113 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 02:15:53] [INFO ] Invariant cache hit.
[2024-05-29 02:15:53] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:15:54] [INFO ] [Nat]Absence check using 899 positive place invariants in 179 ms returned sat
[2024-05-29 02:15:54] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 02:15:55] [INFO ] After 1363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:15:55] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:15:55] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-29 02:15:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 02:15:56] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:15:56] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-29 02:15:56] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 02:15:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1061 ms
[2024-05-29 02:15:56] [INFO ] After 2490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 02:15:56] [INFO ] After 3073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11 reset in 1586 ms.
Product exploration explored 100000 steps with 9 reset in 1868 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 5304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5304/5304 places, 5204/5204 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5304 transition count 5204
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 500 place count 5304 transition count 5206
Deduced a syphon composed of 701 places in 24 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 701 place count 5304 transition count 5206
Performed 2099 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2800 places in 11 ms
Iterating global reduction 1 with 2099 rules applied. Total rules applied 2800 place count 5304 transition count 5206
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 1 with 701 rule applications. Total rules 3501 place count 4603 transition count 4505
Deduced a syphon composed of 2099 places in 10 ms
Iterating global reduction 1 with 701 rules applied. Total rules applied 4202 place count 4603 transition count 4505
Deduced a syphon composed of 2099 places in 10 ms
Applied a total of 4202 rules in 4448 ms. Remains 4603 /5304 variables (removed 701) and now considering 4505/5204 (removed 699) transitions.
[2024-05-29 02:16:06] [INFO ] Redundant transitions in 707 ms returned [4504]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 4504 rows 4603 cols
[2024-05-29 02:16:06] [INFO ] Computed 901 invariants in 131 ms
[2024-05-29 02:16:09] [INFO ] Dead Transitions using invariants and state equation in 3380 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4603/5304 places, 4504/5204 transitions.
Deduced a syphon composed of 2099 places in 9 ms
Applied a total of 0 rules in 384 ms. Remains 4603 /4603 variables (removed 0) and now considering 4504/4504 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8938 ms. Remains : 4603/5304 places, 4504/5204 transitions.
Built C files in :
/tmp/ltsmin2609790740607913877
[2024-05-29 02:16:10] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2609790740607913877
Running compilation step : cd /tmp/ltsmin2609790740607913877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2609790740607913877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2609790740607913877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 5204/5204 transitions.
Applied a total of 0 rules in 672 ms. Remains 5304 /5304 variables (removed 0) and now considering 5204/5204 (removed 0) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2024-05-29 02:16:14] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 02:16:16] [INFO ] Implicit Places using invariants in 2101 ms returned []
[2024-05-29 02:16:16] [INFO ] Invariant cache hit.
[2024-05-29 02:16:18] [INFO ] Implicit Places using invariants and state equation in 2093 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
[2024-05-29 02:16:18] [INFO ] Invariant cache hit.
[2024-05-29 02:16:22] [INFO ] Dead Transitions using invariants and state equation in 4190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9067 ms. Remains : 5304/5304 places, 5204/5204 transitions.
Built C files in :
/tmp/ltsmin7678295365199032183
[2024-05-29 02:16:22] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7678295365199032183
Running compilation step : cd /tmp/ltsmin7678295365199032183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7678295365199032183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7678295365199032183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 02:16:26] [INFO ] Flatten gal took : 172 ms
[2024-05-29 02:16:26] [INFO ] Flatten gal took : 161 ms
[2024-05-29 02:16:26] [INFO ] Time to serialize gal into /tmp/LTL13968637253210833501.gal : 41 ms
[2024-05-29 02:16:26] [INFO ] Time to serialize properties into /tmp/LTL13918565195158996453.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13968637253210833501.gal' '-t' 'CGAL' '-hoa' '/tmp/aut266659722819460530.hoa' '-atoms' '/tmp/LTL13918565195158996453.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13918565195158996453.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut266659722819460530.hoa
Detected timeout of ITS tools.
[2024-05-29 02:16:41] [INFO ] Flatten gal took : 143 ms
[2024-05-29 02:16:41] [INFO ] Flatten gal took : 134 ms
[2024-05-29 02:16:41] [INFO ] Time to serialize gal into /tmp/LTL16812876339072516330.gal : 25 ms
[2024-05-29 02:16:41] [INFO ] Time to serialize properties into /tmp/LTL8699174415345675450.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16812876339072516330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8699174415345675450.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((p3485==0)||(p2315==1))")))||(G("((p3697==0)||(p217==1))"))))))
Formula 0 simplified : XX(FG!"((p3485==0)||(p2315==1))" & F!"((p3697==0)||(p217==1))")
Detected timeout of ITS tools.
[2024-05-29 02:16:57] [INFO ] Flatten gal took : 128 ms
[2024-05-29 02:16:57] [INFO ] Applying decomposition
[2024-05-29 02:16:57] [INFO ] Flatten gal took : 134 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14322693364583262543.txt' '-o' '/tmp/graph14322693364583262543.bin' '-w' '/tmp/graph14322693364583262543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14322693364583262543.bin' '-l' '-1' '-v' '-w' '/tmp/graph14322693364583262543.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:16:57] [INFO ] Decomposing Gal with order
[2024-05-29 02:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:16:59] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:16:59] [INFO ] Flatten gal took : 350 ms
[2024-05-29 02:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-29 02:16:59] [INFO ] Time to serialize gal into /tmp/LTL14167044579426455063.gal : 61 ms
[2024-05-29 02:16:59] [INFO ] Time to serialize properties into /tmp/LTL2412174288383354928.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14167044579426455063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2412174288383354928.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i36.u1169.p3485==0)||(i23.u780.p2315==1))")))||(G("((i38.u1238.p3697==0)||(i1.i1.i3.u81.p217==1))"))))))
Formula 0 simplified : XX(FG!"((i36.u1169.p3485==0)||(i23.u780.p2315==1))" & F!"((i38.u1238.p3697==0)||(i1.i1.i3.u81.p217==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15465385895641511316
[2024-05-29 02:17:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15465385895641511316
Running compilation step : cd /tmp/ltsmin15465385895641511316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15465385895641511316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15465385895641511316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-01 finished in 195338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 5311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5310 transition count 4711
Reduce places removed 499 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 500 rules applied. Total rules applied 999 place count 4811 transition count 4710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1000 place count 4810 transition count 4710
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1000 place count 4810 transition count 4209
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2002 place count 4309 transition count 4209
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2010 place count 4301 transition count 4201
Iterating global reduction 3 with 8 rules applied. Total rules applied 2018 place count 4301 transition count 4201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2018 place count 4301 transition count 4200
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2020 place count 4300 transition count 4200
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 13 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 3 with 3588 rules applied. Total rules applied 5608 place count 2506 transition count 2406
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 5610 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5611 place count 2503 transition count 2404
Applied a total of 5611 rules in 1679 ms. Remains 2503 /5311 variables (removed 2808) and now considering 2404/5211 (removed 2807) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:17:19] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:17:21] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2024-05-29 02:17:21] [INFO ] Invariant cache hit.
[2024-05-29 02:17:24] [INFO ] Implicit Places using invariants and state equation in 3724 ms returned []
Implicit Place search using SMT with State Equation took 5602 ms to find 0 implicit places.
[2024-05-29 02:17:25] [INFO ] Redundant transitions in 333 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-29 02:17:25] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:17:27] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5311 places, 2403/5211 transitions.
Applied a total of 0 rules in 116 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9531 ms. Remains : 2503/5311 places, 2403/5211 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s2109 0) (NEQ s490 1)), p0:(OR (EQ s2358 0) (EQ s2021 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 409 reset in 1508 ms.
Product exploration explored 100000 steps with 390 reset in 1890 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 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:17:31] [INFO ] Invariant cache hit.
[2024-05-29 02:17:31] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:17:31] [INFO ] [Nat]Absence check using 900 positive place invariants in 164 ms returned sat
[2024-05-29 02:17:33] [INFO ] After 1271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:17:33] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2024-05-29 02:17:33] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:17:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-29 02:17:33] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-05-29 02:17:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-29 02:17:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 832 ms
[2024-05-29 02:17:34] [INFO ] After 2168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-29 02:17:34] [INFO ] After 2750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Partial Free-agglomeration rule applied 599 times.
Drop transitions removed 599 transitions
Iterating global reduction 0 with 599 rules applied. Total rules applied 599 place count 2503 transition count 2403
Applied a total of 599 rules in 215 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Finished random walk after 724 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 170 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 128 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:17:34] [INFO ] Invariant cache hit.
[2024-05-29 02:17:36] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2024-05-29 02:17:36] [INFO ] Invariant cache hit.
[2024-05-29 02:17:40] [INFO ] Implicit Places using invariants and state equation in 3722 ms returned []
Implicit Place search using SMT with State Equation took 5434 ms to find 0 implicit places.
[2024-05-29 02:17:40] [INFO ] Redundant transitions in 323 ms returned []
[2024-05-29 02:17:40] [INFO ] Invariant cache hit.
[2024-05-29 02:17:42] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7739 ms. Remains : 2503/2503 places, 2403/2403 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 p0 (NOT 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))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:17:43] [INFO ] Invariant cache hit.
[2024-05-29 02:17:43] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:17:43] [INFO ] [Nat]Absence check using 900 positive place invariants in 178 ms returned sat
[2024-05-29 02:17:45] [INFO ] After 1352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:17:45] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-29 02:17:45] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 02:17:45] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 02:17:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 02:17:46] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-29 02:17:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 748 ms
[2024-05-29 02:17:46] [INFO ] After 2164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 02:17:46] [INFO ] After 2754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Partial Free-agglomeration rule applied 599 times.
Drop transitions removed 599 transitions
Iterating global reduction 0 with 599 rules applied. Total rules applied 599 place count 2503 transition count 2403
Applied a total of 599 rules in 220 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Finished random walk after 1753 steps, including 0 resets, run visited all 1 properties in 32 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT 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))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 133 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 409 reset in 1337 ms.
Product exploration explored 100000 steps with 417 reset in 1752 ms.
Built C files in :
/tmp/ltsmin1792127186228146383
[2024-05-29 02:17:50] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:17:50] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1792127186228146383
Running compilation step : cd /tmp/ltsmin1792127186228146383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1792127186228146383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1792127186228146383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 112 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:17:53] [INFO ] Invariant cache hit.
[2024-05-29 02:17:54] [INFO ] Implicit Places using invariants in 1580 ms returned []
[2024-05-29 02:17:54] [INFO ] Invariant cache hit.
[2024-05-29 02:17:58] [INFO ] Implicit Places using invariants and state equation in 3756 ms returned []
Implicit Place search using SMT with State Equation took 5338 ms to find 0 implicit places.
[2024-05-29 02:17:58] [INFO ] Redundant transitions in 310 ms returned []
[2024-05-29 02:17:58] [INFO ] Invariant cache hit.
[2024-05-29 02:18:00] [INFO ] Dead Transitions using invariants and state equation in 1803 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7570 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin16549173764882952953
[2024-05-29 02:18:00] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:18:00] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16549173764882952953
Running compilation step : cd /tmp/ltsmin16549173764882952953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16549173764882952953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16549173764882952953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 02:18:03] [INFO ] Flatten gal took : 75 ms
[2024-05-29 02:18:03] [INFO ] Flatten gal took : 73 ms
[2024-05-29 02:18:03] [INFO ] Time to serialize gal into /tmp/LTL12352592865260787841.gal : 13 ms
[2024-05-29 02:18:03] [INFO ] Time to serialize properties into /tmp/LTL8298377800627579274.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12352592865260787841.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16318611750087058327.hoa' '-atoms' '/tmp/LTL8298377800627579274.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8298377800627579274.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16318611750087058327.hoa
Detected timeout of ITS tools.
[2024-05-29 02:18:19] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:18:19] [INFO ] Flatten gal took : 75 ms
[2024-05-29 02:18:19] [INFO ] Time to serialize gal into /tmp/LTL4918389613098548506.gal : 12 ms
[2024-05-29 02:18:19] [INFO ] Time to serialize properties into /tmp/LTL12478541307424703315.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4918389613098548506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12478541307424703315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p5661==0)||(p4861==1))")))||(G("((p5074!=0)&&(p1251!=1))")))))
Formula 0 simplified : G(FG!"((p5661==0)||(p4861==1))" & F!"((p5074!=0)&&(p1251!=1))")
Detected timeout of ITS tools.
[2024-05-29 02:18:34] [INFO ] Flatten gal took : 74 ms
[2024-05-29 02:18:34] [INFO ] Applying decomposition
[2024-05-29 02:18:34] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9240779153775285273.txt' '-o' '/tmp/graph9240779153775285273.bin' '-w' '/tmp/graph9240779153775285273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9240779153775285273.bin' '-l' '-1' '-v' '-w' '/tmp/graph9240779153775285273.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:18:34] [INFO ] Decomposing Gal with order
[2024-05-29 02:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:18:34] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:18:35] [INFO ] Flatten gal took : 125 ms
[2024-05-29 02:18:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1538 labels/synchronizations in 38 ms.
[2024-05-29 02:18:35] [INFO ] Time to serialize gal into /tmp/LTL11507405655463704758.gal : 24 ms
[2024-05-29 02:18:35] [INFO ] Time to serialize properties into /tmp/LTL10288654459645013982.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11507405655463704758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10288654459645013982.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i42.i1.i2.u849.p5661==0)||(i36.i1.i0.u728.p4861==1))")))||(G("((i38.i1.i1.u759.p5074!=0)&&(i8.i1.i2.u177.p1251!=1))")))))
Formula 0 simplified : G(FG!"((i42.i1.i2.u849.p5661==0)||(i36.i1.i0.u728.p4861==1))" & F!"((i38.i1.i1.u759.p5074!=0)&&(i8.i1.i2.u177.p1251!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16389246115965271889
[2024-05-29 02:18:50] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16389246115965271889
Running compilation step : cd /tmp/ltsmin16389246115965271889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16389246115965271889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16389246115965271889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-02 finished in 95668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5303 transition count 5203
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5303 transition count 5203
Applied a total of 16 rules in 1357 ms. Remains 5303 /5311 variables (removed 8) and now considering 5203/5211 (removed 8) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:18:54] [INFO ] Computed 901 invariants in 28 ms
[2024-05-29 02:18:56] [INFO ] Implicit Places using invariants in 1850 ms returned []
[2024-05-29 02:18:56] [INFO ] Invariant cache hit.
[2024-05-29 02:18:58] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 3801 ms to find 0 implicit places.
[2024-05-29 02:18:58] [INFO ] Invariant cache hit.
[2024-05-29 02:19:02] [INFO ] Dead Transitions using invariants and state equation in 4122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5311 places, 5203/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9282 ms. Remains : 5303/5311 places, 5203/5211 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2476 0) (EQ s4281 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-03 finished in 9423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p1))||(F(!p1)&&F((p2&&X((p2 U (!p1||G(p2)))))))))'
Support contains 5 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5303 transition count 5203
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5303 transition count 5203
Applied a total of 16 rules in 1393 ms. Remains 5303 /5311 variables (removed 8) and now considering 5203/5211 (removed 8) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:19:04] [INFO ] Computed 901 invariants in 27 ms
[2024-05-29 02:19:06] [INFO ] Implicit Places using invariants in 2032 ms returned []
[2024-05-29 02:19:06] [INFO ] Invariant cache hit.
[2024-05-29 02:19:08] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 3990 ms to find 0 implicit places.
[2024-05-29 02:19:08] [INFO ] Invariant cache hit.
[2024-05-29 02:19:12] [INFO ] Dead Transitions using invariants and state equation in 3998 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5311 places, 5203/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9383 ms. Remains : 5303/5311 places, 5203/5211 transitions.
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p2), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s2083 0), p1:(OR (EQ s2128 0) (EQ s211 1)), p2:(OR (EQ s4712 0) (EQ s3722 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 1421 ms.
Product exploration explored 100000 steps with 13 reset in 1769 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/5303 stabilizing places and 1200/5203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X p1), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 589 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:19:17] [INFO ] Invariant cache hit.
[2024-05-29 02:19:17] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:19:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 588 ms returned sat
[2024-05-29 02:19:23] [INFO ] After 4194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:19:25] [INFO ] Deduced a trap composed of 19 places in 2343 ms of which 4 ms to minimize.
[2024-05-29 02:19:28] [INFO ] Deduced a trap composed of 23 places in 2287 ms of which 3 ms to minimize.
[2024-05-29 02:19:30] [INFO ] Deduced a trap composed of 18 places in 2162 ms of which 3 ms to minimize.
[2024-05-29 02:19:32] [INFO ] Deduced a trap composed of 25 places in 2252 ms of which 3 ms to minimize.
[2024-05-29 02:19:35] [INFO ] Deduced a trap composed of 32 places in 2194 ms of which 3 ms to minimize.
[2024-05-29 02:19:37] [INFO ] Deduced a trap composed of 24 places in 2294 ms of which 7 ms to minimize.
[2024-05-29 02:19:40] [INFO ] Deduced a trap composed of 29 places in 2312 ms of which 3 ms to minimize.
[2024-05-29 02:19:42] [INFO ] Deduced a trap composed of 22 places in 2263 ms of which 4 ms to minimize.
[2024-05-29 02:19:47] [INFO ] Deduced a trap composed of 14 places in 5152 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:19:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:19:47] [INFO ] After 30200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5303 transition count 4702
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4201
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4301 transition count 4201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 2005 place count 4300 transition count 4200
Iterating global reduction 2 with 1 rules applied. Total rules applied 2006 place count 4300 transition count 4200
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 12 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5600 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6297 place count 2503 transition count 2403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2402
Applied a total of 6299 rules in 1545 ms. Remains 2501 /5303 variables (removed 2802) and now considering 2402/5203 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1545 ms. Remains : 2501/5303 places, 2402/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Finished probabilistic random walk after 29093 steps, run visited all 1 properties in 550 ms. (steps per millisecond=52 )
Probabilistic random walk after 29093 steps, saw 28565 distinct states, run finished after 552 ms. (steps per millisecond=52 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X p1), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p0))), (F (AND (NOT p2) p0)), (F (AND p1 (NOT p0))), (F (AND p2 (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 30 factoid took 2898 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 622 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
[2024-05-29 02:19:54] [INFO ] Invariant cache hit.
[2024-05-29 02:19:56] [INFO ] Implicit Places using invariants in 2096 ms returned []
[2024-05-29 02:19:56] [INFO ] Invariant cache hit.
[2024-05-29 02:19:58] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 4115 ms to find 0 implicit places.
[2024-05-29 02:19:58] [INFO ] Invariant cache hit.
[2024-05-29 02:20:02] [INFO ] Dead Transitions using invariants and state equation in 3761 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8513 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Detected a total of 1200/5303 stabilizing places and 1200/5203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 368 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 02:20:03] [INFO ] Invariant cache hit.
[2024-05-29 02:20:04] [INFO ] After 738ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 02:20:05] [INFO ] [Nat]Absence check using 901 positive place invariants in 546 ms returned sat
[2024-05-29 02:20:10] [INFO ] After 4416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 02:20:12] [INFO ] Deduced a trap composed of 23 places in 2038 ms of which 3 ms to minimize.
[2024-05-29 02:20:14] [INFO ] Deduced a trap composed of 24 places in 2038 ms of which 3 ms to minimize.
[2024-05-29 02:20:16] [INFO ] Deduced a trap composed of 24 places in 1987 ms of which 3 ms to minimize.
[2024-05-29 02:20:19] [INFO ] Deduced a trap composed of 23 places in 1927 ms of which 3 ms to minimize.
[2024-05-29 02:20:21] [INFO ] Deduced a trap composed of 31 places in 1893 ms of which 3 ms to minimize.
[2024-05-29 02:20:23] [INFO ] Deduced a trap composed of 19 places in 2035 ms of which 3 ms to minimize.
[2024-05-29 02:20:25] [INFO ] Deduced a trap composed of 20 places in 1966 ms of which 3 ms to minimize.
[2024-05-29 02:20:27] [INFO ] Deduced a trap composed of 26 places in 1978 ms of which 3 ms to minimize.
[2024-05-29 02:20:29] [INFO ] Deduced a trap composed of 22 places in 1943 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:20:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:20:29] [INFO ] After 25274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 473 ms.
Support contains 5 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4803 transition count 4703
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1000 place count 4803 transition count 4204
Deduced a syphon composed of 499 places in 19 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1998 place count 4304 transition count 4204
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 13 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5590 place count 2508 transition count 2408
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6287 place count 2508 transition count 2408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6288 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6289 place count 2506 transition count 2407
Applied a total of 6289 rules in 1217 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1217 ms. Remains : 2506/5303 places, 2407/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 153349 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 153349 steps, saw 151805 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:20:35] [INFO ] Computed 900 invariants in 26 ms
[2024-05-29 02:20:35] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:20:35] [INFO ] [Nat]Absence check using 899 positive place invariants in 178 ms returned sat
[2024-05-29 02:20:35] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 02:20:37] [INFO ] After 1352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:20:37] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2024-05-29 02:20:37] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:20:37] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:20:37] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:20:38] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:20:38] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:20:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1207 ms
[2024-05-29 02:20:38] [INFO ] After 2620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 02:20:38] [INFO ] After 3220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2506 transition count 2406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2505 transition count 2406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 2505 transition count 2405
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2504 transition count 2405
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 2502 transition count 2403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 2501 transition count 2402
Applied a total of 9 rules in 339 ms. Remains 2501 /2506 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 2501/2506 places, 2402/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38667 steps, run visited all 1 properties in 696 ms. (steps per millisecond=55 )
Probabilistic random walk after 38667 steps, saw 38014 distinct states, run finished after 699 ms. (steps per millisecond=55 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (AND p2 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p2)), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 22 factoid took 1934 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 13 reset in 1326 ms.
Product exploration explored 100000 steps with 13 reset in 1667 ms.
Applying partial POR strategy [false, true, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5303 transition count 5203
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 499 place count 5303 transition count 5205
Deduced a syphon composed of 699 places in 21 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 699 place count 5303 transition count 5205
Performed 2096 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2795 places in 10 ms
Iterating global reduction 1 with 2096 rules applied. Total rules applied 2795 place count 5303 transition count 5205
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 1 with 699 rule applications. Total rules 3494 place count 4604 transition count 4506
Deduced a syphon composed of 2096 places in 9 ms
Iterating global reduction 1 with 699 rules applied. Total rules applied 4193 place count 4604 transition count 4506
Deduced a syphon composed of 2096 places in 8 ms
Applied a total of 4193 rules in 4024 ms. Remains 4604 /5303 variables (removed 699) and now considering 4506/5203 (removed 697) transitions.
[2024-05-29 02:20:50] [INFO ] Redundant transitions in 487 ms returned [4505]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 4505 rows 4604 cols
[2024-05-29 02:20:51] [INFO ] Computed 901 invariants in 125 ms
[2024-05-29 02:20:54] [INFO ] Dead Transitions using invariants and state equation in 3405 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4604/5303 places, 4505/5203 transitions.
Deduced a syphon composed of 2096 places in 10 ms
Applied a total of 0 rules in 385 ms. Remains 4604 /4604 variables (removed 0) and now considering 4505/4505 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8315 ms. Remains : 4604/5303 places, 4505/5203 transitions.
Built C files in :
/tmp/ltsmin17117704529873453809
[2024-05-29 02:20:54] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17117704529873453809
Running compilation step : cd /tmp/ltsmin17117704529873453809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17117704529873453809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17117704529873453809;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 648 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:20:58] [INFO ] Computed 901 invariants in 27 ms
[2024-05-29 02:21:00] [INFO ] Implicit Places using invariants in 2010 ms returned []
[2024-05-29 02:21:00] [INFO ] Invariant cache hit.
[2024-05-29 02:21:02] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 4062 ms to find 0 implicit places.
[2024-05-29 02:21:02] [INFO ] Invariant cache hit.
[2024-05-29 02:21:06] [INFO ] Dead Transitions using invariants and state equation in 4027 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8738 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Built C files in :
/tmp/ltsmin9131428222597910279
[2024-05-29 02:21:06] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9131428222597910279
Running compilation step : cd /tmp/ltsmin9131428222597910279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9131428222597910279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9131428222597910279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 02:21:09] [INFO ] Flatten gal took : 132 ms
[2024-05-29 02:21:10] [INFO ] Flatten gal took : 115 ms
[2024-05-29 02:21:10] [INFO ] Time to serialize gal into /tmp/LTL15637247482120962270.gal : 33 ms
[2024-05-29 02:21:10] [INFO ] Time to serialize properties into /tmp/LTL5016914284473279915.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15637247482120962270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1373203522751370717.hoa' '-atoms' '/tmp/LTL5016914284473279915.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5016914284473279915.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1373203522751370717.hoa
Detected timeout of ITS tools.
[2024-05-29 02:21:25] [INFO ] Flatten gal took : 110 ms
[2024-05-29 02:21:25] [INFO ] Flatten gal took : 115 ms
[2024-05-29 02:21:25] [INFO ] Time to serialize gal into /tmp/LTL1921483376921195035.gal : 18 ms
[2024-05-29 02:21:25] [INFO ] Time to serialize properties into /tmp/LTL519620317422914971.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1921483376921195035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL519620317422914971.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((G("(p2349==0)"))||(G(F("((p2400!=0)&&(p225!=1))"))))||((F("((p2400!=0)&&(p225!=1))"))&&(F(("((p5330==0)||(p4206==1))")&&(X(("((p5...247
Formula 0 simplified : F!"(p2349==0)" & FG!"((p2400!=0)&&(p225!=1))" & (G!"((p2400!=0)&&(p225!=1))" | G(!"((p5330==0)||(p4206==1))" | X(!"((p5330==0)||(p42...195
Detected timeout of ITS tools.
[2024-05-29 02:21:40] [INFO ] Flatten gal took : 124 ms
[2024-05-29 02:21:40] [INFO ] Applying decomposition
[2024-05-29 02:21:40] [INFO ] Flatten gal took : 129 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2317090352215925603.txt' '-o' '/tmp/graph2317090352215925603.bin' '-w' '/tmp/graph2317090352215925603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2317090352215925603.bin' '-l' '-1' '-v' '-w' '/tmp/graph2317090352215925603.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:21:41] [INFO ] Decomposing Gal with order
[2024-05-29 02:21:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:21:42] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:21:42] [INFO ] Flatten gal took : 199 ms
[2024-05-29 02:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-29 02:21:42] [INFO ] Time to serialize gal into /tmp/LTL9203496518423110653.gal : 44 ms
[2024-05-29 02:21:42] [INFO ] Time to serialize properties into /tmp/LTL4375428518375291877.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9203496518423110653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4375428518375291877.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((G("(i23.i1.i4.u792.p2349==0)"))||(G(F("((i23.i1.i3.u808.p2400!=0)&&(i2.i0.i1.u87.p225!=1))"))))||((F("((i23.i1.i3.u808.p2400!=0)&...424
Formula 0 simplified : F!"(i23.i1.i4.u792.p2349==0)" & FG!"((i23.i1.i3.u808.p2400!=0)&&(i2.i0.i1.u87.p225!=1))" & (G!"((i23.i1.i3.u808.p2400!=0)&&(i2.i0.i1...346
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15426104505337664043
[2024-05-29 02:21:57] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15426104505337664043
Running compilation step : cd /tmp/ltsmin15426104505337664043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15426104505337664043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15426104505337664043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-05 finished in 178039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5302 transition count 5202
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5302 transition count 5202
Applied a total of 18 rules in 1311 ms. Remains 5302 /5311 variables (removed 9) and now considering 5202/5211 (removed 9) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2024-05-29 02:22:02] [INFO ] Computed 901 invariants in 24 ms
[2024-05-29 02:22:04] [INFO ] Implicit Places using invariants in 2118 ms returned []
[2024-05-29 02:22:04] [INFO ] Invariant cache hit.
[2024-05-29 02:22:06] [INFO ] Implicit Places using invariants and state equation in 1988 ms returned []
Implicit Place search using SMT with State Equation took 4108 ms to find 0 implicit places.
[2024-05-29 02:22:06] [INFO ] Invariant cache hit.
[2024-05-29 02:22:10] [INFO ] Dead Transitions using invariants and state equation in 4187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5311 places, 5202/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9609 ms. Remains : 5302/5311 places, 5202/5211 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s3168 0) (EQ s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5415 steps with 0 reset in 79 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-06 finished in 9866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(((p1 U X(p2)) U p0))))))'
Support contains 6 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5303 transition count 5203
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5303 transition count 5203
Applied a total of 16 rules in 1329 ms. Remains 5303 /5311 variables (removed 8) and now considering 5203/5211 (removed 8) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:22:11] [INFO ] Computed 901 invariants in 29 ms
[2024-05-29 02:22:14] [INFO ] Implicit Places using invariants in 2079 ms returned []
[2024-05-29 02:22:14] [INFO ] Invariant cache hit.
[2024-05-29 02:22:16] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 4099 ms to find 0 implicit places.
[2024-05-29 02:22:16] [INFO ] Invariant cache hit.
[2024-05-29 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 4056 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5311 places, 5203/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9485 ms. Remains : 5303/5311 places, 5203/5211 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s428 0) (EQ s4955 1)), p1:(OR (EQ s1065 0) (EQ s4769 1)), p2:(OR (EQ s3476 0) (EQ s2102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1464 ms.
Product exploration explored 100000 steps with 8 reset in 1918 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 118747 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118747 steps, saw 116864 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 02:22:27] [INFO ] Invariant cache hit.
[2024-05-29 02:22:28] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 02:22:30] [INFO ] [Nat]Absence check using 901 positive place invariants in 583 ms returned sat
[2024-05-29 02:22:36] [INFO ] After 5658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 02:22:39] [INFO ] Deduced a trap composed of 23 places in 2019 ms of which 3 ms to minimize.
[2024-05-29 02:22:41] [INFO ] Deduced a trap composed of 18 places in 1970 ms of which 3 ms to minimize.
[2024-05-29 02:22:43] [INFO ] Deduced a trap composed of 19 places in 2000 ms of which 3 ms to minimize.
[2024-05-29 02:22:45] [INFO ] Deduced a trap composed of 27 places in 2012 ms of which 3 ms to minimize.
[2024-05-29 02:22:47] [INFO ] Deduced a trap composed of 26 places in 1927 ms of which 3 ms to minimize.
[2024-05-29 02:22:49] [INFO ] Deduced a trap composed of 23 places in 1838 ms of which 3 ms to minimize.
[2024-05-29 02:22:51] [INFO ] Deduced a trap composed of 27 places in 1871 ms of which 3 ms to minimize.
[2024-05-29 02:22:54] [INFO ] Deduced a trap composed of 21 places in 1977 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:22:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:22:54] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 2036 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 13 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 3 with 695 rules applied. Total rules applied 6291 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6292 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6293 place count 2503 transition count 2404
Applied a total of 6293 rules in 1207 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1207 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:22:58] [INFO ] Computed 900 invariants in 22 ms
[2024-05-29 02:22:59] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:22:59] [INFO ] [Nat]Absence check using 898 positive place invariants in 172 ms returned sat
[2024-05-29 02:22:59] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:23:01] [INFO ] After 1959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 02:23:02] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 02:23:03] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 02:23:03] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2024-05-29 02:23:03] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 02:23:03] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2024-05-29 02:23:04] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:23:05] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-29 02:23:06] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4124 ms
[2024-05-29 02:23:06] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2024-05-29 02:23:06] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:23:06] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:23:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 682 ms
[2024-05-29 02:23:07] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2024-05-29 02:23:07] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:23:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:23:08] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2024-05-29 02:23:09] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2024-05-29 02:23:09] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:23:09] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2024-05-29 02:23:09] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2024-05-29 02:23:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2865 ms
[2024-05-29 02:23:10] [INFO ] After 10876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 570 ms.
[2024-05-29 02:23:11] [INFO ] After 12361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 519 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 105 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 106240 steps, run timeout after 3004 ms. (steps per millisecond=35 ) properties seen :{1=1, 2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 106240 steps, saw 105280 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :5
Running SMT prover for 2 properties.
[2024-05-29 02:23:16] [INFO ] Invariant cache hit.
[2024-05-29 02:23:16] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:23:16] [INFO ] [Nat]Absence check using 898 positive place invariants in 169 ms returned sat
[2024-05-29 02:23:16] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:23:18] [INFO ] After 1496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:23:18] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2024-05-29 02:23:18] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:23:19] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 02:23:19] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:23:19] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:23:19] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:23:19] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-05-29 02:23:19] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:23:20] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:23:20] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 02:23:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1928 ms
[2024-05-29 02:23:20] [INFO ] After 3645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-29 02:23:20] [INFO ] After 4375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 131 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 114 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 110166 steps, run timeout after 3006 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110166 steps, saw 109186 distinct states, run finished after 3006 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:23:24] [INFO ] Invariant cache hit.
[2024-05-29 02:23:24] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:23:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 173 ms returned sat
[2024-05-29 02:23:25] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:23:26] [INFO ] After 1416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:23:27] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-29 02:23:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2011 ms
[2024-05-29 02:23:29] [INFO ] After 3649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-29 02:23:29] [INFO ] After 4392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 134 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 109 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 113 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2024-05-29 02:23:29] [INFO ] Invariant cache hit.
[2024-05-29 02:23:31] [INFO ] Implicit Places using invariants in 2085 ms returned []
[2024-05-29 02:23:31] [INFO ] Invariant cache hit.
[2024-05-29 02:23:36] [INFO ] Implicit Places using invariants and state equation in 4552 ms returned []
Implicit Place search using SMT with State Equation took 6648 ms to find 0 implicit places.
[2024-05-29 02:23:36] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-29 02:23:36] [INFO ] Invariant cache hit.
[2024-05-29 02:23:37] [INFO ] Dead Transitions using invariants and state equation in 1600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8440 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 112 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:23:38] [INFO ] Invariant cache hit.
[2024-05-29 02:23:38] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:23:38] [INFO ] [Nat]Absence check using 898 positive place invariants in 173 ms returned sat
[2024-05-29 02:23:38] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:23:40] [INFO ] After 1454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:23:40] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2024-05-29 02:23:40] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:23:41] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 02:23:41] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:23:41] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-29 02:23:41] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 02:23:41] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:23:42] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 02:23:42] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:23:42] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-29 02:23:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2045 ms
[2024-05-29 02:23:42] [INFO ] After 3726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2024-05-29 02:23:42] [INFO ] After 4466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 647 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:23:44] [INFO ] Computed 901 invariants in 28 ms
[2024-05-29 02:23:46] [INFO ] Implicit Places using invariants in 1914 ms returned []
[2024-05-29 02:23:46] [INFO ] Invariant cache hit.
[2024-05-29 02:23:48] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 3857 ms to find 0 implicit places.
[2024-05-29 02:23:48] [INFO ] Invariant cache hit.
[2024-05-29 02:23:52] [INFO ] Dead Transitions using invariants and state equation in 4090 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8600 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 200 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 133163 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133163 steps, saw 131121 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 02:23:56] [INFO ] Invariant cache hit.
[2024-05-29 02:23:57] [INFO ] After 1140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 02:23:59] [INFO ] [Nat]Absence check using 901 positive place invariants in 589 ms returned sat
[2024-05-29 02:24:05] [INFO ] After 6107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 02:24:08] [INFO ] Deduced a trap composed of 23 places in 1930 ms of which 3 ms to minimize.
[2024-05-29 02:24:10] [INFO ] Deduced a trap composed of 22 places in 1991 ms of which 4 ms to minimize.
[2024-05-29 02:24:12] [INFO ] Deduced a trap composed of 20 places in 1997 ms of which 3 ms to minimize.
[2024-05-29 02:24:14] [INFO ] Deduced a trap composed of 16 places in 1961 ms of which 3 ms to minimize.
[2024-05-29 02:24:16] [INFO ] Deduced a trap composed of 25 places in 1985 ms of which 3 ms to minimize.
[2024-05-29 02:24:18] [INFO ] Deduced a trap composed of 18 places in 1946 ms of which 3 ms to minimize.
[2024-05-29 02:24:20] [INFO ] Deduced a trap composed of 26 places in 1971 ms of which 3 ms to minimize.
[2024-05-29 02:24:22] [INFO ] Deduced a trap composed of 21 places in 1862 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:24:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:24:22] [INFO ] After 25523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 2078 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 12 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 3 with 695 rules applied. Total rules applied 6291 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6292 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6293 place count 2503 transition count 2404
Applied a total of 6293 rules in 1203 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1204 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2024-05-29 02:24:27] [INFO ] Computed 900 invariants in 24 ms
[2024-05-29 02:24:27] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:24:28] [INFO ] [Nat]Absence check using 898 positive place invariants in 180 ms returned sat
[2024-05-29 02:24:28] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:24:30] [INFO ] After 1976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:24:31] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 02:24:31] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2024-05-29 02:24:31] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:24:31] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:24:31] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2024-05-29 02:24:32] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-29 02:24:32] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2024-05-29 02:24:32] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-05-29 02:24:32] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2024-05-29 02:24:33] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2024-05-29 02:24:33] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2024-05-29 02:24:33] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2024-05-29 02:24:33] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2024-05-29 02:24:34] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 02:24:34] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2024-05-29 02:24:34] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 02:24:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3655 ms
[2024-05-29 02:24:34] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2024-05-29 02:24:35] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2024-05-29 02:24:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2024-05-29 02:24:35] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2024-05-29 02:24:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-29 02:24:35] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-29 02:24:36] [INFO ] After 7305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 571 ms.
[2024-05-29 02:24:36] [INFO ] After 8852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 453 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 106 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 100495 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{1=1, 2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 100495 steps, saw 99564 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :5
Running SMT prover for 2 properties.
[2024-05-29 02:24:41] [INFO ] Invariant cache hit.
[2024-05-29 02:24:41] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:24:42] [INFO ] [Nat]Absence check using 898 positive place invariants in 183 ms returned sat
[2024-05-29 02:24:42] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 02:24:43] [INFO ] After 1536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:24:44] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2024-05-29 02:24:44] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2024-05-29 02:24:44] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 02:24:44] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-05-29 02:24:44] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:24:45] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:24:45] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2024-05-29 02:24:45] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2024-05-29 02:24:45] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:24:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1860 ms
[2024-05-29 02:24:46] [INFO ] After 3643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-29 02:24:46] [INFO ] After 4437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 113 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 106 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 122710 steps, run timeout after 3004 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122710 steps, saw 121618 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:24:49] [INFO ] Invariant cache hit.
[2024-05-29 02:24:50] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:24:50] [INFO ] [Nat]Absence check using 898 positive place invariants in 189 ms returned sat
[2024-05-29 02:24:50] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-29 02:24:52] [INFO ] After 1584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:24:52] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2024-05-29 02:24:52] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:24:53] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 02:24:53] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2024-05-29 02:24:53] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:24:53] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:24:53] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:24:54] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2024-05-29 02:24:54] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-29 02:24:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1817 ms
[2024-05-29 02:24:54] [INFO ] After 3631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-29 02:24:54] [INFO ] After 4423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 135 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 104 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 105 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2024-05-29 02:24:55] [INFO ] Invariant cache hit.
[2024-05-29 02:24:57] [INFO ] Implicit Places using invariants in 2074 ms returned []
[2024-05-29 02:24:57] [INFO ] Invariant cache hit.
[2024-05-29 02:25:01] [INFO ] Implicit Places using invariants and state equation in 4167 ms returned []
Implicit Place search using SMT with State Equation took 6245 ms to find 0 implicit places.
[2024-05-29 02:25:01] [INFO ] Redundant transitions in 60 ms returned []
[2024-05-29 02:25:01] [INFO ] Invariant cache hit.
[2024-05-29 02:25:03] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8229 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 109 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 02:25:03] [INFO ] Invariant cache hit.
[2024-05-29 02:25:03] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:25:04] [INFO ] [Nat]Absence check using 898 positive place invariants in 181 ms returned sat
[2024-05-29 02:25:04] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 9 ms returned sat
[2024-05-29 02:25:05] [INFO ] After 1501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:25:05] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2024-05-29 02:25:06] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2024-05-29 02:25:06] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 02:25:06] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2024-05-29 02:25:06] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 02:25:06] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:25:07] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2024-05-29 02:25:07] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-05-29 02:25:07] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:25:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1853 ms
[2024-05-29 02:25:07] [INFO ] After 3586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2024-05-29 02:25:08] [INFO ] After 4365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 20 factoid took 570 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1530 ms.
Product exploration explored 100000 steps with 9 reset in 1867 ms.
Built C files in :
/tmp/ltsmin13215274156010046585
[2024-05-29 02:25:12] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13215274156010046585
Running compilation step : cd /tmp/ltsmin13215274156010046585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13215274156010046585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13215274156010046585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 649 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:25:16] [INFO ] Computed 901 invariants in 25 ms
[2024-05-29 02:25:18] [INFO ] Implicit Places using invariants in 1924 ms returned []
[2024-05-29 02:25:18] [INFO ] Invariant cache hit.
[2024-05-29 02:25:20] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 3823 ms to find 0 implicit places.
[2024-05-29 02:25:20] [INFO ] Invariant cache hit.
[2024-05-29 02:25:24] [INFO ] Dead Transitions using invariants and state equation in 3710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8183 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Built C files in :
/tmp/ltsmin11018515700099734076
[2024-05-29 02:25:24] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11018515700099734076
Running compilation step : cd /tmp/ltsmin11018515700099734076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11018515700099734076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11018515700099734076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 02:25:27] [INFO ] Flatten gal took : 137 ms
[2024-05-29 02:25:27] [INFO ] Flatten gal took : 133 ms
[2024-05-29 02:25:27] [INFO ] Time to serialize gal into /tmp/LTL5205591074719419353.gal : 28 ms
[2024-05-29 02:25:27] [INFO ] Time to serialize properties into /tmp/LTL16178076708906050381.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5205591074719419353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16673153472570410158.hoa' '-atoms' '/tmp/LTL16178076708906050381.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16178076708906050381.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16673153472570410158.hoa
Detected timeout of ITS tools.
[2024-05-29 02:25:42] [INFO ] Flatten gal took : 120 ms
[2024-05-29 02:25:43] [INFO ] Flatten gal took : 123 ms
[2024-05-29 02:25:43] [INFO ] Time to serialize gal into /tmp/LTL16754920167596946726.gal : 20 ms
[2024-05-29 02:25:43] [INFO ] Time to serialize properties into /tmp/LTL8291655959633695505.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16754920167596946726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8291655959633695505.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G((("((p1191==0)||(p5395==1))")U(X("((p3929==0)||(p2368==1))")))U("((p470==0)||(p5605==1))"))))&&("((p470==0)||(p5605==1))")))...156
Formula 0 simplified : X(!"((p470==0)||(p5605==1))" | GF((!"((p1191==0)||(p5395==1))" R X!"((p3929==0)||(p2368==1))") R !"((p470==0)||(p5605==1))"))
Detected timeout of ITS tools.
[2024-05-29 02:25:58] [INFO ] Flatten gal took : 122 ms
[2024-05-29 02:25:58] [INFO ] Applying decomposition
[2024-05-29 02:25:58] [INFO ] Flatten gal took : 129 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10654967871086675233.txt' '-o' '/tmp/graph10654967871086675233.bin' '-w' '/tmp/graph10654967871086675233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10654967871086675233.bin' '-l' '-1' '-v' '-w' '/tmp/graph10654967871086675233.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:25:58] [INFO ] Decomposing Gal with order
[2024-05-29 02:25:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:25:59] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:26:00] [INFO ] Flatten gal took : 216 ms
[2024-05-29 02:26:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-29 02:26:00] [INFO ] Time to serialize gal into /tmp/LTL9873260918744988585.gal : 47 ms
[2024-05-29 02:26:00] [INFO ] Time to serialize properties into /tmp/LTL7232751620290402871.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9873260918744988585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7232751620290402871.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F(G((("((i14.u409.p1191==0)||(i57.i1.i5.u1811.p5395==1))")U(X("((i41.i1.i4.u1323.p3929==0)||(i26.i0.i2.u802.p2368==1))")))U("((i...248
Formula 0 simplified : X(!"((i6.u169.p470==0)||(i58.u1879.p5605==1))" | GF((!"((i14.u409.p1191==0)||(i57.i1.i5.u1811.p5395==1))" R X!"((i41.i1.i4.u1323.p39...240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10355956583361751322
[2024-05-29 02:26:15] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10355956583361751322
Running compilation step : cd /tmp/ltsmin10355956583361751322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10355956583361751322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10355956583361751322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-07 finished in 247760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(G(p1) U G(p2)))))'
Support contains 6 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5303 transition count 5203
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5303 transition count 5203
Applied a total of 16 rules in 1341 ms. Remains 5303 /5311 variables (removed 8) and now considering 5203/5211 (removed 8) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:26:19] [INFO ] Computed 901 invariants in 26 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 1924 ms returned []
[2024-05-29 02:26:21] [INFO ] Invariant cache hit.
[2024-05-29 02:26:23] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 3919 ms to find 0 implicit places.
[2024-05-29 02:26:23] [INFO ] Invariant cache hit.
[2024-05-29 02:26:27] [INFO ] Dead Transitions using invariants and state equation in 3765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5311 places, 5203/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9028 ms. Remains : 5303/5311 places, 5203/5211 transitions.
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s236 0) (EQ s589 1)), p1:(OR (EQ s3203 0) (EQ s3347 1)), p0:(OR (EQ s1525 0) (EQ s3139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33386 reset in 2125 ms.
Product exploration explored 100000 steps with 33298 reset in 2147 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 158 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 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 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 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 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 02:26:33] [INFO ] Invariant cache hit.
[2024-05-29 02:26:34] [INFO ] After 1141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 02:26:35] [INFO ] [Nat]Absence check using 901 positive place invariants in 530 ms returned sat
[2024-05-29 02:26:42] [INFO ] After 6056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 02:26:44] [INFO ] Deduced a trap composed of 23 places in 2134 ms of which 4 ms to minimize.
[2024-05-29 02:26:47] [INFO ] Deduced a trap composed of 24 places in 2137 ms of which 4 ms to minimize.
[2024-05-29 02:26:49] [INFO ] Deduced a trap composed of 22 places in 2130 ms of which 3 ms to minimize.
[2024-05-29 02:26:51] [INFO ] Deduced a trap composed of 19 places in 2057 ms of which 3 ms to minimize.
[2024-05-29 02:26:54] [INFO ] Deduced a trap composed of 20 places in 2186 ms of which 3 ms to minimize.
[2024-05-29 02:26:56] [INFO ] Deduced a trap composed of 26 places in 2135 ms of which 3 ms to minimize.
[2024-05-29 02:26:58] [INFO ] Deduced a trap composed of 18 places in 2142 ms of which 4 ms to minimize.
[2024-05-29 02:27:00] [INFO ] Deduced a trap composed of 24 places in 1873 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 02:27:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 02:27:00] [INFO ] After 26486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 1 properties in 1563 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5303 transition count 4702
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5590 place count 2508 transition count 2408
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6287 place count 2508 transition count 2408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6288 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6289 place count 2506 transition count 2407
Applied a total of 6289 rules in 1192 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1193 ms. Remains : 2506/5303 places, 2407/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 87953 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87953 steps, saw 87099 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:27:07] [INFO ] Computed 900 invariants in 24 ms
[2024-05-29 02:27:08] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:27:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 188 ms returned sat
[2024-05-29 02:27:08] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:11] [INFO ] After 2003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:27:11] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2024-05-29 02:27:11] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 02:27:11] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1707 ms
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1062 ms
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:27:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2024-05-29 02:27:15] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:27:15] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2024-05-29 02:27:15] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 02:27:15] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:27:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 718 ms
[2024-05-29 02:27:16] [INFO ] After 6783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 632 ms.
[2024-05-29 02:27:16] [INFO ] After 8412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 689 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 105 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 103 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2024-05-29 02:27:17] [INFO ] Invariant cache hit.
[2024-05-29 02:27:19] [INFO ] Implicit Places using invariants in 2002 ms returned []
[2024-05-29 02:27:19] [INFO ] Invariant cache hit.
[2024-05-29 02:27:23] [INFO ] Implicit Places using invariants and state equation in 4134 ms returned []
Implicit Place search using SMT with State Equation took 6141 ms to find 0 implicit places.
[2024-05-29 02:27:23] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-29 02:27:23] [INFO ] Invariant cache hit.
[2024-05-29 02:27:25] [INFO ] Dead Transitions using invariants and state equation in 1851 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8170 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 108 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-29 02:27:25] [INFO ] Invariant cache hit.
[2024-05-29 02:27:26] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:27:27] [INFO ] [Nat]Absence check using 898 positive place invariants in 188 ms returned sat
[2024-05-29 02:27:27] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-29 02:27:29] [INFO ] After 1970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:27:29] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 02:27:29] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2024-05-29 02:27:29] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:27:30] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2024-05-29 02:27:30] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-29 02:27:30] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2024-05-29 02:27:30] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2024-05-29 02:27:30] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3380 ms
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 685 ms
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 902 ms
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-29 02:27:36] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-29 02:27:36] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-29 02:27:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 911 ms
[2024-05-29 02:27:36] [INFO ] After 9015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 635 ms.
[2024-05-29 02:27:36] [INFO ] After 10641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p0))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 15 factoid took 518 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4201
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2002 place count 4301 transition count 4201
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 12 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5586 place count 2509 transition count 2409
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 5588 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5589 place count 2506 transition count 2407
Applied a total of 5589 rules in 1073 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:27:39] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:27:40] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2024-05-29 02:27:40] [INFO ] Invariant cache hit.
[2024-05-29 02:27:44] [INFO ] Implicit Places using invariants and state equation in 3593 ms returned []
Implicit Place search using SMT with State Equation took 5258 ms to find 0 implicit places.
[2024-05-29 02:27:44] [INFO ] Redundant transitions in 319 ms returned [2406]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2406 rows 2506 cols
[2024-05-29 02:27:44] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:27:46] [INFO ] Dead Transitions using invariants and state equation in 1709 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2506/5303 places, 2406/5203 transitions.
Applied a total of 0 rules in 110 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8477 ms. Remains : 2506/5303 places, 2406/5203 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (NOT p0)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 1413 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) p1), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 02:27:49] [INFO ] Invariant cache hit.
[2024-05-29 02:27:50] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:27:50] [INFO ] [Nat]Absence check using 900 positive place invariants in 188 ms returned sat
[2024-05-29 02:27:52] [INFO ] After 1833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:27:52] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-05-29 02:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2024-05-29 02:27:53] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-29 02:27:54] [INFO ] After 3040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 595 ms.
[2024-05-29 02:27:54] [INFO ] After 4621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 670 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 2506 transition count 2406
Applied a total of 600 rules in 227 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 93326 steps, run timeout after 3005 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93326 steps, saw 92446 distinct states, run finished after 3006 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2406 rows 2506 cols
[2024-05-29 02:27:59] [INFO ] Computed 900 invariants in 24 ms
[2024-05-29 02:28:00] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:28:01] [INFO ] [Nat]Absence check using 900 positive place invariants in 183 ms returned sat
[2024-05-29 02:28:03] [INFO ] After 1842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:28:03] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2024-05-29 02:28:03] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 02:28:03] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2024-05-29 02:28:03] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2024-05-29 02:28:04] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-29 02:28:04] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-29 02:28:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1087 ms
[2024-05-29 02:28:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:28:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-29 02:28:04] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 02:28:04] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 02:28:05] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2024-05-29 02:28:05] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2024-05-29 02:28:05] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-29 02:28:05] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-29 02:28:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1190 ms
[2024-05-29 02:28:05] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 02:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-05-29 02:28:06] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 02:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-29 02:28:06] [INFO ] After 5249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 602 ms.
[2024-05-29 02:28:07] [INFO ] After 6842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 364 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 116 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 103 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2024-05-29 02:28:07] [INFO ] Invariant cache hit.
[2024-05-29 02:28:09] [INFO ] Implicit Places using invariants in 1942 ms returned []
[2024-05-29 02:28:09] [INFO ] Invariant cache hit.
[2024-05-29 02:28:14] [INFO ] Implicit Places using invariants and state equation in 4473 ms returned []
Implicit Place search using SMT with State Equation took 6423 ms to find 0 implicit places.
[2024-05-29 02:28:14] [INFO ] Redundant transitions in 66 ms returned []
[2024-05-29 02:28:14] [INFO ] Invariant cache hit.
[2024-05-29 02:28:15] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8315 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 110 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-29 02:28:16] [INFO ] Invariant cache hit.
[2024-05-29 02:28:16] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 02:28:17] [INFO ] [Nat]Absence check using 900 positive place invariants in 180 ms returned sat
[2024-05-29 02:28:19] [INFO ] After 1821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 02:28:19] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-29 02:28:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2024-05-29 02:28:19] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-29 02:28:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 02:28:19] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 02:28:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-29 02:28:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 558 ms
[2024-05-29 02:28:20] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 02:28:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 02:28:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:28:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-29 02:28:20] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 02:28:21] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2024-05-29 02:28:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 931 ms
[2024-05-29 02:28:21] [INFO ] After 4265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 608 ms.
[2024-05-29 02:28:22] [INFO ] After 5794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (NOT p0)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT p0)), (F (NOT (AND p2 p1))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 17 factoid took 1785 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) p1), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) p1), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) p1), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Entered a terminal (fully accepting) state of product in 4879 steps with 0 reset in 79 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-08 finished in 126829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5302 transition count 5202
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5302 transition count 5202
Applied a total of 18 rules in 1348 ms. Remains 5302 /5311 variables (removed 9) and now considering 5202/5211 (removed 9) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2024-05-29 02:28:26] [INFO ] Computed 901 invariants in 23 ms
[2024-05-29 02:28:28] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2024-05-29 02:28:28] [INFO ] Invariant cache hit.
[2024-05-29 02:28:30] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 4098 ms to find 0 implicit places.
[2024-05-29 02:28:30] [INFO ] Invariant cache hit.
[2024-05-29 02:28:34] [INFO ] Dead Transitions using invariants and state equation in 4190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5311 places, 5202/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9638 ms. Remains : 5302/5311 places, 5202/5211 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s5256 0) (EQ s357 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-09 finished in 9798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((X(G(p0))||p1)))))'
Support contains 6 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5303 transition count 5203
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5303 transition count 5203
Applied a total of 16 rules in 1386 ms. Remains 5303 /5311 variables (removed 8) and now considering 5203/5211 (removed 8) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2024-05-29 02:28:36] [INFO ] Computed 901 invariants in 25 ms
[2024-05-29 02:28:38] [INFO ] Implicit Places using invariants in 2140 ms returned []
[2024-05-29 02:28:38] [INFO ] Invariant cache hit.
[2024-05-29 02:28:40] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
[2024-05-29 02:28:40] [INFO ] Invariant cache hit.
[2024-05-29 02:28:44] [INFO ] Dead Transitions using invariants and state equation in 3859 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5311 places, 5203/5211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9280 ms. Remains : 5303/5311 places, 5203/5211 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s2642 0) (EQ s818 1)), p1:(OR (AND (EQ s2540 0) (EQ s1251 1)) (AND (EQ s845 0) (EQ s3939 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1413 steps with 0 reset in 13 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-10 finished in 9527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 5311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5310 transition count 4711
Reduce places removed 499 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 500 rules applied. Total rules applied 999 place count 4811 transition count 4710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1000 place count 4810 transition count 4710
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1000 place count 4810 transition count 4211
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1998 place count 4311 transition count 4211
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2007 place count 4302 transition count 4202
Iterating global reduction 3 with 9 rules applied. Total rules applied 2016 place count 4302 transition count 4202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2016 place count 4302 transition count 4201
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2018 place count 4301 transition count 4201
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 12 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5604 place count 2508 transition count 2408
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 5606 place count 2506 transition count 2406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5607 place count 2505 transition count 2406
Applied a total of 5607 rules in 1539 ms. Remains 2505 /5311 variables (removed 2806) and now considering 2406/5211 (removed 2805) transitions.
// Phase 1: matrix 2406 rows 2505 cols
[2024-05-29 02:28:46] [INFO ] Computed 900 invariants in 11 ms
[2024-05-29 02:28:47] [INFO ] Implicit Places using invariants in 1524 ms returned []
[2024-05-29 02:28:47] [INFO ] Invariant cache hit.
[2024-05-29 02:28:51] [INFO ] Implicit Places using invariants and state equation in 3678 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
[2024-05-29 02:28:51] [INFO ] Redundant transitions in 309 ms returned [2405]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2405 rows 2505 cols
[2024-05-29 02:28:51] [INFO ] Computed 900 invariants in 5 ms
[2024-05-29 02:28:53] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2505/5311 places, 2405/5211 transitions.
Applied a total of 0 rules in 116 ms. Remains 2505 /2505 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8950 ms. Remains : 2505/5311 places, 2405/5211 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2155 0) (EQ s2307 1) (OR (EQ s795 0) (EQ s880 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5181 steps with 0 reset in 84 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 9191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100B-LTLCardinality-01
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5310 transition count 4709
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4809 transition count 4709
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4809 transition count 4208
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4308 transition count 4208
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2011 place count 4301 transition count 4201
Iterating global reduction 2 with 7 rules applied. Total rules applied 2018 place count 4301 transition count 4201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2018 place count 4301 transition count 4200
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2020 place count 4300 transition count 4200
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 13 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5610 place count 2505 transition count 2405
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 5612 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5613 place count 2502 transition count 2403
Applied a total of 5613 rules in 1533 ms. Remains 2502 /5311 variables (removed 2809) and now considering 2403/5211 (removed 2808) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2024-05-29 02:28:55] [INFO ] Computed 900 invariants in 12 ms
[2024-05-29 02:28:57] [INFO ] Implicit Places using invariants in 1628 ms returned []
[2024-05-29 02:28:57] [INFO ] Invariant cache hit.
[2024-05-29 02:29:00] [INFO ] Implicit Places using invariants and state equation in 3744 ms returned []
Implicit Place search using SMT with State Equation took 5373 ms to find 0 implicit places.
[2024-05-29 02:29:00] [INFO ] Invariant cache hit.
[2024-05-29 02:29:02] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2502/5311 places, 2403/5211 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8679 ms. Remains : 2502/5311 places, 2403/5211 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1528 0) (EQ s51 1)), p0:(OR (EQ s1436 0) (EQ s941 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 1494 ms.
Product exploration explored 100000 steps with 23 reset in 1905 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 p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 2146 steps, including 0 resets, run visited all 3 properties in 81 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 97 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:29:07] [INFO ] Invariant cache hit.
[2024-05-29 02:29:08] [INFO ] Implicit Places using invariants in 1672 ms returned []
[2024-05-29 02:29:08] [INFO ] Invariant cache hit.
[2024-05-29 02:29:12] [INFO ] Implicit Places using invariants and state equation in 3655 ms returned []
Implicit Place search using SMT with State Equation took 5330 ms to find 0 implicit places.
[2024-05-29 02:29:12] [INFO ] Invariant cache hit.
[2024-05-29 02:29:14] [INFO ] Dead Transitions using invariants and state equation in 1687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7115 ms. Remains : 2502/2502 places, 2403/2403 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 p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:29:14] [INFO ] Invariant cache hit.
[2024-05-29 02:29:15] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:29:15] [INFO ] [Nat]Absence check using 900 positive place invariants in 183 ms returned sat
[2024-05-29 02:29:17] [INFO ] After 1608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:29:17] [INFO ] After 1879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 174 ms.
[2024-05-29 02:29:17] [INFO ] After 2677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 227 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 2502 transition count 2403
Applied a total of 597 rules in 216 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2024-05-29 02:29:18] [INFO ] Computed 900 invariants in 23 ms
[2024-05-29 02:29:19] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:29:19] [INFO ] [Nat]Absence check using 900 positive place invariants in 182 ms returned sat
[2024-05-29 02:29:21] [INFO ] After 1460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-29 02:29:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 02:29:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2024-05-29 02:29:21] [INFO ] After 1995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-29 02:29:21] [INFO ] After 2627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 105 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Finished random walk after 3195 steps, including 0 resets, run visited all 1 properties in 59 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23 reset in 1486 ms.
Product exploration explored 100000 steps with 27 reset in 1916 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 110 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2024-05-29 02:29:26] [INFO ] Redundant transitions in 306 ms returned [2402]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2502 cols
[2024-05-29 02:29:26] [INFO ] Computed 900 invariants in 7 ms
[2024-05-29 02:29:28] [INFO ] Dead Transitions using invariants and state equation in 1770 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2502/2502 places, 2402/2403 transitions.
Applied a total of 0 rules in 106 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2306 ms. Remains : 2502/2502 places, 2402/2403 transitions.
Built C files in :
/tmp/ltsmin16904013221493949718
[2024-05-29 02:29:28] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16904013221493949718
Running compilation step : cd /tmp/ltsmin16904013221493949718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16904013221493949718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16904013221493949718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 101 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2024-05-29 02:29:31] [INFO ] Computed 900 invariants in 12 ms
[2024-05-29 02:29:33] [INFO ] Implicit Places using invariants in 1656 ms returned []
[2024-05-29 02:29:33] [INFO ] Invariant cache hit.
[2024-05-29 02:29:37] [INFO ] Implicit Places using invariants and state equation in 3693 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
[2024-05-29 02:29:37] [INFO ] Invariant cache hit.
[2024-05-29 02:29:38] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7204 ms. Remains : 2502/2502 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin825892041950116628
[2024-05-29 02:29:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin825892041950116628
Running compilation step : cd /tmp/ltsmin825892041950116628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin825892041950116628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin825892041950116628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 02:29:42] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:29:42] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:29:42] [INFO ] Time to serialize gal into /tmp/LTL3216311648875378989.gal : 10 ms
[2024-05-29 02:29:42] [INFO ] Time to serialize properties into /tmp/LTL12319029282917886605.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3216311648875378989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10271882647899805743.hoa' '-atoms' '/tmp/LTL12319029282917886605.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12319029282917886605.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10271882647899805743.hoa
Detected timeout of ITS tools.
[2024-05-29 02:29:57] [INFO ] Flatten gal took : 71 ms
[2024-05-29 02:29:57] [INFO ] Flatten gal took : 70 ms
[2024-05-29 02:29:57] [INFO ] Time to serialize gal into /tmp/LTL41438240457894997.gal : 10 ms
[2024-05-29 02:29:57] [INFO ] Time to serialize properties into /tmp/LTL6673573900733779931.ltl : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL41438240457894997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6673573900733779931.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((p3485==0)||(p2315==1))")))||(G("((p3697==0)||(p217==1))"))))))
Formula 0 simplified : XX(FG!"((p3485==0)||(p2315==1))" & F!"((p3697==0)||(p217==1))")
Detected timeout of ITS tools.
[2024-05-29 02:30:12] [INFO ] Flatten gal took : 80 ms
[2024-05-29 02:30:12] [INFO ] Applying decomposition
[2024-05-29 02:30:12] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15984156450009332644.txt' '-o' '/tmp/graph15984156450009332644.bin' '-w' '/tmp/graph15984156450009332644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15984156450009332644.bin' '-l' '-1' '-v' '-w' '/tmp/graph15984156450009332644.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:30:12] [INFO ] Decomposing Gal with order
[2024-05-29 02:30:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:30:13] [INFO ] Removed a total of 1597 redundant transitions.
[2024-05-29 02:30:13] [INFO ] Flatten gal took : 109 ms
[2024-05-29 02:30:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 25 ms.
[2024-05-29 02:30:13] [INFO ] Time to serialize gal into /tmp/LTL3835035096614349335.gal : 19 ms
[2024-05-29 02:30:13] [INFO ] Time to serialize properties into /tmp/LTL1722670171831957050.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3835035096614349335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1722670171831957050.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i25.i0.i1.u517.p3485==0)||(i16.i1.i1.u339.p2315==1))")))||(G("((i26.i1.i2.u549.p3697==0)||(i0.i1.i2.u18.p217==1))")))))...156
Formula 0 simplified : XX(FG!"((i25.i0.i1.u517.p3485==0)||(i16.i1.i1.u339.p2315==1))" & F!"((i26.i1.i2.u549.p3697==0)||(i0.i1.i2.u18.p217==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9382867552894118605
[2024-05-29 02:30:28] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9382867552894118605
Running compilation step : cd /tmp/ltsmin9382867552894118605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9382867552894118605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9382867552894118605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-01 finished in 97771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p1))||(F(!p1)&&F((p2&&X((p2 U (!p1||G(p2)))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100B-LTLCardinality-05
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 5311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5311/5311 places, 5211/5211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5310 transition count 4710
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4810 transition count 4710
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1000 place count 4810 transition count 4211
Deduced a syphon composed of 499 places in 20 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1998 place count 4311 transition count 4211
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2006 place count 4303 transition count 4203
Iterating global reduction 2 with 8 rules applied. Total rules applied 2014 place count 4303 transition count 4203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2014 place count 4303 transition count 4202
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2016 place count 4302 transition count 4202
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 13 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5602 place count 2509 transition count 2409
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 5604 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5605 place count 2506 transition count 2407
Applied a total of 5605 rules in 1546 ms. Remains 2506 /5311 variables (removed 2805) and now considering 2407/5211 (removed 2804) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:30:33] [INFO ] Computed 900 invariants in 6 ms
[2024-05-29 02:30:35] [INFO ] Implicit Places using invariants in 1557 ms returned []
[2024-05-29 02:30:35] [INFO ] Invariant cache hit.
[2024-05-29 02:30:38] [INFO ] Implicit Places using invariants and state equation in 3534 ms returned []
Implicit Place search using SMT with State Equation took 5095 ms to find 0 implicit places.
[2024-05-29 02:30:38] [INFO ] Invariant cache hit.
[2024-05-29 02:30:40] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2506/5311 places, 2407/5211 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8275 ms. Remains : 2506/5311 places, 2407/5211 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p2), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s955 0), p1:(OR (EQ s980 0) (EQ s53 1)), p2:(OR (EQ s2223 0) (EQ s1747 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 1441 ms.
Product exploration explored 100000 steps with 34 reset in 1852 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/2506 stabilizing places and 4/2407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 18 factoid took 1887 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:30:46] [INFO ] Invariant cache hit.
[2024-05-29 02:30:46] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:30:47] [INFO ] [Nat]Absence check using 900 positive place invariants in 187 ms returned sat
[2024-05-29 02:30:48] [INFO ] After 1549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:30:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 02:30:49] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 02:30:49] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 02:30:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:30:49] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2024-05-29 02:30:49] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:30:50] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2024-05-29 02:30:50] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-29 02:30:50] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2024-05-29 02:30:50] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 02:30:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1763 ms
[2024-05-29 02:30:50] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-29 02:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-29 02:30:51] [INFO ] After 3693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-29 02:30:51] [INFO ] After 4487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 124 ms.
Support contains 5 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Partial Free-agglomeration rule applied 599 times.
Drop transitions removed 599 transitions
Iterating global reduction 0 with 599 rules applied. Total rules applied 599 place count 2506 transition count 2407
Applied a total of 599 rules in 219 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1038 steps, run visited all 2 properties in 36 ms. (steps per millisecond=28 )
Probabilistic random walk after 1038 steps, saw 976 distinct states, run finished after 37 ms. (steps per millisecond=28 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p1 p2)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p0))), (F (AND (NOT p2) p0)), (F (AND p1 (NOT p0))), (F (AND p2 (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 18 factoid took 3591 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 2506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 97 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2024-05-29 02:30:56] [INFO ] Invariant cache hit.
[2024-05-29 02:30:58] [INFO ] Implicit Places using invariants in 1737 ms returned []
[2024-05-29 02:30:58] [INFO ] Invariant cache hit.
[2024-05-29 02:31:01] [INFO ] Implicit Places using invariants and state equation in 3535 ms returned []
Implicit Place search using SMT with State Equation took 5275 ms to find 0 implicit places.
[2024-05-29 02:31:01] [INFO ] Invariant cache hit.
[2024-05-29 02:31:03] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7080 ms. Remains : 2506/2506 places, 2407/2407 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/2506 stabilizing places and 4/2407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 12 factoid took 1229 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 02:31:05] [INFO ] Invariant cache hit.
[2024-05-29 02:31:05] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 02:31:06] [INFO ] [Nat]Absence check using 900 positive place invariants in 177 ms returned sat
[2024-05-29 02:31:08] [INFO ] After 1529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 02:31:08] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:31:08] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 02:31:08] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 02:31:08] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 02:31:08] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2024-05-29 02:31:09] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 02:31:09] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 02:31:09] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-29 02:31:09] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 02:31:09] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-29 02:31:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1736 ms
[2024-05-29 02:31:10] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 02:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-29 02:31:10] [INFO ] After 3607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-29 02:31:10] [INFO ] After 4357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 118 ms.
Support contains 5 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Partial Free-agglomeration rule applied 599 times.
Drop transitions removed 599 transitions
Iterating global reduction 0 with 599 rules applied. Total rules applied 599 place count 2506 transition count 2407
Applied a total of 599 rules in 215 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1038 steps, run visited all 2 properties in 37 ms. (steps per millisecond=28 )
Probabilistic random walk after 1038 steps, saw 976 distinct states, run finished after 38 ms. (steps per millisecond=27 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND p2 p0))), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p1 p0))), (F (AND (NOT p2) p0)), (F (AND p1 (NOT p0))), (F (AND p2 (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 2249 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 33 reset in 1483 ms.
Product exploration explored 100000 steps with 33 reset in 1894 ms.
Applying partial POR strategy [false, true, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) p1), p1, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 5 out of 2506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 109 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2024-05-29 02:31:18] [INFO ] Redundant transitions in 314 ms returned [2406]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2406 rows 2506 cols
[2024-05-29 02:31:18] [INFO ] Computed 900 invariants in 4 ms
[2024-05-29 02:31:20] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2506/2506 places, 2406/2407 transitions.
Applied a total of 0 rules in 109 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2268 ms. Remains : 2506/2506 places, 2406/2407 transitions.
Built C files in :
/tmp/ltsmin2591643339752172193
[2024-05-29 02:31:20] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2591643339752172193
Running compilation step : cd /tmp/ltsmin2591643339752172193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2591643339752172193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2591643339752172193;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 109 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2024-05-29 02:31:23] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:31:25] [INFO ] Implicit Places using invariants in 1605 ms returned []
[2024-05-29 02:31:25] [INFO ] Invariant cache hit.
[2024-05-29 02:31:28] [INFO ] Implicit Places using invariants and state equation in 3543 ms returned []
Implicit Place search using SMT with State Equation took 5169 ms to find 0 implicit places.
[2024-05-29 02:31:28] [INFO ] Invariant cache hit.
[2024-05-29 02:31:30] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6986 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Built C files in :
/tmp/ltsmin15831804995751990319
[2024-05-29 02:31:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15831804995751990319
Running compilation step : cd /tmp/ltsmin15831804995751990319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15831804995751990319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15831804995751990319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 02:31:33] [INFO ] Flatten gal took : 68 ms
[2024-05-29 02:31:33] [INFO ] Flatten gal took : 69 ms
[2024-05-29 02:31:33] [INFO ] Time to serialize gal into /tmp/LTL14555890278761026275.gal : 11 ms
[2024-05-29 02:31:33] [INFO ] Time to serialize properties into /tmp/LTL8303125047576713844.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14555890278761026275.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3268908295413162506.hoa' '-atoms' '/tmp/LTL8303125047576713844.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8303125047576713844.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3268908295413162506.hoa
Detected timeout of ITS tools.
[2024-05-29 02:31:49] [INFO ] Flatten gal took : 76 ms
[2024-05-29 02:31:49] [INFO ] Flatten gal took : 78 ms
[2024-05-29 02:31:49] [INFO ] Time to serialize gal into /tmp/LTL4695932214475923357.gal : 11 ms
[2024-05-29 02:31:49] [INFO ] Time to serialize properties into /tmp/LTL1892137822012086020.ltl : 178 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4695932214475923357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1892137822012086020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((G("(p2349==0)"))||(G(F("((p2400!=0)&&(p225!=1))"))))||((F("((p2400!=0)&&(p225!=1))"))&&(F(("((p5330==0)||(p4206==1))")&&(X(("((p5...247
Formula 0 simplified : F!"(p2349==0)" & FG!"((p2400!=0)&&(p225!=1))" & (G!"((p2400!=0)&&(p225!=1))" | G(!"((p5330==0)||(p4206==1))" | X(!"((p5330==0)||(p42...195
Detected timeout of ITS tools.
[2024-05-29 02:32:04] [INFO ] Flatten gal took : 78 ms
[2024-05-29 02:32:04] [INFO ] Applying decomposition
[2024-05-29 02:32:04] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8366116947890310642.txt' '-o' '/tmp/graph8366116947890310642.bin' '-w' '/tmp/graph8366116947890310642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8366116947890310642.bin' '-l' '-1' '-v' '-w' '/tmp/graph8366116947890310642.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:32:04] [INFO ] Decomposing Gal with order
[2024-05-29 02:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:32:05] [INFO ] Removed a total of 1599 redundant transitions.
[2024-05-29 02:32:05] [INFO ] Flatten gal took : 100 ms
[2024-05-29 02:32:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1530 labels/synchronizations in 23 ms.
[2024-05-29 02:32:05] [INFO ] Time to serialize gal into /tmp/LTL680947784971160264.gal : 47 ms
[2024-05-29 02:32:05] [INFO ] Time to serialize properties into /tmp/LTL16239190386548893375.ltl : 55 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL680947784971160264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16239190386548893375.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((G("(i17.u343.p2349==0)"))||(G(F("((i17.u351.p2400!=0)&&(i1.u19.p225!=1))"))))||((F("((i17.u351.p2400!=0)&&(i1.u19.p225!=1))"))&&(...394
Formula 0 simplified : F!"(i17.u343.p2349==0)" & FG!"((i17.u351.p2400!=0)&&(i1.u19.p225!=1))" & (G!"((i17.u351.p2400!=0)&&(i1.u19.p225!=1))" | G(!"((i40.i2...312
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3375801518493148305
[2024-05-29 02:32:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3375801518493148305
Running compilation step : cd /tmp/ltsmin3375801518493148305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3375801518493148305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3375801518493148305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-05 finished in 111967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(((p1 U X(p2)) U p0))))))'
[2024-05-29 02:32:23] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11006514337626156534
[2024-05-29 02:32:23] [INFO ] Too many transitions (5211) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:32:23] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11006514337626156534
Running compilation step : cd /tmp/ltsmin11006514337626156534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 02:32:23] [INFO ] Applying decomposition
[2024-05-29 02:32:24] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph672914424571581487.txt' '-o' '/tmp/graph672914424571581487.bin' '-w' '/tmp/graph672914424571581487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph672914424571581487.bin' '-l' '-1' '-v' '-w' '/tmp/graph672914424571581487.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:32:24] [INFO ] Decomposing Gal with order
[2024-05-29 02:32:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:32:25] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-29 02:32:25] [INFO ] Flatten gal took : 210 ms
[2024-05-29 02:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-29 02:32:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality105832979293619555.gal : 47 ms
[2024-05-29 02:32:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality17577940140009180938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality105832979293619555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17577940140009180938.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((X(X((G(F("((i36.u1176.p3485==0)||(i23.i0.i4.u786.p2315==1))")))||(G("((i38.u1245.p3697==0)||(i2.i1.i4.u84.p217==1))"))))))
Formula 0 simplified : XX(FG!"((i36.u1176.p3485==0)||(i23.i0.i4.u786.p2315==1))" & F!"((i38.u1245.p3697==0)||(i2.i1.i4.u84.p217==1))")
Compilation finished in 18806 ms.
Running link step : cd /tmp/ltsmin11006514337626156534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin11006514337626156534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11006514337626156534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11006514337626156534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 02:59:05] [INFO ] Applying decomposition
[2024-05-29 02:59:07] [INFO ] Flatten gal took : 1517 ms
[2024-05-29 02:59:08] [INFO ] Decomposing Gal with order
[2024-05-29 02:59:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:59:24] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-29 02:59:24] [INFO ] Flatten gal took : 424 ms
[2024-05-29 02:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 185 ms.
[2024-05-29 02:59:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality9714734120917102311.gal : 163 ms
[2024-05-29 02:59:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality16991055175239825939.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9714734120917102311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16991055175239825939.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((X(X((G(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...879
Formula 0 simplified : XX(FG!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....867
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11006514337626156534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11006514337626156534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp4==true))||[](<>(!(LTLAPp5==true)))||(<>(!(LTLAPp5==true))&&<>(((LTLAPp6==true)&&X(((LTLAPp6==true) U (!(LTLAPp5==true)||[]((LTLAPp6==true)))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3680112 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15285564 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788500107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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