Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679303024127

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:03:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:03:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:03:46] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-20 09:03:46] [INFO ] Transformed 4003 places.
[2023-03-20 09:03:46] [INFO ] Transformed 4503 transitions.
[2023-03-20 09:03:46] [INFO ] Found NUPN structural information;
[2023-03-20 09:03:46] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 16) seen :5
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-20 09:03:48] [INFO ] Computed 401 place invariants in 47 ms
[2023-03-20 09:03:50] [INFO ] After 1741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 09:03:52] [INFO ] [Nat]Absence check using 401 positive place invariants in 258 ms returned sat
[2023-03-20 09:04:15] [INFO ] After 22769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 09:04:15] [INFO ] After 22792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 09:04:15] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1887 ms.
Support contains 283 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 4003 transition count 4153
Reduce places removed 350 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 364 rules applied. Total rules applied 714 place count 3653 transition count 4139
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 728 place count 3639 transition count 4139
Performed 480 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 480 Pre rules applied. Total rules applied 728 place count 3639 transition count 3659
Deduced a syphon composed of 480 places in 27 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 1688 place count 3159 transition count 3659
Discarding 649 places :
Symmetric choice reduction at 3 with 649 rule applications. Total rules 2337 place count 2510 transition count 3010
Iterating global reduction 3 with 649 rules applied. Total rules applied 2986 place count 2510 transition count 3010
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 210 Pre rules applied. Total rules applied 2986 place count 2510 transition count 2800
Deduced a syphon composed of 210 places in 55 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 420 rules applied. Total rules applied 3406 place count 2300 transition count 2800
Performed 639 Post agglomeration using F-continuation condition.Transition count delta: 639
Deduced a syphon composed of 639 places in 24 ms
Reduce places removed 639 places and 0 transitions.
Iterating global reduction 3 with 1278 rules applied. Total rules applied 4684 place count 1661 transition count 2161
Partial Free-agglomeration rule applied 164 times.
Drop transitions removed 164 transitions
Iterating global reduction 3 with 164 rules applied. Total rules applied 4848 place count 1661 transition count 2161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4849 place count 1660 transition count 2160
Applied a total of 4849 rules in 1677 ms. Remains 1660 /4003 variables (removed 2343) and now considering 2160/4503 (removed 2343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1690 ms. Remains : 1660/4003 places, 2160/4503 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 11) seen :2
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2160 rows 1660 cols
[2023-03-20 09:04:20] [INFO ] Computed 401 place invariants in 14 ms
[2023-03-20 09:04:20] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 09:04:21] [INFO ] [Nat]Absence check using 401 positive place invariants in 77 ms returned sat
[2023-03-20 09:04:24] [INFO ] After 3060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 09:04:25] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 5 ms to minimize.
[2023-03-20 09:04:26] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 2 ms to minimize.
[2023-03-20 09:04:26] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 2 ms to minimize.
[2023-03-20 09:04:27] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 2 ms to minimize.
[2023-03-20 09:04:27] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2023-03-20 09:04:27] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 2 ms to minimize.
[2023-03-20 09:04:28] [INFO ] Deduced a trap composed of 14 places in 382 ms of which 2 ms to minimize.
[2023-03-20 09:04:28] [INFO ] Deduced a trap composed of 17 places in 417 ms of which 1 ms to minimize.
[2023-03-20 09:04:29] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 1 ms to minimize.
[2023-03-20 09:04:29] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2023-03-20 09:04:29] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-20 09:04:30] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 1 ms to minimize.
[2023-03-20 09:04:30] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 1 ms to minimize.
[2023-03-20 09:04:30] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:04:31] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2023-03-20 09:04:31] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:04:31] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2023-03-20 09:04:32] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 0 ms to minimize.
[2023-03-20 09:04:32] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 0 ms to minimize.
[2023-03-20 09:04:32] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2023-03-20 09:04:32] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2023-03-20 09:04:33] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-20 09:04:34] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2023-03-20 09:04:34] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9214 ms
[2023-03-20 09:04:34] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 0 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2023-03-20 09:04:35] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 4 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 1 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 2 ms to minimize.
[2023-03-20 09:04:39] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2023-03-20 09:04:39] [INFO ] Deduced a trap composed of 15 places in 389 ms of which 1 ms to minimize.
[2023-03-20 09:04:40] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 1 ms to minimize.
[2023-03-20 09:04:40] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 1 ms to minimize.
[2023-03-20 09:04:40] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2023-03-20 09:04:41] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 1 ms to minimize.
[2023-03-20 09:04:41] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2023-03-20 09:04:42] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
[2023-03-20 09:04:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7668 ms
[2023-03-20 09:04:42] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 1 ms to minimize.
[2023-03-20 09:04:43] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 1 ms to minimize.
[2023-03-20 09:04:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 803 ms
[2023-03-20 09:04:43] [INFO ] Deduced a trap composed of 9 places in 408 ms of which 4 ms to minimize.
[2023-03-20 09:04:44] [INFO ] Deduced a trap composed of 6 places in 426 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 10 places in 393 ms of which 1 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 1 ms to minimize.
[2023-03-20 09:04:47] [INFO ] Deduced a trap composed of 2 places in 1052 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-20 09:04:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:04:47] [INFO ] After 26064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 875 ms.
Support contains 270 out of 1660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1660/1660 places, 2160/2160 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1660 transition count 2159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1659 transition count 2159
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1659 transition count 2156
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1656 transition count 2156
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 1650 transition count 2150
Applied a total of 20 rules in 179 ms. Remains 1650 /1660 variables (removed 10) and now considering 2150/2160 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1650/1660 places, 2150/2160 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 9) seen :3
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2150 rows 1650 cols
[2023-03-20 09:04:49] [INFO ] Computed 401 place invariants in 9 ms
[2023-03-20 09:04:49] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 09:04:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 101 ms returned sat
[2023-03-20 09:04:52] [INFO ] After 2510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 1 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 0 ms to minimize.
[2023-03-20 09:04:54] [INFO ] Deduced a trap composed of 9 places in 389 ms of which 1 ms to minimize.
[2023-03-20 09:04:54] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2023-03-20 09:04:55] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 2 ms to minimize.
[2023-03-20 09:04:55] [INFO ] Deduced a trap composed of 17 places in 416 ms of which 5 ms to minimize.
[2023-03-20 09:04:56] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2023-03-20 09:04:56] [INFO ] Deduced a trap composed of 14 places in 323 ms of which 2 ms to minimize.
[2023-03-20 09:04:56] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 1 ms to minimize.
[2023-03-20 09:04:57] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-20 09:04:57] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 3 ms to minimize.
[2023-03-20 09:04:57] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 15 ms to minimize.
[2023-03-20 09:04:58] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-20 09:04:58] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2023-03-20 09:04:58] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2023-03-20 09:04:59] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2023-03-20 09:04:59] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2023-03-20 09:04:59] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-20 09:04:59] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2023-03-20 09:05:00] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-20 09:05:00] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2023-03-20 09:05:00] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2023-03-20 09:05:00] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2023-03-20 09:05:00] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2023-03-20 09:05:01] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7992 ms
[2023-03-20 09:05:01] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2023-03-20 09:05:01] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 1 ms to minimize.
[2023-03-20 09:05:02] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 0 ms to minimize.
[2023-03-20 09:05:02] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2023-03-20 09:05:02] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-20 09:05:02] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 0 ms to minimize.
[2023-03-20 09:05:03] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2023-03-20 09:05:03] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2023-03-20 09:05:03] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2023-03-20 09:05:04] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 0 ms to minimize.
[2023-03-20 09:05:04] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 1 ms to minimize.
[2023-03-20 09:05:04] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 0 ms to minimize.
[2023-03-20 09:05:05] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2023-03-20 09:05:05] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2023-03-20 09:05:05] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-20 09:05:05] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 1 ms to minimize.
[2023-03-20 09:05:06] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 1 ms to minimize.
[2023-03-20 09:05:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5103 ms
[2023-03-20 09:05:06] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-20 09:05:07] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 0 ms to minimize.
[2023-03-20 09:05:07] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:05:07] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-20 09:05:08] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-20 09:05:08] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:05:08] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-20 09:05:09] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 0 ms to minimize.
[2023-03-20 09:05:09] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-20 09:05:09] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 0 ms to minimize.
[2023-03-20 09:05:09] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2023-03-20 09:05:10] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 1 ms to minimize.
[2023-03-20 09:05:10] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-20 09:05:10] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2023-03-20 09:05:11] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2023-03-20 09:05:11] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-20 09:05:11] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 0 ms to minimize.
[2023-03-20 09:05:11] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-20 09:05:12] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 0 ms to minimize.
[2023-03-20 09:05:12] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 0 ms to minimize.
[2023-03-20 09:05:12] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 1 ms to minimize.
[2023-03-20 09:05:12] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2023-03-20 09:05:13] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 0 ms to minimize.
[2023-03-20 09:05:13] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 0 ms to minimize.
[2023-03-20 09:05:13] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2023-03-20 09:05:14] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2023-03-20 09:05:14] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 0 ms to minimize.
[2023-03-20 09:05:14] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2023-03-20 09:05:14] [INFO ] Deduced a trap composed of 15 places in 159 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-20 09:05:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:05:14] [INFO ] After 25188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 392 ms.
Support contains 239 out of 1650 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1650/1650 places, 2150/2150 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1650 transition count 2147
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1647 transition count 2147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 1647 transition count 2139
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 1639 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1638 transition count 2138
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1638 transition count 2138
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 42 place count 1629 transition count 2129
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 1629 transition count 2129
Applied a total of 47 rules in 292 ms. Remains 1629 /1650 variables (removed 21) and now considering 2129/2150 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 1629/1650 places, 2129/2150 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 79480 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79480 steps, saw 35729 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2129 rows 1629 cols
[2023-03-20 09:05:19] [INFO ] Computed 401 place invariants in 12 ms
[2023-03-20 09:05:19] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 09:05:19] [INFO ] [Nat]Absence check using 401 positive place invariants in 71 ms returned sat
[2023-03-20 09:05:22] [INFO ] After 2475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 09:05:23] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-20 09:05:23] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-20 09:05:23] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-20 09:05:23] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-20 09:05:24] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2023-03-20 09:05:24] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2023-03-20 09:05:24] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 0 ms to minimize.
[2023-03-20 09:05:24] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2023-03-20 09:05:25] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2023-03-20 09:05:25] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 1 ms to minimize.
[2023-03-20 09:05:25] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2023-03-20 09:05:25] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-20 09:05:26] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2023-03-20 09:05:26] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2023-03-20 09:05:26] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2023-03-20 09:05:26] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2023-03-20 09:05:27] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2023-03-20 09:05:27] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-20 09:05:27] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-20 09:05:27] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5679 ms
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 0 ms to minimize.
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 0 ms to minimize.
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2023-03-20 09:05:30] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 1 ms to minimize.
[2023-03-20 09:05:30] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2023-03-20 09:05:30] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 0 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 1 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 16 places in 394 ms of which 1 ms to minimize.
[2023-03-20 09:05:32] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2023-03-20 09:05:32] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2023-03-20 09:05:33] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 1 ms to minimize.
[2023-03-20 09:05:33] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2023-03-20 09:05:33] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 2 ms to minimize.
[2023-03-20 09:05:34] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-20 09:05:34] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2023-03-20 09:05:34] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 0 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-20 09:05:35] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 1 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2023-03-20 09:05:36] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 0 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2023-03-20 09:05:37] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9821 ms
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2023-03-20 09:05:40] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2023-03-20 09:05:41] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-20 09:05:41] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:05:41] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 0 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-20 09:05:42] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 1 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2023-03-20 09:05:43] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 0 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:05:44] [INFO ] Deduced a trap composed of 17 places in 215 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-20 09:05:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:05:44] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 335 ms.
Support contains 239 out of 1629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1629/1629 places, 2129/2129 transitions.
Applied a total of 0 rules in 67 ms. Remains 1629 /1629 variables (removed 0) and now considering 2129/2129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1629/1629 places, 2129/2129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1629/1629 places, 2129/2129 transitions.
Applied a total of 0 rules in 54 ms. Remains 1629 /1629 variables (removed 0) and now considering 2129/2129 (removed 0) transitions.
[2023-03-20 09:05:45] [INFO ] Invariant cache hit.
[2023-03-20 09:05:45] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-20 09:05:45] [INFO ] Invariant cache hit.
[2023-03-20 09:05:47] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
[2023-03-20 09:05:48] [INFO ] Redundant transitions in 379 ms returned []
[2023-03-20 09:05:48] [INFO ] Invariant cache hit.
[2023-03-20 09:05:49] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4354 ms. Remains : 1629/1629 places, 2129/2129 transitions.
Applied a total of 0 rules in 93 ms. Remains 1629 /1629 variables (removed 0) and now considering 2129/2129 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-20 09:05:49] [INFO ] Invariant cache hit.
[2023-03-20 09:05:49] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 09:05:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 67 ms returned sat
[2023-03-20 09:05:52] [INFO ] After 2451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-20 09:05:56] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2023-03-20 09:05:56] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2023-03-20 09:05:56] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-20 09:05:56] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-20 09:05:57] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2023-03-20 09:05:57] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-03-20 09:05:57] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4218 ms
[2023-03-20 09:05:57] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-20 09:05:58] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 1 ms to minimize.
[2023-03-20 09:05:58] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 0 ms to minimize.
[2023-03-20 09:05:58] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2023-03-20 09:05:59] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2023-03-20 09:05:59] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2023-03-20 09:05:59] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-20 09:05:59] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 0 ms to minimize.
[2023-03-20 09:06:00] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 1 ms to minimize.
[2023-03-20 09:06:00] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-20 09:06:00] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 0 ms to minimize.
[2023-03-20 09:06:01] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
[2023-03-20 09:06:01] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
[2023-03-20 09:06:01] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2023-03-20 09:06:01] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 0 ms to minimize.
[2023-03-20 09:06:02] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-20 09:06:02] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 0 ms to minimize.
[2023-03-20 09:06:02] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-20 09:06:02] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2023-03-20 09:06:03] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2023-03-20 09:06:03] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 0 ms to minimize.
[2023-03-20 09:06:03] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-20 09:06:04] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 0 ms to minimize.
[2023-03-20 09:06:04] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-20 09:06:04] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2023-03-20 09:06:04] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2023-03-20 09:06:04] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 0 ms to minimize.
[2023-03-20 09:06:05] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2023-03-20 09:06:05] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7807 ms
[2023-03-20 09:06:05] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 1 ms to minimize.
[2023-03-20 09:06:06] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-20 09:06:06] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2023-03-20 09:06:06] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-20 09:06:07] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-20 09:06:07] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 0 ms to minimize.
[2023-03-20 09:06:07] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2023-03-20 09:06:08] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2023-03-20 09:06:08] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2023-03-20 09:06:08] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-20 09:06:08] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-20 09:06:08] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 0 ms to minimize.
[2023-03-20 09:06:09] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-20 09:06:09] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-20 09:06:09] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 0 ms to minimize.
[2023-03-20 09:06:10] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-20 09:06:10] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 1 ms to minimize.
[2023-03-20 09:06:10] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-03-20 09:06:10] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-20 09:06:10] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 0 ms to minimize.
[2023-03-20 09:06:11] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2023-03-20 09:06:11] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-20 09:06:11] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2023-03-20 09:06:11] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2023-03-20 09:06:12] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 0 ms to minimize.
[2023-03-20 09:06:12] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2023-03-20 09:06:12] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-20 09:06:12] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2023-03-20 09:06:12] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2023-03-20 09:06:13] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-20 09:06:13] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7661 ms
[2023-03-20 09:06:13] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 0 ms to minimize.
[2023-03-20 09:06:13] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2023-03-20 09:06:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2023-03-20 09:06:14] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 1 ms to minimize.
[2023-03-20 09:06:14] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2023-03-20 09:06:14] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2023-03-20 09:06:15] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 0 ms to minimize.
[2023-03-20 09:06:15] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 0 ms to minimize.
[2023-03-20 09:06:15] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 0 ms to minimize.
[2023-03-20 09:06:16] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2023-03-20 09:06:16] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2023-03-20 09:06:16] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-20 09:06:16] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2023-03-20 09:06:17] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-20 09:06:17] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 0 ms to minimize.
[2023-03-20 09:06:17] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 1 ms to minimize.
[2023-03-20 09:06:18] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 0 ms to minimize.
[2023-03-20 09:06:18] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2023-03-20 09:06:18] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 0 ms to minimize.
[2023-03-20 09:06:18] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 0 ms to minimize.
[2023-03-20 09:06:18] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4853 ms
[2023-03-20 09:06:20] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-20 09:06:20] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2023-03-20 09:06:20] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2023-03-20 09:06:21] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 1 ms to minimize.
[2023-03-20 09:06:21] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 0 ms to minimize.
[2023-03-20 09:06:21] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-20 09:06:21] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 1 ms to minimize.
[2023-03-20 09:06:22] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-20 09:06:22] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 0 ms to minimize.
[2023-03-20 09:06:22] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 0 ms to minimize.
[2023-03-20 09:06:22] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 1 ms to minimize.
[2023-03-20 09:06:23] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 0 ms to minimize.
[2023-03-20 09:06:23] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2023-03-20 09:06:23] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 0 ms to minimize.
[2023-03-20 09:06:23] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 0 ms to minimize.
[2023-03-20 09:06:24] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-20 09:06:24] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2023-03-20 09:06:24] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-20 09:06:24] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2023-03-20 09:06:25] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2023-03-20 09:06:25] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2023-03-20 09:06:25] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5467 ms
[2023-03-20 09:06:25] [INFO ] After 35008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2070 ms.
[2023-03-20 09:06:27] [INFO ] After 37500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 09:06:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-20 09:06:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1629 places, 2129 transitions and 9948 arcs took 27 ms.
[2023-03-20 09:06:28] [INFO ] Flatten gal took : 430 ms
Total runtime 162219 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1483/inv_0_ --invariant=/tmp/1483/inv_1_ --invariant=/tmp/1483/inv_2_ --invariant=/tmp/1483/inv_3_ --invariant=/tmp/1483/inv_4_ --invariant=/tmp/1483/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10993016 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095524 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-100B, 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 r425-tajo-167905977800175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100B.tgz
mv ShieldRVs-PT-100B execution
cd execution
if [ "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 ;