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-167903713200143.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713200143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 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.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 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 675K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679176719321

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 21:58:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:58:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:58:42] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-18 21:58:42] [INFO ] Transformed 2403 places.
[2023-03-18 21:58:42] [INFO ] Transformed 2363 transitions.
[2023-03-18 21:58:42] [INFO ] Found NUPN structural information;
[2023-03-18 21:58:42] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 21:58:43] [INFO ] Flatten gal took : 311 ms
[2023-03-18 21:58:43] [INFO ] Flatten gal took : 176 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
[2023-03-18 21:58:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6393513435483006387.gal : 58 ms
[2023-03-18 21:58:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13849911971864589595.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6393513435483006387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13849911971864589595.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) 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
Running SMT prover for 8 properties.
// Phase 1: matrix 2363 rows 2403 cols
Loading property file /tmp/ReachabilityCardinality13849911971864589595.prop.
[2023-03-18 21:58:43] [INFO ] Computed 361 place invariants in 28 ms
[2023-03-18 21:58:44] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 21:58:45] [INFO ] [Nat]Absence check using 361 positive place invariants in 121 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 108
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :108 after 458
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :458 after 2307
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :2307 after 1.18742e+08
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.18742e+08 after 5.73678e+13
Reachability property ShieldIIPs-PT-040B-ReachabilityFireability-00 is true.
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :5.73678e+13 after 2.29848e+29
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :2.29848e+29 after 1.1113e+44
Reachability property ShieldIIPs-PT-040B-ReachabilityFireability-01 is true.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1.1113e+44 after 2.76284e+79
Invariant property ShieldIIPs-PT-040B-ReachabilityFireability-15 does not hold.
Invariant property ShieldIIPs-PT-040B-ReachabilityFireability-13 does not hold.
Reachability property ShieldIIPs-PT-040B-ReachabilityFireability-07 is true.
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2023-03-18 21:58:54] [INFO ] After 8861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 21:58:56] [INFO ] Deduced a trap composed of 22 places in 1285 ms of which 41 ms to minimize.
[2023-03-18 21:58:57] [INFO ] Deduced a trap composed of 18 places in 1185 ms of which 3 ms to minimize.
[2023-03-18 21:58:58] [INFO ] Deduced a trap composed of 21 places in 848 ms of which 23 ms to minimize.
[2023-03-18 21:58:59] [INFO ] Deduced a trap composed of 14 places in 1165 ms of which 16 ms to minimize.
[2023-03-18 21:59:00] [INFO ] Deduced a trap composed of 20 places in 680 ms of which 2 ms to minimize.
[2023-03-18 21:59:02] [INFO ] Deduced a trap composed of 17 places in 1372 ms of which 2 ms to minimize.
[2023-03-18 21:59:03] [INFO ] Deduced a trap composed of 29 places in 993 ms of which 7 ms to minimize.
[2023-03-18 21:59:04] [INFO ] Deduced a trap composed of 24 places in 1040 ms of which 2 ms to minimize.
[2023-03-18 21:59:05] [INFO ] Deduced a trap composed of 24 places in 919 ms of which 2 ms to minimize.
[2023-03-18 21:59:06] [INFO ] Deduced a trap composed of 14 places in 1078 ms of which 3 ms to minimize.
[2023-03-18 21:59:07] [INFO ] Deduced a trap composed of 19 places in 986 ms of which 2 ms to minimize.
[2023-03-18 21:59:08] [INFO ] Deduced a trap composed of 26 places in 985 ms of which 2 ms to minimize.
[2023-03-18 21:59:10] [INFO ] Deduced a trap composed of 18 places in 1095 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 21:59:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:59:10] [INFO ] After 25640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 989 ms.
Support contains 149 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 2403 transition count 2190
Reduce places removed 173 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 180 rules applied. Total rules applied 353 place count 2230 transition count 2183
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 360 place count 2223 transition count 2183
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 360 place count 2223 transition count 1985
Deduced a syphon composed of 198 places in 6 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 756 place count 2025 transition count 1985
Discarding 250 places :
Symmetric choice reduction at 3 with 250 rule applications. Total rules 1006 place count 1775 transition count 1735
Iterating global reduction 3 with 250 rules applied. Total rules applied 1256 place count 1775 transition count 1735
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1256 place count 1775 transition count 1651
Deduced a syphon composed of 84 places in 45 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1424 place count 1691 transition count 1651
Performed 538 Post agglomeration using F-continuation condition.Transition count delta: 538
Deduced a syphon composed of 538 places in 3 ms
Reduce places removed 538 places and 0 transitions.
Iterating global reduction 3 with 1076 rules applied. Total rules applied 2500 place count 1153 transition count 1113
Partial Free-agglomeration rule applied 245 times.
Drop transitions removed 245 transitions
Iterating global reduction 3 with 245 rules applied. Total rules applied 2745 place count 1153 transition count 1113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2746 place count 1152 transition count 1112
Applied a total of 2746 rules in 696 ms. Remains 1152 /2403 variables (removed 1251) and now considering 1112/2363 (removed 1251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 697 ms. Remains : 1152/2403 places, 1112/2363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 7) seen :3
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1112 rows 1152 cols
[2023-03-18 21:59:12] [INFO ] Computed 361 place invariants in 21 ms
[2023-03-18 21:59:12] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:59:13] [INFO ] [Nat]Absence check using 352 positive place invariants in 471 ms returned sat
[2023-03-18 21:59:13] [INFO ] [Nat]Absence check using 352 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-18 21:59:15] [INFO ] After 1834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:59:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:59:16] [INFO ] After 822ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 21:59:16] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-18 21:59:17] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 1 ms to minimize.
[2023-03-18 21:59:17] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 2 ms to minimize.
[2023-03-18 21:59:17] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 0 ms to minimize.
[2023-03-18 21:59:18] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2023-03-18 21:59:18] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-18 21:59:18] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-18 21:59:18] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2023-03-18 21:59:19] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 14 ms to minimize.
[2023-03-18 21:59:19] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 1 ms to minimize.
[2023-03-18 21:59:19] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2023-03-18 21:59:20] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 0 ms to minimize.
[2023-03-18 21:59:20] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
[2023-03-18 21:59:20] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 0 ms to minimize.
[2023-03-18 21:59:20] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2023-03-18 21:59:21] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-18 21:59:21] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 0 ms to minimize.
[2023-03-18 21:59:21] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:59:22] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-18 21:59:22] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 0 ms to minimize.
[2023-03-18 21:59:22] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 16 ms to minimize.
[2023-03-18 21:59:22] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2023-03-18 21:59:23] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2023-03-18 21:59:23] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2023-03-18 21:59:23] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 1 ms to minimize.
[2023-03-18 21:59:24] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 4 ms to minimize.
[2023-03-18 21:59:24] [INFO ] Deduced a trap composed of 12 places in 410 ms of which 21 ms to minimize.
[2023-03-18 21:59:24] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-18 21:59:25] [INFO ] Deduced a trap composed of 13 places in 574 ms of which 3 ms to minimize.
[2023-03-18 21:59:25] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 39 ms to minimize.
[2023-03-18 21:59:26] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 2 ms to minimize.
[2023-03-18 21:59:26] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:59:26] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2023-03-18 21:59:26] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 10530 ms
[2023-03-18 21:59:27] [INFO ] Deduced a trap composed of 5 places in 384 ms of which 0 ms to minimize.
[2023-03-18 21:59:28] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:59:28] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-18 21:59:28] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 2 ms to minimize.
[2023-03-18 21:59:28] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 13 ms to minimize.
[2023-03-18 21:59:29] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 23 ms to minimize.
[2023-03-18 21:59:30] [INFO ] Deduced a trap composed of 18 places in 749 ms of which 0 ms to minimize.
[2023-03-18 21:59:30] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 2 ms to minimize.
[2023-03-18 21:59:30] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 1 ms to minimize.
[2023-03-18 21:59:31] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 10 ms to minimize.
[2023-03-18 21:59:31] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-18 21:59:31] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 1 ms to minimize.
[2023-03-18 21:59:32] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 0 ms to minimize.
[2023-03-18 21:59:32] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-18 21:59:32] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-18 21:59:32] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-18 21:59:33] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-18 21:59:33] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 0 ms to minimize.
[2023-03-18 21:59:33] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-18 21:59:33] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2023-03-18 21:59:34] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-18 21:59:34] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-18 21:59:34] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 22 ms to minimize.
[2023-03-18 21:59:34] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2023-03-18 21:59:35] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2023-03-18 21:59:35] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-18 21:59:35] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 0 ms to minimize.
[2023-03-18 21:59:35] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8532 ms
[2023-03-18 21:59:36] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-18 21:59:37] [INFO ] Deduced a trap composed of 8 places in 466 ms of which 1 ms to minimize.
[2023-03-18 21:59:37] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2023-03-18 21:59:37] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-18 21:59:38] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 0 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.Application.startNoEx(Application.java:902)
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 21:59:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:59:38] [INFO ] After 25191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 269 ms.
Support contains 122 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 1112/1112 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1152 transition count 1110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1150 transition count 1110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1150 transition count 1108
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1148 transition count 1108
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 70 place count 1117 transition count 1077
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 1117 transition count 1077
Applied a total of 75 rules in 227 ms. Remains 1117 /1152 variables (removed 35) and now considering 1077/1112 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1117/1152 places, 1077/1112 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 74962 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74962 steps, saw 58275 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1077 rows 1117 cols
[2023-03-18 21:59:42] [INFO ] Computed 361 place invariants in 35 ms
[2023-03-18 21:59:42] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:59:42] [INFO ] [Nat]Absence check using 355 positive place invariants in 143 ms returned sat
[2023-03-18 21:59:42] [INFO ] [Nat]Absence check using 355 positive and 6 generalized place invariants in 33 ms returned sat
[2023-03-18 21:59:44] [INFO ] After 1231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:59:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:59:45] [INFO ] After 871ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 21:59:45] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-18 21:59:45] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 2 ms to minimize.
[2023-03-18 21:59:46] [INFO ] Deduced a trap composed of 6 places in 851 ms of which 1 ms to minimize.
[2023-03-18 21:59:46] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-18 21:59:47] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-18 21:59:47] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-18 21:59:47] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 1 ms to minimize.
[2023-03-18 21:59:48] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2023-03-18 21:59:48] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-18 21:59:48] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 1 ms to minimize.
[2023-03-18 21:59:48] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2023-03-18 21:59:49] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 0 ms to minimize.
[2023-03-18 21:59:49] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-18 21:59:49] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-18 21:59:50] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 0 ms to minimize.
[2023-03-18 21:59:50] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 0 ms to minimize.
[2023-03-18 21:59:50] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2023-03-18 21:59:50] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:59:51] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2023-03-18 21:59:51] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-18 21:59:51] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2023-03-18 21:59:51] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2023-03-18 21:59:51] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-18 21:59:52] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 0 ms to minimize.
[2023-03-18 21:59:52] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 1 ms to minimize.
[2023-03-18 21:59:52] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2023-03-18 21:59:52] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2023-03-18 21:59:53] [INFO ] Deduced a trap composed of 11 places in 712 ms of which 1 ms to minimize.
[2023-03-18 21:59:54] [INFO ] Deduced a trap composed of 8 places in 469 ms of which 25 ms to minimize.
[2023-03-18 21:59:54] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2023-03-18 21:59:54] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-18 21:59:55] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 0 ms to minimize.
[2023-03-18 21:59:55] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2023-03-18 21:59:55] [INFO ] Deduced a trap composed of 14 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:59:55] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10600 ms
[2023-03-18 21:59:56] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 1 ms to minimize.
[2023-03-18 21:59:56] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-18 21:59:56] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-18 21:59:57] [INFO ] Deduced a trap composed of 6 places in 929 ms of which 1 ms to minimize.
[2023-03-18 21:59:58] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 1 ms to minimize.
[2023-03-18 21:59:58] [INFO ] Deduced a trap composed of 8 places in 327 ms of which 0 ms to minimize.
[2023-03-18 21:59:58] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 0 ms to minimize.
[2023-03-18 21:59:59] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-18 21:59:59] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-18 21:59:59] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-18 21:59:59] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2023-03-18 22:00:00] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-18 22:00:00] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-18 22:00:00] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 0 ms to minimize.
[2023-03-18 22:00:01] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 3 ms to minimize.
[2023-03-18 22:00:01] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 1 ms to minimize.
[2023-03-18 22:00:01] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 0 ms to minimize.
[2023-03-18 22:00:01] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 1 ms to minimize.
[2023-03-18 22:00:02] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2023-03-18 22:00:02] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-18 22:00:02] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
[2023-03-18 22:00:02] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2023-03-18 22:00:03] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 0 ms to minimize.
[2023-03-18 22:00:03] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2023-03-18 22:00:03] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-18 22:00:03] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-18 22:00:04] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 1 ms to minimize.
[2023-03-18 22:00:04] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 0 ms to minimize.
[2023-03-18 22:00:04] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 0 ms to minimize.
[2023-03-18 22:00:05] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 39 ms to minimize.
[2023-03-18 22:00:05] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-18 22:00:05] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2023-03-18 22:00:05] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9759 ms
[2023-03-18 22:00:08] [INFO ] Deduced a trap composed of 6 places in 1501 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 22:00:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:00:08] [INFO ] After 26124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 300 ms.
Support contains 122 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 1077/1077 transitions.
Applied a total of 0 rules in 33 ms. Remains 1117 /1117 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1117/1117 places, 1077/1077 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 1077/1077 transitions.
Applied a total of 0 rules in 29 ms. Remains 1117 /1117 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
[2023-03-18 22:00:08] [INFO ] Invariant cache hit.
[2023-03-18 22:00:09] [INFO ] Implicit Places using invariants in 499 ms returned [1103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 517 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1116/1117 places, 1077/1077 transitions.
Applied a total of 0 rules in 27 ms. Remains 1116 /1116 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 588 ms. Remains : 1116/1117 places, 1077/1077 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1077 rows 1116 cols
[2023-03-18 22:00:10] [INFO ] Computed 360 place invariants in 15 ms
[2023-03-18 22:00:10] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 22:00:10] [INFO ] [Nat]Absence check using 354 positive place invariants in 206 ms returned sat
[2023-03-18 22:00:10] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-18 22:00:12] [INFO ] After 1881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 22:00:13] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 1 ms to minimize.
[2023-03-18 22:00:13] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2023-03-18 22:00:14] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2023-03-18 22:00:14] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 1 ms to minimize.
[2023-03-18 22:00:14] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2023-03-18 22:00:15] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 1 ms to minimize.
[2023-03-18 22:00:15] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 0 ms to minimize.
[2023-03-18 22:00:16] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-18 22:00:16] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 1 ms to minimize.
[2023-03-18 22:00:17] [INFO ] Deduced a trap composed of 9 places in 1267 ms of which 0 ms to minimize.
[2023-03-18 22:00:18] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-18 22:00:18] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2023-03-18 22:00:18] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2023-03-18 22:00:19] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2023-03-18 22:00:19] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-18 22:00:19] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-18 22:00:20] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2023-03-18 22:00:20] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 0 ms to minimize.
[2023-03-18 22:00:20] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 1 ms to minimize.
[2023-03-18 22:00:20] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2023-03-18 22:00:21] [INFO ] Deduced a trap composed of 12 places in 804 ms of which 1 ms to minimize.
[2023-03-18 22:00:21] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-18 22:00:22] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 0 ms to minimize.
[2023-03-18 22:00:22] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-18 22:00:22] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 5 ms to minimize.
[2023-03-18 22:00:23] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 0 ms to minimize.
[2023-03-18 22:00:23] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 1 ms to minimize.
[2023-03-18 22:00:23] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-18 22:00:24] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2023-03-18 22:00:24] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-18 22:00:24] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 0 ms to minimize.
[2023-03-18 22:00:24] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-18 22:00:25] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-18 22:00:25] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 0 ms to minimize.
[2023-03-18 22:00:25] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2023-03-18 22:00:25] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 0 ms to minimize.
[2023-03-18 22:00:26] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-18 22:00:26] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-18 22:00:26] [INFO ] Deduced a trap composed of 16 places in 622 ms of which 0 ms to minimize.
[2023-03-18 22:00:27] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-18 22:00:27] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14245 ms
[2023-03-18 22:00:27] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 0 ms to minimize.
[2023-03-18 22:00:28] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2023-03-18 22:00:28] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 2 ms to minimize.
[2023-03-18 22:00:29] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 0 ms to minimize.
[2023-03-18 22:00:29] [INFO ] Deduced a trap composed of 8 places in 366 ms of which 1 ms to minimize.
[2023-03-18 22:00:29] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 13 ms to minimize.
[2023-03-18 22:00:30] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2023-03-18 22:00:30] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-18 22:00:30] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 0 ms to minimize.
[2023-03-18 22:00:30] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2023-03-18 22:00:31] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-18 22:00:31] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-18 22:00:31] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-18 22:00:31] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-18 22:00:32] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2023-03-18 22:00:32] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 1 ms to minimize.
[2023-03-18 22:00:32] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 3 ms to minimize.
[2023-03-18 22:00:32] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2023-03-18 22:00:33] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 3 ms to minimize.
[2023-03-18 22:00:33] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2023-03-18 22:00:33] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-18 22:00:33] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-18 22:00:34] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 1 ms to minimize.
[2023-03-18 22:00:34] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2023-03-18 22:00:34] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6814 ms
[2023-03-18 22:00:35] [INFO ] After 24484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 22:00:35] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 140 ms.
Support contains 119 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 1077/1077 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1112 transition count 1073
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1112 transition count 1073
Applied a total of 10 rules in 87 ms. Remains 1112 /1116 variables (removed 4) and now considering 1073/1077 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 1112/1116 places, 1073/1077 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 120148 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120148 steps, saw 75485 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1073 rows 1112 cols
[2023-03-18 22:00:39] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-18 22:00:39] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 22:00:39] [INFO ] [Nat]Absence check using 354 positive place invariants in 118 ms returned sat
[2023-03-18 22:00:39] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-18 22:00:41] [INFO ] After 2084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 22:00:42] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-18 22:00:42] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 1 ms to minimize.
[2023-03-18 22:00:42] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2023-03-18 22:00:43] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-18 22:00:43] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-18 22:00:43] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-18 22:00:44] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-18 22:00:44] [INFO ] Deduced a trap composed of 5 places in 424 ms of which 1 ms to minimize.
[2023-03-18 22:00:44] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-18 22:00:45] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-18 22:00:45] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-18 22:00:45] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-18 22:00:45] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-18 22:00:46] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 0 ms to minimize.
[2023-03-18 22:00:46] [INFO ] Deduced a trap composed of 7 places in 426 ms of which 0 ms to minimize.
[2023-03-18 22:00:46] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 0 ms to minimize.
[2023-03-18 22:00:47] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-18 22:00:47] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 0 ms to minimize.
[2023-03-18 22:00:47] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 0 ms to minimize.
[2023-03-18 22:00:47] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-18 22:00:48] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-18 22:00:48] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2023-03-18 22:00:48] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-18 22:00:48] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-18 22:00:49] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-18 22:00:49] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 0 ms to minimize.
[2023-03-18 22:00:49] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 1 ms to minimize.
[2023-03-18 22:00:49] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-18 22:00:50] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 1 ms to minimize.
[2023-03-18 22:00:50] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2023-03-18 22:00:50] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 0 ms to minimize.
[2023-03-18 22:00:51] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2023-03-18 22:00:51] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-18 22:00:51] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9441 ms
[2023-03-18 22:00:51] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2023-03-18 22:00:52] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2023-03-18 22:00:52] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-18 22:00:52] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2023-03-18 22:00:52] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2023-03-18 22:00:53] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-18 22:00:53] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 14 ms to minimize.
[2023-03-18 22:00:53] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 14 ms to minimize.
[2023-03-18 22:00:54] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 13 ms to minimize.
[2023-03-18 22:00:54] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 1 ms to minimize.
[2023-03-18 22:00:54] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 1 ms to minimize.
[2023-03-18 22:00:54] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-18 22:00:55] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2023-03-18 22:00:55] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2023-03-18 22:00:55] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-18 22:00:55] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-18 22:00:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-18 22:00:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-18 22:00:56] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-18 22:00:56] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-18 22:00:56] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2023-03-18 22:00:57] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-18 22:00:57] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2023-03-18 22:00:57] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-18 22:00:57] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2023-03-18 22:00:57] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-18 22:00:57] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6421 ms
[2023-03-18 22:00:58] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-18 22:00:58] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-18 22:00:59] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 1 ms to minimize.
[2023-03-18 22:00:59] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-18 22:00:59] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-18 22:00:59] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-18 22:01:00] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-18 22:01:00] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2023-03-18 22:01:00] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-18 22:01:00] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-18 22:01:01] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-18 22:01:01] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-18 22:01:01] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-18 22:01:01] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2023-03-18 22:01:02] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-18 22:01:02] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-18 22:01:02] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-18 22:01:02] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-18 22:01:02] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2023-03-18 22:01:03] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2023-03-18 22:01:03] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-18 22:01:03] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2023-03-18 22:01:03] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-18 22:01:04] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2023-03-18 22:01:04] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 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.Application.startNoEx(Application.java:902)
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 22:01:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:01:04] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 160 ms.
Support contains 119 out of 1112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 23 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1112/1112 places, 1073/1073 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 24 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
[2023-03-18 22:01:04] [INFO ] Invariant cache hit.
[2023-03-18 22:01:05] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-18 22:01:05] [INFO ] Invariant cache hit.
[2023-03-18 22:01:07] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 2460 ms to find 0 implicit places.
[2023-03-18 22:01:07] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-18 22:01:07] [INFO ] Invariant cache hit.
[2023-03-18 22:01:07] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3168 ms. Remains : 1112/1112 places, 1073/1073 transitions.
Applied a total of 0 rules in 24 ms. Remains 1112 /1112 variables (removed 0) and now considering 1073/1073 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-18 22:01:07] [INFO ] Invariant cache hit.
[2023-03-18 22:01:07] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 22:01:08] [INFO ] [Nat]Absence check using 354 positive place invariants in 94 ms returned sat
[2023-03-18 22:01:08] [INFO ] [Nat]Absence check using 354 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-18 22:01:10] [INFO ] After 1694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 22:01:10] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 1 ms to minimize.
[2023-03-18 22:01:10] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-18 22:01:11] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 0 ms to minimize.
[2023-03-18 22:01:11] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 0 ms to minimize.
[2023-03-18 22:01:11] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-18 22:01:12] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 0 ms to minimize.
[2023-03-18 22:01:12] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 1 ms to minimize.
[2023-03-18 22:01:12] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-18 22:01:12] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-18 22:01:13] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2023-03-18 22:01:13] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-18 22:01:14] [INFO ] Deduced a trap composed of 8 places in 451 ms of which 0 ms to minimize.
[2023-03-18 22:01:14] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2023-03-18 22:01:14] [INFO ] Deduced a trap composed of 8 places in 346 ms of which 1 ms to minimize.
[2023-03-18 22:01:15] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 0 ms to minimize.
[2023-03-18 22:01:15] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2023-03-18 22:01:15] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-18 22:01:16] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-18 22:01:16] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-18 22:01:16] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-18 22:01:16] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-18 22:01:17] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-18 22:01:17] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-18 22:01:17] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2023-03-18 22:01:17] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-18 22:01:18] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-18 22:01:18] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 0 ms to minimize.
[2023-03-18 22:01:18] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 1 ms to minimize.
[2023-03-18 22:01:18] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 1 ms to minimize.
[2023-03-18 22:01:19] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 0 ms to minimize.
[2023-03-18 22:01:19] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-18 22:01:19] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-18 22:01:20] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-18 22:01:20] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-18 22:01:20] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2023-03-18 22:01:20] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 0 ms to minimize.
[2023-03-18 22:01:20] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 10681 ms
[2023-03-18 22:01:21] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-18 22:01:21] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2023-03-18 22:01:21] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-18 22:01:21] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-18 22:01:22] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 1 ms to minimize.
[2023-03-18 22:01:22] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2023-03-18 22:01:22] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-18 22:01:23] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 0 ms to minimize.
[2023-03-18 22:01:23] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2023-03-18 22:01:23] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2023-03-18 22:01:23] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-18 22:01:24] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-18 22:01:24] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-18 22:01:24] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-18 22:01:24] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-18 22:01:25] [INFO ] Deduced a trap composed of 16 places in 390 ms of which 1 ms to minimize.
[2023-03-18 22:01:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4005 ms
[2023-03-18 22:01:25] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2023-03-18 22:01:26] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-18 22:01:26] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-18 22:01:26] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-18 22:01:27] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2023-03-18 22:01:27] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-18 22:01:27] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-18 22:01:27] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-18 22:01:28] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-18 22:01:28] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-18 22:01:28] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-18 22:01:28] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 1 ms to minimize.
[2023-03-18 22:01:29] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-18 22:01:29] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-18 22:01:29] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2023-03-18 22:01:30] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 1 ms to minimize.
[2023-03-18 22:01:30] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-18 22:01:30] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-18 22:01:30] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-18 22:01:30] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-18 22:01:31] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-18 22:01:31] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2023-03-18 22:01:31] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-18 22:01:31] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-18 22:01:31] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2023-03-18 22:01:31] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6391 ms
[2023-03-18 22:01:31] [INFO ] After 23564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1010 ms.
[2023-03-18 22:01:32] [INFO ] After 24998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 22:01:33] [INFO ] Flatten gal took : 115 ms
[2023-03-18 22:01:33] [INFO ] Flatten gal took : 60 ms
[2023-03-18 22:01:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7000681532078403167.gal : 10 ms
[2023-03-18 22:01:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16538673512567001464.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7000681532078403167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16538673512567001464.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16538673512567001464.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 17
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :17 after 108
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :108 after 2032
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2032 after 584068
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :584068 after 7.84982e+08
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :7.84982e+08 after 3.28152e+17
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :6.56304e+18 after 9.31664e+18
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :9.31664e+18 after 9.31664e+18
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9.31664e+18 after 9.31664e+18
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.31664e+18 after 9.31664e+18
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :9.31664e+18 after 9.31664e+18
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :9.31664e+18 after 9.31664e+18
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :9.31664e+18 after 9.31664e+18
Detected timeout of ITS tools.
[2023-03-18 22:01:48] [INFO ] Flatten gal took : 55 ms
[2023-03-18 22:01:48] [INFO ] Applying decomposition
[2023-03-18 22:01:48] [INFO ] Flatten gal took : 54 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/graph4806943488596847331.txt' '-o' '/tmp/graph4806943488596847331.bin' '-w' '/tmp/graph4806943488596847331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4806943488596847331.bin' '-l' '-1' '-v' '-w' '/tmp/graph4806943488596847331.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:01:48] [INFO ] Decomposing Gal with order
[2023-03-18 22:01:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:01:48] [INFO ] Removed a total of 838 redundant transitions.
[2023-03-18 22:01:48] [INFO ] Flatten gal took : 134 ms
[2023-03-18 22:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 907 labels/synchronizations in 138 ms.
[2023-03-18 22:01:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality138663190993355444.gal : 21 ms
[2023-03-18 22:01:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5184152768904573601.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality138663190993355444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5184152768904573601.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality5184152768904573601.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 117
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :117 after 2.62878e+06
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2.62878e+06 after 2.62878e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.62878e+06 after 2.62878e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.62878e+06 after 2.01853e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16518354354160237562
[2023-03-18 22:02:04] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16518354354160237562
Running compilation step : cd /tmp/ltsmin16518354354160237562;'/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'
Compilation finished in 2151 ms.
Running link step : cd /tmp/ltsmin16518354354160237562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16518354354160237562;'/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' '-i' 'ShieldIIPsPT040BReachabilityFireability08==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 22:02:19] [INFO ] Flatten gal took : 73 ms
[2023-03-18 22:02:19] [INFO ] Applying decomposition
[2023-03-18 22:02:19] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1344013663186025447.txt' '-o' '/tmp/graph1344013663186025447.bin' '-w' '/tmp/graph1344013663186025447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1344013663186025447.bin' '-l' '-1' '-v' '-w' '/tmp/graph1344013663186025447.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:02:19] [INFO ] Decomposing Gal with order
[2023-03-18 22:02:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:02:20] [INFO ] Removed a total of 920 redundant transitions.
[2023-03-18 22:02:20] [INFO ] Flatten gal took : 132 ms
[2023-03-18 22:02:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-18 22:02:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6294898516050450572.gal : 24 ms
[2023-03-18 22:02:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality782567347775456245.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6294898516050450572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality782567347775456245.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality782567347775456245.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1.35205e+28
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.35205e+28 after 1.44722e+110
Invariant property ShieldIIPs-PT-040B-ReachabilityFireability-08 does not hold.
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.44722e+110 after 1.00967e+111
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 22:32:43] [INFO ] Flatten gal took : 1209 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10470169606247941758
[2023-03-18 22:32:44] [INFO ] Computing symmetric may disable matrix : 1073 transitions.
[2023-03-18 22:32:44] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:32:44] [INFO ] Computing symmetric may enable matrix : 1073 transitions.
[2023-03-18 22:32:44] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:32:45] [INFO ] Applying decomposition
[2023-03-18 22:32:45] [INFO ] Flatten gal took : 542 ms
[2023-03-18 22:32:46] [INFO ] Computing Do-Not-Accords matrix : 1073 transitions.
[2023-03-18 22:32:47] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:32:47] [INFO ] Built C files in 2853ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10470169606247941758
Running compilation step : cd /tmp/ltsmin10470169606247941758;'/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'
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/graph13579686932300131742.txt' '-o' '/tmp/graph13579686932300131742.bin' '-w' '/tmp/graph13579686932300131742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13579686932300131742.bin' '-l' '-1' '-v' '-w' '/tmp/graph13579686932300131742.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:32:50] [INFO ] Decomposing Gal with order
[2023-03-18 22:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:32:50] [INFO ] Removed a total of 824 redundant transitions.
[2023-03-18 22:32:51] [INFO ] Flatten gal took : 134 ms
[2023-03-18 22:32:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 748 labels/synchronizations in 221 ms.
[2023-03-18 22:32:51] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7632564244214127844.gal : 25 ms
[2023-03-18 22:32:51] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9705555208225106701.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability7632564244214127844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9705555208225106701.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Compilation finished in 4428 ms.
Running link step : cd /tmp/ltsmin10470169606247941758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Loading property file /tmp/ReachabilityFireability9705555208225106701.prop.
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin10470169606247941758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT040BReachabilityFireability11==true'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 60
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :60 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :60 after 120
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :120 after 2.82594e+11
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.82594e+11 after 3.28152e+17
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.11302e+23 after 1.15668e+30
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.15668e+30 after 2.90712e+32
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3355840 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16148284 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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-040B"
export BK_EXAMINATION="ReachabilityFireability"
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-040B, examination is ReachabilityFireability"
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-167903713200143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;