Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679182738082

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 23:39:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:39:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:39:01] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-03-18 23:39:01] [INFO ] Transformed 6003 places.
[2023-03-18 23:39:01] [INFO ] Transformed 5903 transitions.
[2023-03-18 23:39:01] [INFO ] Found NUPN structural information;
[2023-03-18 23:39:01] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 826 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 5 formulas.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 695 places :
Symmetric choice reduction at 0 with 695 rule applications. Total rules 695 place count 5308 transition count 5208
Iterating global reduction 0 with 695 rules applied. Total rules applied 1390 place count 5308 transition count 5208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1391 place count 5307 transition count 5207
Iterating global reduction 0 with 1 rules applied. Total rules applied 1392 place count 5307 transition count 5207
Applied a total of 1392 rules in 2421 ms. Remains 5307 /6003 variables (removed 696) and now considering 5207/5903 (removed 696) transitions.
// Phase 1: matrix 5207 rows 5307 cols
[2023-03-18 23:39:04] [INFO ] Computed 901 place invariants in 85 ms
[2023-03-18 23:39:08] [INFO ] Implicit Places using invariants in 3727 ms returned []
[2023-03-18 23:39:08] [INFO ] Invariant cache hit.
[2023-03-18 23:39:10] [INFO ] Implicit Places using invariants and state equation in 2447 ms returned []
Implicit Place search using SMT with State Equation took 6222 ms to find 0 implicit places.
[2023-03-18 23:39:10] [INFO ] Invariant cache hit.
[2023-03-18 23:39:16] [INFO ] Dead Transitions using invariants and state equation in 6461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5307/6003 places, 5207/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15124 ms. Remains : 5307/6003 places, 5207/5903 transitions.
Support contains 27 out of 5307 places after structural reductions.
[2023-03-18 23:39:17] [INFO ] Flatten gal took : 366 ms
[2023-03-18 23:39:17] [INFO ] Flatten gal took : 229 ms
[2023-03-18 23:39:18] [INFO ] Input system was already deterministic with 5207 transitions.
Support contains 25 out of 5307 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 23:39:19] [INFO ] Invariant cache hit.
[2023-03-18 23:39:20] [INFO ] After 1430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:39:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 836 ms returned sat
[2023-03-18 23:39:30] [INFO ] After 6091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:39:32] [INFO ] Deduced a trap composed of 30 places in 2373 ms of which 13 ms to minimize.
[2023-03-18 23:39:35] [INFO ] Deduced a trap composed of 29 places in 2315 ms of which 30 ms to minimize.
[2023-03-18 23:39:38] [INFO ] Deduced a trap composed of 22 places in 2951 ms of which 11 ms to minimize.
[2023-03-18 23:39:41] [INFO ] Deduced a trap composed of 23 places in 2743 ms of which 5 ms to minimize.
[2023-03-18 23:39:43] [INFO ] Deduced a trap composed of 25 places in 2066 ms of which 4 ms to minimize.
[2023-03-18 23:39:46] [INFO ] Deduced a trap composed of 24 places in 2189 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 23:39:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:39:46] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 1 properties in 2112 ms.
Support contains 11 out of 5307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5307/5307 places, 5207/5207 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 5307 transition count 4707
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 4807 transition count 4706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4806 transition count 4706
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 4806 transition count 4206
Deduced a syphon composed of 500 places in 23 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4306 transition count 4206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2005 place count 4303 transition count 4203
Iterating global reduction 3 with 3 rules applied. Total rules applied 2008 place count 4303 transition count 4203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2008 place count 4303 transition count 4201
Deduced a syphon composed of 2 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2012 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 15 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 3 with 3584 rules applied. Total rules applied 5596 place count 2509 transition count 2409
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 693 times.
Drop transitions removed 693 transitions
Iterating global reduction 3 with 693 rules applied. Total rules applied 6289 place count 2509 transition count 2409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6290 place count 2508 transition count 2408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6291 place count 2507 transition count 2408
Applied a total of 6291 rules in 1964 ms. Remains 2507 /5307 variables (removed 2800) and now considering 2408/5207 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1964 ms. Remains : 2507/5307 places, 2408/5207 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) 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 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 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2408 rows 2507 cols
[2023-03-18 23:39:51] [INFO ] Computed 900 place invariants in 138 ms
[2023-03-18 23:39:51] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 23:39:52] [INFO ] [Nat]Absence check using 897 positive place invariants in 326 ms returned sat
[2023-03-18 23:39:52] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:39:55] [INFO ] After 1949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 23:39:55] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2023-03-18 23:39:55] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-18 23:39:55] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 0 ms to minimize.
[2023-03-18 23:39:56] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 2 ms to minimize.
[2023-03-18 23:39:56] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2023-03-18 23:39:56] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2023-03-18 23:39:56] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2023-03-18 23:39:57] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2023-03-18 23:39:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2222 ms
[2023-03-18 23:39:57] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-18 23:39:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-18 23:39:58] [INFO ] After 5287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-18 23:39:59] [INFO ] After 7189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 655 ms.
Support contains 9 out of 2507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2507/2507 places, 2408/2408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2506 transition count 2407
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2506 transition count 2407
Applied a total of 4 rules in 299 ms. Remains 2506 /2507 variables (removed 1) and now considering 2407/2408 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 2506/2507 places, 2407/2408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 66048 steps, run timeout after 3005 ms. (steps per millisecond=21 ) properties seen :{2=1}
Probabilistic random walk after 66048 steps, saw 65288 distinct states, run finished after 3006 ms. (steps per millisecond=21 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-18 23:40:04] [INFO ] Computed 900 place invariants in 96 ms
[2023-03-18 23:40:04] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:40:05] [INFO ] [Nat]Absence check using 897 positive place invariants in 201 ms returned sat
[2023-03-18 23:40:05] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 23:40:07] [INFO ] After 1788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:40:07] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2023-03-18 23:40:08] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-18 23:40:08] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-18 23:40:08] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2023-03-18 23:40:09] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 0 ms to minimize.
[2023-03-18 23:40:09] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 0 ms to minimize.
[2023-03-18 23:40:09] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-18 23:40:10] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 0 ms to minimize.
[2023-03-18 23:40:10] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-03-18 23:40:10] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-18 23:40:10] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-18 23:40:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3604 ms
[2023-03-18 23:40:11] [INFO ] After 6141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 590 ms.
[2023-03-18 23:40:12] [INFO ] After 7616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 445 ms.
Support contains 7 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2505 transition count 2406
Applied a total of 2 rules in 203 ms. Remains 2505 /2506 variables (removed 1) and now considering 2406/2407 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 2505/2506 places, 2406/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69193 steps, run timeout after 3003 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69193 steps, saw 68418 distinct states, run finished after 3006 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2406 rows 2505 cols
[2023-03-18 23:40:17] [INFO ] Computed 900 place invariants in 49 ms
[2023-03-18 23:40:17] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:40:18] [INFO ] [Nat]Absence check using 897 positive place invariants in 212 ms returned sat
[2023-03-18 23:40:18] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:40:20] [INFO ] After 1784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:40:20] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2023-03-18 23:40:20] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-18 23:40:21] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-18 23:40:21] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-03-18 23:40:21] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-18 23:40:22] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 4 ms to minimize.
[2023-03-18 23:40:22] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-03-18 23:40:22] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-18 23:40:22] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-18 23:40:23] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-18 23:40:23] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 0 ms to minimize.
[2023-03-18 23:40:24] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 13 ms to minimize.
[2023-03-18 23:40:24] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-18 23:40:24] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-18 23:40:24] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 1 ms to minimize.
[2023-03-18 23:40:25] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-18 23:40:25] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-18 23:40:25] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-18 23:40:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5440 ms
[2023-03-18 23:40:26] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-03-18 23:40:26] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2023-03-18 23:40:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 643 ms
[2023-03-18 23:40:26] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 0 ms to minimize.
[2023-03-18 23:40:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-18 23:40:27] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-18 23:40:27] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 13 ms to minimize.
[2023-03-18 23:40:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-18 23:40:27] [INFO ] After 9487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 475 ms.
[2023-03-18 23:40:28] [INFO ] After 10833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 416 ms.
Support contains 7 out of 2505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 123 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2505/2505 places, 2406/2406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 105 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2023-03-18 23:40:29] [INFO ] Invariant cache hit.
[2023-03-18 23:40:31] [INFO ] Implicit Places using invariants in 2333 ms returned []
[2023-03-18 23:40:31] [INFO ] Invariant cache hit.
[2023-03-18 23:40:37] [INFO ] Implicit Places using invariants and state equation in 5678 ms returned []
Implicit Place search using SMT with State Equation took 8040 ms to find 0 implicit places.
[2023-03-18 23:40:37] [INFO ] Redundant transitions in 185 ms returned []
[2023-03-18 23:40:37] [INFO ] Invariant cache hit.
[2023-03-18 23:40:39] [INFO ] Dead Transitions using invariants and state equation in 2415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10775 ms. Remains : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 178 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-18 23:40:40] [INFO ] Invariant cache hit.
[2023-03-18 23:40:40] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:40:41] [INFO ] [Nat]Absence check using 897 positive place invariants in 346 ms returned sat
[2023-03-18 23:40:41] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 38 ms returned sat
[2023-03-18 23:40:43] [INFO ] After 2240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 23:40:44] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2023-03-18 23:40:44] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-18 23:40:44] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-18 23:40:45] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 7 ms to minimize.
[2023-03-18 23:40:45] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-18 23:40:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1511 ms
[2023-03-18 23:40:45] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-18 23:40:45] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-18 23:40:46] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2023-03-18 23:40:46] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2023-03-18 23:40:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 895 ms
[2023-03-18 23:40:46] [INFO ] After 5096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 479 ms.
[2023-03-18 23:40:47] [INFO ] After 6706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 1202 stabilizing places and 1202 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1289 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:40:49] [INFO ] Computed 901 place invariants in 60 ms
[2023-03-18 23:40:51] [INFO ] Implicit Places using invariants in 2248 ms returned []
[2023-03-18 23:40:51] [INFO ] Invariant cache hit.
[2023-03-18 23:40:53] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 4328 ms to find 0 implicit places.
[2023-03-18 23:40:53] [INFO ] Invariant cache hit.
[2023-03-18 23:40:58] [INFO ] Dead Transitions using invariants and state equation in 4856 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10476 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 312 ms :[(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=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2221 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2662 ms.
Product exploration explored 100000 steps with 50000 reset in 2464 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-01 finished in 16336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5302 transition count 5202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5302 transition count 5202
Applied a total of 10 rules in 1278 ms. Remains 5302 /5307 variables (removed 5) and now considering 5202/5207 (removed 5) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-18 23:41:05] [INFO ] Computed 901 place invariants in 45 ms
[2023-03-18 23:41:08] [INFO ] Implicit Places using invariants in 3364 ms returned []
[2023-03-18 23:41:08] [INFO ] Invariant cache hit.
[2023-03-18 23:41:13] [INFO ] Implicit Places using invariants and state equation in 5319 ms returned []
Implicit Place search using SMT with State Equation took 8715 ms to find 0 implicit places.
[2023-03-18 23:41:14] [INFO ] Invariant cache hit.
[2023-03-18 23:41:21] [INFO ] Dead Transitions using invariants and state equation in 7159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5307 places, 5202/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17167 ms. Remains : 5302/5307 places, 5202/5207 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (NEQ s2658 0) (NEQ s3608 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12211 steps with 0 reset in 247 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-03 finished in 17875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1292 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:41:23] [INFO ] Computed 901 place invariants in 56 ms
[2023-03-18 23:41:25] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2023-03-18 23:41:25] [INFO ] Invariant cache hit.
[2023-03-18 23:41:26] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
[2023-03-18 23:41:26] [INFO ] Invariant cache hit.
[2023-03-18 23:41:34] [INFO ] Dead Transitions using invariants and state equation in 8006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13095 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s3879 0) (EQ s2205 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 890 steps with 0 reset in 9 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-05 finished in 13319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(((p1 U X(p2)) U p0))))))'
Support contains 6 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1307 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:41:36] [INFO ] Computed 901 place invariants in 23 ms
[2023-03-18 23:41:38] [INFO ] Implicit Places using invariants in 2431 ms returned []
[2023-03-18 23:41:38] [INFO ] Invariant cache hit.
[2023-03-18 23:41:43] [INFO ] Implicit Places using invariants and state equation in 4501 ms returned []
Implicit Place search using SMT with State Equation took 6937 ms to find 0 implicit places.
[2023-03-18 23:41:43] [INFO ] Invariant cache hit.
[2023-03-18 23:41:54] [INFO ] Dead Transitions using invariants and state equation in 10690 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18963 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 496 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 1766 ms.
Product exploration explored 100000 steps with 9 reset in 2207 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 469 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 253 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 486 ms. (steps per millisecond=20 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 100763 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100763 steps, saw 99301 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-18 23:42:03] [INFO ] Invariant cache hit.
[2023-03-18 23:42:05] [INFO ] After 1620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 23:42:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 957 ms returned sat
[2023-03-18 23:42:16] [INFO ] After 7022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-18 23:42:18] [INFO ] Deduced a trap composed of 14 places in 1744 ms of which 4 ms to minimize.
[2023-03-18 23:42:20] [INFO ] Deduced a trap composed of 35 places in 2269 ms of which 3 ms to minimize.
[2023-03-18 23:42:23] [INFO ] Deduced a trap composed of 11 places in 2381 ms of which 4 ms to minimize.
[2023-03-18 23:42:25] [INFO ] Deduced a trap composed of 27 places in 1876 ms of which 3 ms to minimize.
[2023-03-18 23:42:32] [INFO ] Deduced a trap composed of 18 places in 6590 ms of which 28 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 23:42:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:42:32] [INFO ] After 27034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2815 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 23 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 15 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 1379 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 1379 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 9) seen :2
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
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 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 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 150 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-18 23:42:37] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-18 23:42:38] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:42:39] [INFO ] [Nat]Absence check using 898 positive place invariants in 405 ms returned sat
[2023-03-18 23:42:39] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-18 23:42:43] [INFO ] After 3548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 19 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 23 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 62 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2301 ms
[2023-03-18 23:42:46] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-18 23:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 0 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1291 ms
[2023-03-18 23:42:48] [INFO ] After 8374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 736 ms.
[2023-03-18 23:42:48] [INFO ] After 10534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 573 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 108 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 108 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 59965 steps, run timeout after 3005 ms. (steps per millisecond=19 ) properties seen :{1=1, 2=1, 4=1, 5=1}
Probabilistic random walk after 59965 steps, saw 59236 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-18 23:42:54] [INFO ] Invariant cache hit.
[2023-03-18 23:42:55] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:42:57] [INFO ] [Nat]Absence check using 898 positive place invariants in 1516 ms returned sat
[2023-03-18 23:42:57] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:43:01] [INFO ] After 3974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:43:01] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 1 ms to minimize.
[2023-03-18 23:43:01] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-18 23:43:02] [INFO ] Deduced a trap composed of 8 places in 908 ms of which 2 ms to minimize.
[2023-03-18 23:43:03] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 0 ms to minimize.
[2023-03-18 23:43:06] [INFO ] Deduced a trap composed of 17 places in 3204 ms of which 1 ms to minimize.
[2023-03-18 23:43:07] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-18 23:43:07] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-18 23:43:07] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 2 ms to minimize.
[2023-03-18 23:43:09] [INFO ] Deduced a trap composed of 8 places in 926 ms of which 1 ms to minimize.
[2023-03-18 23:43:09] [INFO ] Deduced a trap composed of 23 places in 873 ms of which 0 ms to minimize.
[2023-03-18 23:43:10] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-18 23:43:10] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2023-03-18 23:43:11] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 1 ms to minimize.
[2023-03-18 23:43:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 9929 ms
[2023-03-18 23:43:11] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 0 ms to minimize.
[2023-03-18 23:43:12] [INFO ] Deduced a trap composed of 8 places in 958 ms of which 1 ms to minimize.
[2023-03-18 23:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1663 ms
[2023-03-18 23:43:13] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 1 ms to minimize.
[2023-03-18 23:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 488 ms
[2023-03-18 23:43:13] [INFO ] After 16361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-18 23:43:13] [INFO ] After 18916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 253 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 117 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93539 steps, run timeout after 3005 ms. (steps per millisecond=31 ) properties seen :{2=1}
Probabilistic random walk after 93539 steps, saw 92643 distinct states, run finished after 3005 ms. (steps per millisecond=31 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-18 23:43:18] [INFO ] Invariant cache hit.
[2023-03-18 23:43:18] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:43:19] [INFO ] [Nat]Absence check using 898 positive place invariants in 157 ms returned sat
[2023-03-18 23:43:19] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 23:43:20] [INFO ] After 1377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:43:20] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-18 23:43:21] [INFO ] Deduced a trap composed of 8 places in 900 ms of which 1 ms to minimize.
[2023-03-18 23:43:21] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-18 23:43:22] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2023-03-18 23:43:22] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-18 23:43:22] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:43:23] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-18 23:43:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2670 ms
[2023-03-18 23:43:23] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-18 23:43:23] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-18 23:43:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 641 ms
[2023-03-18 23:43:24] [INFO ] After 4947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-03-18 23:43:24] [INFO ] After 5805ms 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 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 279 ms. (steps per millisecond=35 ) 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 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98707 steps, run timeout after 3002 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98707 steps, saw 97785 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:43:28] [INFO ] Invariant cache hit.
[2023-03-18 23:43:28] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:43:29] [INFO ] [Nat]Absence check using 898 positive place invariants in 293 ms returned sat
[2023-03-18 23:43:29] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-18 23:43:31] [INFO ] After 1779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:43:31] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2023-03-18 23:43:31] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-18 23:43:32] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2023-03-18 23:43:32] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-18 23:43:32] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-18 23:43:33] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-18 23:43:33] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2023-03-18 23:43:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2164 ms
[2023-03-18 23:43:33] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-18 23:43:34] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-18 23:43:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2023-03-18 23:43:34] [INFO ] After 4843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-18 23:43:34] [INFO ] After 6036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 145 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 102 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 102 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 132 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2023-03-18 23:43:35] [INFO ] Invariant cache hit.
[2023-03-18 23:43:37] [INFO ] Implicit Places using invariants in 2393 ms returned []
[2023-03-18 23:43:37] [INFO ] Invariant cache hit.
[2023-03-18 23:43:47] [INFO ] Implicit Places using invariants and state equation in 10363 ms returned []
Implicit Place search using SMT with State Equation took 12765 ms to find 0 implicit places.
[2023-03-18 23:43:47] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-18 23:43:47] [INFO ] Invariant cache hit.
[2023-03-18 23:43:50] [INFO ] Dead Transitions using invariants and state equation in 2320 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15304 ms. Remains : 2503/2503 places, 2404/2404 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 : [(F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 988 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 316 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 340 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 740 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:43:52] [INFO ] Computed 901 place invariants in 23 ms
[2023-03-18 23:43:54] [INFO ] Implicit Places using invariants in 2359 ms returned []
[2023-03-18 23:43:55] [INFO ] Invariant cache hit.
[2023-03-18 23:43:57] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 4478 ms to find 0 implicit places.
[2023-03-18 23:43:57] [INFO ] Invariant cache hit.
[2023-03-18 23:44:03] [INFO ] Dead Transitions using invariants and state equation in 5972 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11206 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 p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1558 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 320 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 439 ms. (steps per millisecond=22 ) 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 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 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 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 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 28 ms. (steps per millisecond=357 ) 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
Interrupted probabilistic random walk after 75726 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75726 steps, saw 74758 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-18 23:44:08] [INFO ] Invariant cache hit.
[2023-03-18 23:44:10] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 23:44:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 1391 ms returned sat
[2023-03-18 23:44:21] [INFO ] After 6901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-18 23:44:23] [INFO ] Deduced a trap composed of 14 places in 2510 ms of which 4 ms to minimize.
[2023-03-18 23:44:26] [INFO ] Deduced a trap composed of 35 places in 2355 ms of which 4 ms to minimize.
[2023-03-18 23:44:28] [INFO ] Deduced a trap composed of 11 places in 2217 ms of which 4 ms to minimize.
[2023-03-18 23:44:32] [INFO ] Deduced a trap composed of 27 places in 3122 ms of which 4 ms to minimize.
[2023-03-18 23:44:34] [INFO ] Deduced a trap composed of 18 places in 1976 ms of which 3 ms to minimize.
[2023-03-18 23:44:37] [INFO ] Deduced a trap composed of 20 places in 3093 ms of which 6 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 23:44:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:44:37] [INFO ] After 27486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2402 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 24 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 14 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 1273 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 1273 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-18 23:44:43] [INFO ] Computed 900 place invariants in 37 ms
[2023-03-18 23:44:43] [INFO ] After 662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:44:45] [INFO ] [Nat]Absence check using 898 positive place invariants in 262 ms returned sat
[2023-03-18 23:44:45] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:44:48] [INFO ] After 2486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:44:50] [INFO ] Deduced a trap composed of 4 places in 2331 ms of which 1 ms to minimize.
[2023-03-18 23:44:50] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-18 23:44:51] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 0 ms to minimize.
[2023-03-18 23:44:51] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-18 23:44:52] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-18 23:44:52] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-18 23:44:52] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-18 23:44:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4745 ms
[2023-03-18 23:44:54] [INFO ] Deduced a trap composed of 11 places in 714 ms of which 1 ms to minimize.
[2023-03-18 23:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 943 ms
[2023-03-18 23:44:55] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 0 ms to minimize.
[2023-03-18 23:44:55] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2023-03-18 23:44:55] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-18 23:44:56] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-18 23:44:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1361 ms
[2023-03-18 23:44:56] [INFO ] After 10595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 853 ms.
[2023-03-18 23:44:57] [INFO ] After 13102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 756 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 117 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 117 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) 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 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 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 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
Interrupted probabilistic random walk after 62989 steps, run timeout after 3005 ms. (steps per millisecond=20 ) properties seen :{1=1, 2=1, 4=1, 5=1}
Probabilistic random walk after 62989 steps, saw 62245 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-18 23:45:02] [INFO ] Invariant cache hit.
[2023-03-18 23:45:02] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:45:04] [INFO ] [Nat]Absence check using 898 positive place invariants in 711 ms returned sat
[2023-03-18 23:45:04] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:45:06] [INFO ] After 1890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 23:45:06] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 0 ms to minimize.
[2023-03-18 23:45:07] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2023-03-18 23:45:08] [INFO ] Deduced a trap composed of 8 places in 1192 ms of which 1 ms to minimize.
[2023-03-18 23:45:08] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-18 23:45:08] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-18 23:45:09] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-18 23:45:09] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 1 ms to minimize.
[2023-03-18 23:45:10] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 0 ms to minimize.
[2023-03-18 23:45:10] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-18 23:45:10] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 0 ms to minimize.
[2023-03-18 23:45:11] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2023-03-18 23:45:11] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2023-03-18 23:45:11] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2023-03-18 23:45:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5554 ms
[2023-03-18 23:45:12] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 0 ms to minimize.
[2023-03-18 23:45:12] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-18 23:45:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 830 ms
[2023-03-18 23:45:13] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 0 ms to minimize.
[2023-03-18 23:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-18 23:45:13] [INFO ] After 9059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 459 ms.
[2023-03-18 23:45:13] [INFO ] After 11016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 269 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 101 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 101 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 87378 steps, run timeout after 3004 ms. (steps per millisecond=29 ) properties seen :{2=1}
Probabilistic random walk after 87378 steps, saw 86513 distinct states, run finished after 3004 ms. (steps per millisecond=29 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-18 23:45:18] [INFO ] Invariant cache hit.
[2023-03-18 23:45:18] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:45:19] [INFO ] [Nat]Absence check using 898 positive place invariants in 225 ms returned sat
[2023-03-18 23:45:19] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:45:21] [INFO ] After 1859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:45:21] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2023-03-18 23:45:22] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-18 23:45:22] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-18 23:45:22] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 0 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-18 23:45:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2364 ms
[2023-03-18 23:45:24] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-18 23:45:24] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
[2023-03-18 23:45:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 693 ms
[2023-03-18 23:45:24] [INFO ] After 5115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-18 23:45:24] [INFO ] After 6462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 235 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 130 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 130 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 94334 steps, run timeout after 3003 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94334 steps, saw 93434 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:45:28] [INFO ] Invariant cache hit.
[2023-03-18 23:45:29] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:45:29] [INFO ] [Nat]Absence check using 898 positive place invariants in 177 ms returned sat
[2023-03-18 23:45:29] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:45:32] [INFO ] After 1964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:45:32] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-18 23:45:32] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-18 23:45:33] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-18 23:45:33] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2023-03-18 23:45:33] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-18 23:45:34] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-18 23:45:34] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-18 23:45:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2570 ms
[2023-03-18 23:45:35] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2023-03-18 23:45:35] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-18 23:45:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 638 ms
[2023-03-18 23:45:35] [INFO ] After 5447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-18 23:45:35] [INFO ] After 6434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 222 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 112 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 112 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 103 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2023-03-18 23:45:36] [INFO ] Invariant cache hit.
[2023-03-18 23:45:38] [INFO ] Implicit Places using invariants in 2413 ms returned []
[2023-03-18 23:45:38] [INFO ] Invariant cache hit.
[2023-03-18 23:45:43] [INFO ] Implicit Places using invariants and state equation in 5301 ms returned []
Implicit Place search using SMT with State Equation took 7717 ms to find 0 implicit places.
[2023-03-18 23:45:44] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-18 23:45:44] [INFO ] Invariant cache hit.
[2023-03-18 23:45:46] [INFO ] Dead Transitions using invariants and state equation in 2807 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10750 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1572 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 381 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 390 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1864 ms.
Product exploration explored 100000 steps with 8 reset in 2397 ms.
Built C files in :
/tmp/ltsmin12295005654835167442
[2023-03-18 23:45:54] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12295005654835167442
Running compilation step : cd /tmp/ltsmin12295005654835167442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12295005654835167442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12295005654835167442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 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 793 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:45:58] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-18 23:46:00] [INFO ] Implicit Places using invariants in 2566 ms returned []
[2023-03-18 23:46:00] [INFO ] Invariant cache hit.
[2023-03-18 23:46:03] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 5155 ms to find 0 implicit places.
[2023-03-18 23:46:03] [INFO ] Invariant cache hit.
[2023-03-18 23:46:08] [INFO ] Dead Transitions using invariants and state equation in 5073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11026 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Built C files in :
/tmp/ltsmin9956766707919501394
[2023-03-18 23:46:08] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9956766707919501394
Running compilation step : cd /tmp/ltsmin9956766707919501394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9956766707919501394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9956766707919501394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 23:46:12] [INFO ] Flatten gal took : 183 ms
[2023-03-18 23:46:12] [INFO ] Flatten gal took : 173 ms
[2023-03-18 23:46:12] [INFO ] Time to serialize gal into /tmp/LTL6570672671201584472.gal : 35 ms
[2023-03-18 23:46:12] [INFO ] Time to serialize properties into /tmp/LTL10629888862344768285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6570672671201584472.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5437849580903020395.hoa' '-atoms' '/tmp/LTL10629888862344768285.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10629888862344768285.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5437849580903020395.hoa
Detected timeout of ITS tools.
[2023-03-18 23:46:27] [INFO ] Flatten gal took : 187 ms
[2023-03-18 23:46:27] [INFO ] Flatten gal took : 143 ms
[2023-03-18 23:46:27] [INFO ] Time to serialize gal into /tmp/LTL9935947974186467192.gal : 26 ms
[2023-03-18 23:46:27] [INFO ] Time to serialize properties into /tmp/LTL9372187013652448895.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9935947974186467192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9372187013652448895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((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.
[2023-03-18 23:46:43] [INFO ] Flatten gal took : 212 ms
[2023-03-18 23:46:43] [INFO ] Applying decomposition
[2023-03-18 23:46:43] [INFO ] Flatten gal took : 142 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4790729798014797502.txt' '-o' '/tmp/graph4790729798014797502.bin' '-w' '/tmp/graph4790729798014797502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4790729798014797502.bin' '-l' '-1' '-v' '-w' '/tmp/graph4790729798014797502.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:46:44] [INFO ] Decomposing Gal with order
[2023-03-18 23:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:46:45] [INFO ] Removed a total of 2300 redundant transitions.
[2023-03-18 23:46:45] [INFO ] Flatten gal took : 435 ms
[2023-03-18 23:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 35 ms.
[2023-03-18 23:46:45] [INFO ] Time to serialize gal into /tmp/LTL12476266265271499459.gal : 61 ms
[2023-03-18 23:46:45] [INFO ] Time to serialize properties into /tmp/LTL14445888519794077246.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12476266265271499459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14445888519794077246.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F(G((("((i13.i0.i3.u407.p1191==0)||(i57.i1.i5.u1804.p5395==1))")U(X("((i42.i0.i4.u1315.p3929==0)||(i25.u795.p2368==1))")))U("((i...272
Formula 0 simplified : X(!"((i5.i0.i2.u166.p470==0)||(i60.i0.i3.u1874.p5605==1))" | GF((!"((i13.i0.i3.u407.p1191==0)||(i57.i1.i5.u1804.p5395==1))" R X!"((i...264
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16001769746959729036
[2023-03-18 23:47:01] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16001769746959729036
Running compilation step : cd /tmp/ltsmin16001769746959729036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16001769746959729036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16001769746959729036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-07 finished in 329029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(G(p1) U G(p2)))))'
Support contains 6 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1552 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:47:05] [INFO ] Computed 901 place invariants in 52 ms
[2023-03-18 23:47:08] [INFO ] Implicit Places using invariants in 2759 ms returned []
[2023-03-18 23:47:08] [INFO ] Invariant cache hit.
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 5233 ms to find 0 implicit places.
[2023-03-18 23:47:11] [INFO ] Invariant cache hit.
[2023-03-18 23:47:14] [INFO ] Dead Transitions using invariants and state equation in 3917 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10706 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 436 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 33250 reset in 2168 ms.
Product exploration explored 100000 steps with 33445 reset in 2181 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 p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 938 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 435 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 495 ms. (steps per millisecond=20 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 23:47:22] [INFO ] Invariant cache hit.
[2023-03-18 23:47:23] [INFO ] After 1491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 23:47:25] [INFO ] [Nat]Absence check using 901 positive place invariants in 979 ms returned sat
[2023-03-18 23:47:34] [INFO ] After 7506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 23:47:37] [INFO ] Deduced a trap composed of 24 places in 2838 ms of which 3 ms to minimize.
[2023-03-18 23:47:40] [INFO ] Deduced a trap composed of 20 places in 2628 ms of which 2 ms to minimize.
[2023-03-18 23:47:43] [INFO ] Deduced a trap composed of 16 places in 2824 ms of which 5 ms to minimize.
[2023-03-18 23:47:46] [INFO ] Deduced a trap composed of 28 places in 3546 ms of which 6 ms to minimize.
[2023-03-18 23:47:49] [INFO ] Deduced a trap composed of 22 places in 2560 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 23:47:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:47:49] [INFO ] After 26037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 1 properties in 2360 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 22 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 14 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 1207 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 1207 ms. Remains : 2506/5303 places, 2407/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 61034 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61034 steps, saw 60314 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-18 23:47:57] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-18 23:47:58] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:47:59] [INFO ] [Nat]Absence check using 898 positive place invariants in 276 ms returned sat
[2023-03-18 23:47:59] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:48:03] [INFO ] After 4017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:48:05] [INFO ] Deduced a trap composed of 5 places in 1424 ms of which 0 ms to minimize.
[2023-03-18 23:48:05] [INFO ] Deduced a trap composed of 8 places in 386 ms of which 1 ms to minimize.
[2023-03-18 23:48:05] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-18 23:48:06] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 0 ms to minimize.
[2023-03-18 23:48:06] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-18 23:48:06] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-18 23:48:07] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 1 ms to minimize.
[2023-03-18 23:48:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3925 ms
[2023-03-18 23:48:07] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-18 23:48:08] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2023-03-18 23:48:08] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 0 ms to minimize.
[2023-03-18 23:48:08] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2023-03-18 23:48:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1317 ms
[2023-03-18 23:48:09] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 0 ms to minimize.
[2023-03-18 23:48:09] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2023-03-18 23:48:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 740 ms
[2023-03-18 23:48:10] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 0 ms to minimize.
[2023-03-18 23:48:10] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-18 23:48:10] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-18 23:48:11] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-18 23:48:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1472 ms
[2023-03-18 23:48:11] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2023-03-18 23:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-18 23:48:12] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2023-03-18 23:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-18 23:48:12] [INFO ] After 12933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1004 ms.
[2023-03-18 23:48:13] [INFO ] After 15252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1169 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 110 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 110 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 117 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2023-03-18 23:48:14] [INFO ] Invariant cache hit.
[2023-03-18 23:48:17] [INFO ] Implicit Places using invariants in 2847 ms returned []
[2023-03-18 23:48:17] [INFO ] Invariant cache hit.
[2023-03-18 23:48:24] [INFO ] Implicit Places using invariants and state equation in 6303 ms returned []
Implicit Place search using SMT with State Equation took 9159 ms to find 0 implicit places.
[2023-03-18 23:48:24] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-18 23:48:24] [INFO ] Invariant cache hit.
[2023-03-18 23:48:27] [INFO ] Dead Transitions using invariants and state equation in 3250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12622 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 113 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-18 23:48:27] [INFO ] Invariant cache hit.
[2023-03-18 23:48:28] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:48:29] [INFO ] [Nat]Absence check using 898 positive place invariants in 261 ms returned sat
[2023-03-18 23:48:29] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:48:32] [INFO ] After 3107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:48:33] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-18 23:48:33] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 22 ms to minimize.
[2023-03-18 23:48:33] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-18 23:48:33] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-18 23:48:34] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 1 ms to minimize.
[2023-03-18 23:48:34] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2023-03-18 23:48:34] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 0 ms to minimize.
[2023-03-18 23:48:34] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2023-03-18 23:48:35] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 23 ms to minimize.
[2023-03-18 23:48:35] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2023-03-18 23:48:35] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-18 23:48:35] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 1 ms to minimize.
[2023-03-18 23:48:36] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-18 23:48:36] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 0 ms to minimize.
[2023-03-18 23:48:36] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 1 ms to minimize.
[2023-03-18 23:48:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4417 ms
[2023-03-18 23:48:37] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2023-03-18 23:48:38] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 1 ms to minimize.
[2023-03-18 23:48:38] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2023-03-18 23:48:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 964 ms
[2023-03-18 23:48:38] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2023-03-18 23:48:39] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-18 23:48:39] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2023-03-18 23:48:39] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-18 23:48:39] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-18 23:48:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1430 ms
[2023-03-18 23:48:40] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-18 23:48:40] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 1 ms to minimize.
[2023-03-18 23:48:40] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-18 23:48:41] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-18 23:48:41] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-18 23:48:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1580 ms
[2023-03-18 23:48:41] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-18 23:48:42] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-18 23:48:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2023-03-18 23:48:42] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2023-03-18 23:48:42] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 48 ms to minimize.
[2023-03-18 23:48:43] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 1 ms to minimize.
[2023-03-18 23:48:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1150 ms
[2023-03-18 23:48:43] [INFO ] After 13999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 880 ms.
[2023-03-18 23:48:44] [INFO ] After 16299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 15 factoid took 1523 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 476 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 491 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 21 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 1180 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-18 23:48:48] [INFO ] Computed 900 place invariants in 11 ms
[2023-03-18 23:48:51] [INFO ] Implicit Places using invariants in 3007 ms returned []
[2023-03-18 23:48:51] [INFO ] Invariant cache hit.
[2023-03-18 23:48:56] [INFO ] Implicit Places using invariants and state equation in 5443 ms returned []
Implicit Place search using SMT with State Equation took 8518 ms to find 0 implicit places.
[2023-03-18 23:48:57] [INFO ] Redundant transitions in 587 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
[2023-03-18 23:48:57] [INFO ] Computed 900 place invariants in 24 ms
[2023-03-18 23:48:59] [INFO ] Dead Transitions using invariants and state equation in 2346 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 132 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 12785 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 p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 17 factoid took 2381 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 481 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 355 ms. (steps per millisecond=28 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 23:49:04] [INFO ] Invariant cache hit.
[2023-03-18 23:49:04] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:49:05] [INFO ] [Nat]Absence check using 900 positive place invariants in 205 ms returned sat
[2023-03-18 23:49:08] [INFO ] After 2429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:49:08] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-03-18 23:49:08] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-18 23:49:09] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-18 23:49:09] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-18 23:49:09] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-18 23:49:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1318 ms
[2023-03-18 23:49:11] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2023-03-18 23:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-18 23:49:11] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-18 23:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-18 23:49:11] [INFO ] After 5692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 955 ms.
[2023-03-18 23:49:12] [INFO ] After 7915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1234 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 229 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 229 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 70528 steps, run timeout after 3034 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70528 steps, saw 69761 distinct states, run finished after 3034 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2406 rows 2506 cols
[2023-03-18 23:49:19] [INFO ] Computed 900 place invariants in 16 ms
[2023-03-18 23:49:19] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:49:20] [INFO ] [Nat]Absence check using 900 positive place invariants in 200 ms returned sat
[2023-03-18 23:49:23] [INFO ] After 2357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:49:23] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 1 ms to minimize.
[2023-03-18 23:49:24] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-18 23:49:24] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 0 ms to minimize.
[2023-03-18 23:49:24] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
[2023-03-18 23:49:25] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 0 ms to minimize.
[2023-03-18 23:49:25] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2023-03-18 23:49:25] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2023-03-18 23:49:25] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 27 ms to minimize.
[2023-03-18 23:49:26] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-18 23:49:26] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-18 23:49:26] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2023-03-18 23:49:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3580 ms
[2023-03-18 23:49:27] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-18 23:49:27] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-18 23:49:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 612 ms
[2023-03-18 23:49:28] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-18 23:49:28] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 11 ms to minimize.
[2023-03-18 23:49:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2023-03-18 23:49:29] [INFO ] After 8501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 927 ms.
[2023-03-18 23:49:30] [INFO ] After 10742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 915 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 126 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 126 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 117 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2023-03-18 23:49:31] [INFO ] Invariant cache hit.
[2023-03-18 23:49:39] [INFO ] Implicit Places using invariants in 8186 ms returned []
[2023-03-18 23:49:39] [INFO ] Invariant cache hit.
[2023-03-18 23:49:45] [INFO ] Implicit Places using invariants and state equation in 5486 ms returned []
Implicit Place search using SMT with State Equation took 13714 ms to find 0 implicit places.
[2023-03-18 23:49:45] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-18 23:49:45] [INFO ] Invariant cache hit.
[2023-03-18 23:49:48] [INFO ] Dead Transitions using invariants and state equation in 3031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16965 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 123 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-18 23:49:48] [INFO ] Invariant cache hit.
[2023-03-18 23:49:49] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:49:50] [INFO ] [Nat]Absence check using 900 positive place invariants in 390 ms returned sat
[2023-03-18 23:49:53] [INFO ] After 2376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:49:53] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2023-03-18 23:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2023-03-18 23:49:53] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 2 ms to minimize.
[2023-03-18 23:49:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-18 23:49:54] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-18 23:49:54] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-03-18 23:49:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 560 ms
[2023-03-18 23:49:55] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-18 23:49:55] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-03-18 23:49:56] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2023-03-18 23:49:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1002 ms
[2023-03-18 23:49:56] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2023-03-18 23:49:56] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-18 23:49:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 560 ms
[2023-03-18 23:49:56] [INFO ] After 6217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 937 ms.
[2023-03-18 23:49:57] [INFO ] After 8779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 2242 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 450 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 506 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 450 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)]
Entered a terminal (fully accepting) state of product in 5054 steps with 0 reset in 187 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-08 finished in 177675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(X(F(p1))&&F(p2))))'
Support contains 3 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5302 transition count 5202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5302 transition count 5202
Applied a total of 10 rules in 1486 ms. Remains 5302 /5307 variables (removed 5) and now considering 5202/5207 (removed 5) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-18 23:50:03] [INFO ] Computed 901 place invariants in 27 ms
[2023-03-18 23:50:05] [INFO ] Implicit Places using invariants in 2586 ms returned []
[2023-03-18 23:50:05] [INFO ] Invariant cache hit.
[2023-03-18 23:50:07] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 4345 ms to find 0 implicit places.
[2023-03-18 23:50:07] [INFO ] Invariant cache hit.
[2023-03-18 23:50:12] [INFO ] Dead Transitions using invariants and state equation in 4491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5307 places, 5202/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10351 ms. Remains : 5302/5307 places, 5202/5207 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1610 0) (EQ s626 1)), p2:(OR (EQ s626 0) (EQ s1610 1)), p1:(EQ s954 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 26 reset in 1449 ms.
Product exploration explored 100000 steps with 24 reset in 1640 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 (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 425 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 208777 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{0=1}
Probabilistic random walk after 208777 steps, saw 204392 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-18 23:50:19] [INFO ] Invariant cache hit.
[2023-03-18 23:50:20] [INFO ] [Real]Absence check using 901 positive place invariants in 610 ms returned sat
[2023-03-18 23:50:25] [INFO ] After 6261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:50:27] [INFO ] [Nat]Absence check using 901 positive place invariants in 651 ms returned sat
[2023-03-18 23:50:32] [INFO ] After 5060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:50:35] [INFO ] Deduced a trap composed of 16 places in 2325 ms of which 3 ms to minimize.
[2023-03-18 23:50:37] [INFO ] Deduced a trap composed of 25 places in 2142 ms of which 3 ms to minimize.
[2023-03-18 23:50:39] [INFO ] Deduced a trap composed of 16 places in 2127 ms of which 3 ms to minimize.
[2023-03-18 23:50:42] [INFO ] Deduced a trap composed of 20 places in 2589 ms of which 3 ms to minimize.
[2023-03-18 23:50:46] [INFO ] Deduced a trap composed of 23 places in 3269 ms of which 4 ms to minimize.
[2023-03-18 23:50:48] [INFO ] Deduced a trap composed of 16 places in 2497 ms of which 7 ms to minimize.
[2023-03-18 23:50:51] [INFO ] Deduced a trap composed of 20 places in 2351 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 23:50:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:50:51] [INFO ] After 25449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 93 ms.
Support contains 1 out of 5302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5302/5302 places, 5202/5202 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 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 30 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
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 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1328 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1328 ms. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 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 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71291 steps, run visited all 1 properties in 1735 ms. (steps per millisecond=41 )
Probabilistic random walk after 71291 steps, saw 70509 distinct states, run finished after 1736 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 9 factoid took 480 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 23:50:55] [INFO ] Invariant cache hit.
[2023-03-18 23:51:05] [INFO ] [Real]Absence check using 901 positive place invariants in 3929 ms returned sat
[2023-03-18 23:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:51:11] [INFO ] [Real]Absence check using state equation in 5380 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 730 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
[2023-03-18 23:51:11] [INFO ] Invariant cache hit.
[2023-03-18 23:51:14] [INFO ] Implicit Places using invariants in 2391 ms returned []
[2023-03-18 23:51:14] [INFO ] Invariant cache hit.
[2023-03-18 23:51:16] [INFO ] Implicit Places using invariants and state equation in 2739 ms returned []
Implicit Place search using SMT with State Equation took 5150 ms to find 0 implicit places.
[2023-03-18 23:51:16] [INFO ] Invariant cache hit.
[2023-03-18 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 4861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10755 ms. Remains : 5302/5302 places, 5202/5202 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 291 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:51:22] [INFO ] Invariant cache hit.
[2023-03-18 23:51:24] [INFO ] [Real]Absence check using 901 positive place invariants in 675 ms returned sat
[2023-03-18 23:51:28] [INFO ] After 6164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:51:29] [INFO ] [Nat]Absence check using 901 positive place invariants in 616 ms returned sat
[2023-03-18 23:51:35] [INFO ] After 5147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:51:37] [INFO ] Deduced a trap composed of 16 places in 2419 ms of which 3 ms to minimize.
[2023-03-18 23:51:41] [INFO ] Deduced a trap composed of 25 places in 2814 ms of which 4 ms to minimize.
[2023-03-18 23:51:43] [INFO ] Deduced a trap composed of 16 places in 2390 ms of which 3 ms to minimize.
[2023-03-18 23:51:46] [INFO ] Deduced a trap composed of 20 places in 2448 ms of which 6 ms to minimize.
[2023-03-18 23:51:49] [INFO ] Deduced a trap composed of 23 places in 3007 ms of which 4 ms to minimize.
[2023-03-18 23:51:52] [INFO ] Deduced a trap composed of 16 places in 2362 ms of which 3 ms to minimize.
[2023-03-18 23:51:54] [INFO ] Deduced a trap composed of 20 places in 2157 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 23:51:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:51:54] [INFO ] After 25778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 5302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5302/5302 places, 5202/5202 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 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
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 4300 transition count 4200
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 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1312 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1313 ms. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71291 steps, run visited all 1 properties in 1767 ms. (steps per millisecond=40 )
Probabilistic random walk after 71291 steps, saw 70509 distinct states, run finished after 1769 ms. (steps per millisecond=40 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 23:51:58] [INFO ] Invariant cache hit.
[2023-03-18 23:52:08] [INFO ] [Real]Absence check using 901 positive place invariants in 4137 ms returned sat
[2023-03-18 23:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:52:13] [INFO ] [Real]Absence check using state equation in 5041 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25 reset in 1554 ms.
Product exploration explored 100000 steps with 25 reset in 1887 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5302/5302 places, 5202/5202 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 5302 transition count 5202
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 499 place count 5302 transition count 5204
Deduced a syphon composed of 700 places in 22 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 700 place count 5302 transition count 5204
Performed 2096 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2796 places in 14 ms
Iterating global reduction 1 with 2096 rules applied. Total rules applied 2796 place count 5302 transition count 5204
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 1 with 699 rule applications. Total rules 3495 place count 4603 transition count 4505
Deduced a syphon composed of 2097 places in 10 ms
Iterating global reduction 1 with 699 rules applied. Total rules applied 4194 place count 4603 transition count 4505
Deduced a syphon composed of 2097 places in 11 ms
Applied a total of 4194 rules in 5573 ms. Remains 4603 /5302 variables (removed 699) and now considering 4505/5202 (removed 697) transitions.
[2023-03-18 23:52:24] [INFO ] Redundant transitions in 956 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
[2023-03-18 23:52:24] [INFO ] Computed 901 place invariants in 198 ms
[2023-03-18 23:52:27] [INFO ] Dead Transitions using invariants and state equation in 3509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4603/5302 places, 4504/5202 transitions.
Deduced a syphon composed of 2097 places in 10 ms
Applied a total of 0 rules in 380 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 10450 ms. Remains : 4603/5302 places, 4504/5202 transitions.
Built C files in :
/tmp/ltsmin11514905365784866438
[2023-03-18 23:52:28] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11514905365784866438
Running compilation step : cd /tmp/ltsmin11514905365784866438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11514905365784866438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11514905365784866438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 569 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-18 23:52:32] [INFO ] Computed 901 place invariants in 18 ms
[2023-03-18 23:52:35] [INFO ] Implicit Places using invariants in 3501 ms returned []
[2023-03-18 23:52:35] [INFO ] Invariant cache hit.
[2023-03-18 23:52:38] [INFO ] Implicit Places using invariants and state equation in 3102 ms returned []
Implicit Place search using SMT with State Equation took 6641 ms to find 0 implicit places.
[2023-03-18 23:52:38] [INFO ] Invariant cache hit.
[2023-03-18 23:52:39] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7963 ms. Remains : 5302/5302 places, 5202/5202 transitions.
Built C files in :
/tmp/ltsmin15093059190948892924
[2023-03-18 23:52:39] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15093059190948892924
Running compilation step : cd /tmp/ltsmin15093059190948892924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15093059190948892924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15093059190948892924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 23:52:42] [INFO ] Flatten gal took : 177 ms
[2023-03-18 23:52:43] [INFO ] Flatten gal took : 163 ms
[2023-03-18 23:52:43] [INFO ] Time to serialize gal into /tmp/LTL16175303722165845929.gal : 23 ms
[2023-03-18 23:52:43] [INFO ] Time to serialize properties into /tmp/LTL17552276836656957013.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16175303722165845929.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10978001459941616666.hoa' '-atoms' '/tmp/LTL17552276836656957013.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p1812==0)&&(p696==1))")))||((X(F("(p1066==1)")))&&(F("((p696==0)||(p1812==1))")))))
Formula 0 simplified : FG!"((p1812==0)&&(p696==1))" & (XG!"(p1066==1)" | G!"((p696==0)||(p1812==1))")
Detected timeout of ITS tools.
[2023-03-18 23:53:13] [INFO ] Flatten gal took : 154 ms
[2023-03-18 23:53:13] [INFO ] Applying decomposition
[2023-03-18 23:53:14] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14388973277110372074.txt' '-o' '/tmp/graph14388973277110372074.bin' '-w' '/tmp/graph14388973277110372074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14388973277110372074.bin' '-l' '-1' '-v' '-w' '/tmp/graph14388973277110372074.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:53:14] [INFO ] Decomposing Gal with order
[2023-03-18 23:53:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:53:15] [INFO ] Removed a total of 2300 redundant transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 260 ms
[2023-03-18 23:53:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2023-03-18 23:53:15] [INFO ] Time to serialize gal into /tmp/LTL11265838477316161837.gal : 53 ms
[2023-03-18 23:53:15] [INFO ] Time to serialize properties into /tmp/LTL15389824891210965026.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11265838477316161837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15389824891210965026.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i19.u613.p1812==0)&&(i6.u241.p696==1))")))||((X(F("(i10.u365.p1066==1)")))&&(F("((i6.u241.p696==0)||(i19.u613.p1812==1))"))...158
Formula 0 simplified : FG!"((i19.u613.p1812==0)&&(i6.u241.p696==1))" & (XG!"(i10.u365.p1066==1)" | G!"((i6.u241.p696==0)||(i19.u613.p1812==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15434431135504731435
[2023-03-18 23:53:31] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15434431135504731435
Running compilation step : cd /tmp/ltsmin15434431135504731435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15434431135504731435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15434431135504731435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 212175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(!p1)))))'
Support contains 4 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1123 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:53:35] [INFO ] Computed 901 place invariants in 64 ms
[2023-03-18 23:53:37] [INFO ] Implicit Places using invariants in 2429 ms returned []
[2023-03-18 23:53:37] [INFO ] Invariant cache hit.
[2023-03-18 23:53:39] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 4715 ms to find 0 implicit places.
[2023-03-18 23:53:39] [INFO ] Invariant cache hit.
[2023-03-18 23:53:44] [INFO ] Dead Transitions using invariants and state equation in 4943 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10784 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, true, (NOT p0), p1, true]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s4444 0) (EQ s1455 1)), p0:(OR (EQ s5115 0) (EQ s4829 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]]
Entered a terminal (fully accepting) state of product in 638 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-14 finished in 11197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(((p1 U X(p2)) U p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(X(F(p1))&&F(p2))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100B-LTLCardinality-11
Stuttering acceptance computed with spot in 401 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5307/5307 places, 5207/5207 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 5306 transition count 4706
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4806 transition count 4706
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4806 transition count 4206
Deduced a syphon composed of 500 places in 23 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4306 transition count 4206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2005 place count 4301 transition count 4201
Iterating global reduction 2 with 5 rules applied. Total rules applied 2010 place count 4301 transition count 4201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2010 place count 4301 transition count 4199
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2014 place count 4299 transition count 4199
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 14 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5598 place count 2507 transition count 2407
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 5600 place count 2505 transition count 2405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5601 place count 2504 transition count 2405
Applied a total of 5601 rules in 1455 ms. Remains 2504 /5307 variables (removed 2803) and now considering 2405/5207 (removed 2802) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2023-03-18 23:53:47] [INFO ] Computed 900 place invariants in 11 ms
[2023-03-18 23:53:50] [INFO ] Implicit Places using invariants in 2719 ms returned []
[2023-03-18 23:53:50] [INFO ] Invariant cache hit.
[2023-03-18 23:53:54] [INFO ] Implicit Places using invariants and state equation in 4410 ms returned []
Implicit Place search using SMT with State Equation took 7131 ms to find 0 implicit places.
[2023-03-18 23:53:54] [INFO ] Invariant cache hit.
[2023-03-18 23:53:56] [INFO ] Dead Transitions using invariants and state equation in 2379 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2504/5307 places, 2405/5207 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10967 ms. Remains : 2504/5307 places, 2405/5207 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s731 0) (EQ s253 1)), p2:(OR (EQ s253 0) (EQ s731 1)), p1:(EQ s412 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13629 steps with 9 reset in 221 ms.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 11768 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-18 23:53:57] [INFO ] Flatten gal took : 133 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7636927704340942853
[2023-03-18 23:53:57] [INFO ] Too many transitions (5207) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:53:57] [INFO ] Applying decomposition
[2023-03-18 23:53:57] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7636927704340942853
Running compilation step : cd /tmp/ltsmin7636927704340942853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 23:53:57] [INFO ] Flatten gal took : 139 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph41935508121747677.txt' '-o' '/tmp/graph41935508121747677.bin' '-w' '/tmp/graph41935508121747677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph41935508121747677.bin' '-l' '-1' '-v' '-w' '/tmp/graph41935508121747677.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:53:58] [INFO ] Decomposing Gal with order
[2023-03-18 23:53:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:53:59] [INFO ] Removed a total of 2300 redundant transitions.
[2023-03-18 23:53:59] [INFO ] Flatten gal took : 260 ms
[2023-03-18 23:53:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2023-03-18 23:53:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality680572953789319579.gal : 57 ms
[2023-03-18 23:53:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality12392656449869539029.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality680572953789319579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12392656449869539029.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(("((i4.u168.p470==0)||(i62.i0.i1.u1877.p5605==1))")&&(F(G((("((i13.i0.i2.u406.p1191==0)||(i59.u1805.p5395==1))")U(X("((i42.u1315....254
Formula 0 simplified : X(!"((i4.u168.p470==0)||(i62.i0.i1.u1877.p5605==1))" | GF((!"((i13.i0.i2.u406.p1191==0)||(i59.u1805.p5395==1))" R X!"((i42.u1315.p39...246
Compilation finished in 18789 ms.
Running link step : cd /tmp/ltsmin7636927704340942853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 173 ms.
Running LTSmin : cd /tmp/ltsmin7636927704340942853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&<>([]((((LTLAPp1==true) U X((LTLAPp2==true))) U (LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 00:18:59] [INFO ] Applying decomposition
[2023-03-19 00:18:59] [INFO ] Flatten gal took : 356 ms
[2023-03-19 00:19:00] [INFO ] Decomposing Gal with order
[2023-03-19 00:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:19:11] [INFO ] Removed a total of 1600 redundant transitions.
[2023-03-19 00:19:12] [INFO ] Flatten gal took : 1959 ms
[2023-03-19 00:19:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 445 ms.
[2023-03-19 00:19:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality5676918996564952124.gal : 183 ms
[2023-03-19 00:19:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality1150306820741856917.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5676918996564952124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1150306820741856917.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...1489
Formula 0 simplified : X(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....1481
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin7636927704340942853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&<>([]((((LTLAPp1==true) U X((LTLAPp2==true))) U (LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7636927704340942853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp3==true)))||(X(<>((LTLAPp4==true)))&&<>((LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 145600 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7636927704340942853;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&<>([]((((LTLAPp1==true) U X((LTLAPp2==true))) U (LTLAPp0==true))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 1410420 kB
After kill :
MemTotal: 16393236 kB
MemFree: 15974548 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r389-oct2-167903713200171"
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 ;