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.r427-tajo-167905979300175.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 smartxred
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 r427-tajo-167905979300175
=====================================================================

--------------------
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 1679383245584

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 07:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:20:47] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-21 07:20:47] [INFO ] Transformed 4003 places.
[2023-03-21 07:20:47] [INFO ] Transformed 4503 transitions.
[2023-03-21 07:20:47] [INFO ] Found NUPN structural information;
[2023-03-21 07:20:47] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=17 ) 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 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 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 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-21 07:20:48] [INFO ] Computed 401 place invariants in 45 ms
[2023-03-21 07:20:50] [INFO ] After 1436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 07:20:52] [INFO ] [Nat]Absence check using 401 positive place invariants in 280 ms returned sat
[2023-03-21 07:21:15] [INFO ] After 22593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 07:21:15] [INFO ] After 22607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 07:21:15] [INFO ] After 25046ms 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 1264 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 15 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 11 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 17 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 1269 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 1271 ms. Remains : 1660/4003 places, 2160/4503 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 11) seen :4
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-04 TRUE 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 78 ms. (steps per millisecond=128 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2160 rows 1660 cols
[2023-03-21 07:21:18] [INFO ] Computed 401 place invariants in 9 ms
[2023-03-21 07:21:19] [INFO ] After 728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:21:20] [INFO ] [Nat]Absence check using 401 positive place invariants in 115 ms returned sat
[2023-03-21 07:21:23] [INFO ] After 3202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:21:24] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 5 ms to minimize.
[2023-03-21 07:21:25] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 2 ms to minimize.
[2023-03-21 07:21:25] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2023-03-21 07:21:25] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-21 07:21:26] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2023-03-21 07:21:26] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 1 ms to minimize.
[2023-03-21 07:21:26] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2023-03-21 07:21:27] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-21 07:21:27] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2023-03-21 07:21:27] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2023-03-21 07:21:28] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 0 ms to minimize.
[2023-03-21 07:21:28] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 2 ms to minimize.
[2023-03-21 07:21:28] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 0 ms to minimize.
[2023-03-21 07:21:29] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2023-03-21 07:21:29] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-21 07:21:29] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2023-03-21 07:21:29] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 0 ms to minimize.
[2023-03-21 07:21:30] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2023-03-21 07:21:30] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2023-03-21 07:21:30] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2023-03-21 07:21:30] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2023-03-21 07:21:31] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-21 07:21:31] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2023-03-21 07:21:31] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2023-03-21 07:21:31] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-21 07:21:32] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2023-03-21 07:21:32] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2023-03-21 07:21:32] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-21 07:21:32] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-21 07:21:33] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-21 07:21:33] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8999 ms
[2023-03-21 07:21:33] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 0 ms to minimize.
[2023-03-21 07:21:34] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-21 07:21:34] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 0 ms to minimize.
[2023-03-21 07:21:34] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 6 ms to minimize.
[2023-03-21 07:21:35] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-21 07:21:35] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 1 ms to minimize.
[2023-03-21 07:21:36] [INFO ] Deduced a trap composed of 15 places in 425 ms of which 2 ms to minimize.
[2023-03-21 07:21:36] [INFO ] Deduced a trap composed of 16 places in 289 ms of which 1 ms to minimize.
[2023-03-21 07:21:37] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 0 ms to minimize.
[2023-03-21 07:21:37] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 1 ms to minimize.
[2023-03-21 07:21:37] [INFO ] Deduced a trap composed of 11 places in 381 ms of which 2 ms to minimize.
[2023-03-21 07:21:38] [INFO ] Deduced a trap composed of 17 places in 381 ms of which 1 ms to minimize.
[2023-03-21 07:21:38] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2023-03-21 07:21:39] [INFO ] Deduced a trap composed of 14 places in 346 ms of which 1 ms to minimize.
[2023-03-21 07:21:39] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 0 ms to minimize.
[2023-03-21 07:21:39] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-21 07:21:40] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2023-03-21 07:21:40] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2023-03-21 07:21:40] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 0 ms to minimize.
[2023-03-21 07:21:40] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2023-03-21 07:21:41] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 2 ms to minimize.
[2023-03-21 07:21:41] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-21 07:21:41] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-21 07:21:42] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-21 07:21:42] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8747 ms
[2023-03-21 07:21:42] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2023-03-21 07:21:43] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 3 ms to minimize.
[2023-03-21 07:21:43] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 1 ms to minimize.
[2023-03-21 07:21:43] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2023-03-21 07:21:44] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2023-03-21 07:21:44] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2023-03-21 07:21:44] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-03-21 07:21:45] [INFO ] Deduced a trap composed of 2 places in 1076 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-21 07:21:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:21:45] [INFO ] After 26106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 400 ms.
Support contains 264 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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 1659 transition count 2155
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 1655 transition count 2155
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 1647 transition count 2147
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 1647 transition count 2147
Applied a total of 27 rules in 216 ms. Remains 1647 /1660 variables (removed 13) and now considering 2147/2160 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 1647/1660 places, 2147/2160 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 73439 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73439 steps, saw 35385 distinct states, run finished after 3005 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2147 rows 1647 cols
[2023-03-21 07:21:50] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-21 07:21:50] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:21:51] [INFO ] [Nat]Absence check using 401 positive place invariants in 114 ms returned sat
[2023-03-21 07:21:53] [INFO ] After 2699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:21:54] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 0 ms to minimize.
[2023-03-21 07:21:54] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 2 ms to minimize.
[2023-03-21 07:21:55] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 0 ms to minimize.
[2023-03-21 07:21:55] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 2 ms to minimize.
[2023-03-21 07:21:56] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 0 ms to minimize.
[2023-03-21 07:21:56] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 2 ms to minimize.
[2023-03-21 07:21:56] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 7 ms to minimize.
[2023-03-21 07:21:56] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2023-03-21 07:21:57] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-21 07:21:57] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-21 07:21:57] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2023-03-21 07:21:58] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 0 ms to minimize.
[2023-03-21 07:21:58] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-21 07:21:58] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2023-03-21 07:21:58] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2023-03-21 07:21:59] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2023-03-21 07:21:59] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 0 ms to minimize.
[2023-03-21 07:21:59] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
[2023-03-21 07:21:59] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-21 07:22:00] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2023-03-21 07:22:00] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2023-03-21 07:22:00] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2023-03-21 07:22:00] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2023-03-21 07:22:00] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2023-03-21 07:22:01] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2023-03-21 07:22:01] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-21 07:22:01] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-21 07:22:01] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-21 07:22:01] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2023-03-21 07:22:02] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-21 07:22:02] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-21 07:22:02] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2023-03-21 07:22:02] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 0 ms to minimize.
[2023-03-21 07:22:02] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-21 07:22:03] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-21 07:22:03] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2023-03-21 07:22:03] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9005 ms
[2023-03-21 07:22:03] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2023-03-21 07:22:03] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2023-03-21 07:22:03] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-21 07:22:04] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2023-03-21 07:22:04] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-21 07:22:04] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-21 07:22:04] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2023-03-21 07:22:04] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:22:04] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-21 07:22:05] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:22:05] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2023-03-21 07:22:05] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2023-03-21 07:22:05] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2023-03-21 07:22:06] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2023-03-21 07:22:06] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 0 ms to minimize.
[2023-03-21 07:22:06] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-21 07:22:06] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-21 07:22:07] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2023-03-21 07:22:07] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2023-03-21 07:22:07] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 0 ms to minimize.
[2023-03-21 07:22:07] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2023-03-21 07:22:08] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 0 ms to minimize.
[2023-03-21 07:22:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4749 ms
[2023-03-21 07:22:08] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 0 ms to minimize.
[2023-03-21 07:22:08] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 0 ms to minimize.
[2023-03-21 07:22:09] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 2 ms to minimize.
[2023-03-21 07:22:09] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 1 ms to minimize.
[2023-03-21 07:22:09] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 0 ms to minimize.
[2023-03-21 07:22:10] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2023-03-21 07:22:10] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2023-03-21 07:22:10] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 0 ms to minimize.
[2023-03-21 07:22:10] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2023-03-21 07:22:11] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 0 ms to minimize.
[2023-03-21 07:22:11] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2023-03-21 07:22:11] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2023-03-21 07:22:11] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2023-03-21 07:22:12] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 0 ms to minimize.
[2023-03-21 07:22:12] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2023-03-21 07:22:12] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 1 ms to minimize.
[2023-03-21 07:22:12] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 0 ms to minimize.
[2023-03-21 07:22:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4583 ms
[2023-03-21 07:22:13] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-21 07:22:13] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2023-03-21 07:22:13] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2023-03-21 07:22:14] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 0 ms to minimize.
[2023-03-21 07:22:14] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2023-03-21 07:22:14] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2023-03-21 07:22:14] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-21 07:22:15] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2023-03-21 07:22:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2001 ms
[2023-03-21 07:22:15] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2023-03-21 07:22:15] [INFO ] Deduced a trap composed of 6 places in 216 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-21 07:22:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:22:15] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 767 ms.
Support contains 264 out of 1647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1647/1647 places, 2147/2147 transitions.
Applied a total of 0 rules in 53 ms. Remains 1647 /1647 variables (removed 0) and now considering 2147/2147 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1647/1647 places, 2147/2147 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1647/1647 places, 2147/2147 transitions.
Applied a total of 0 rules in 51 ms. Remains 1647 /1647 variables (removed 0) and now considering 2147/2147 (removed 0) transitions.
[2023-03-21 07:22:16] [INFO ] Invariant cache hit.
[2023-03-21 07:22:17] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-21 07:22:17] [INFO ] Invariant cache hit.
[2023-03-21 07:22:19] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2023-03-21 07:22:19] [INFO ] Redundant transitions in 362 ms returned []
[2023-03-21 07:22:19] [INFO ] Invariant cache hit.
[2023-03-21 07:22:20] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4372 ms. Remains : 1647/1647 places, 2147/2147 transitions.
Applied a total of 0 rules in 50 ms. Remains 1647 /1647 variables (removed 0) and now considering 2147/2147 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-21 07:22:21] [INFO ] Invariant cache hit.
[2023-03-21 07:22:21] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:22:21] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2023-03-21 07:22:24] [INFO ] After 2648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:22:25] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 0 ms to minimize.
[2023-03-21 07:22:25] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2023-03-21 07:22:26] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 0 ms to minimize.
[2023-03-21 07:22:26] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 1 ms to minimize.
[2023-03-21 07:22:27] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2023-03-21 07:22:27] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2023-03-21 07:22:27] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 0 ms to minimize.
[2023-03-21 07:22:28] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-21 07:22:28] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2023-03-21 07:22:28] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 0 ms to minimize.
[2023-03-21 07:22:29] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 1 ms to minimize.
[2023-03-21 07:22:29] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 1 ms to minimize.
[2023-03-21 07:22:29] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 1 ms to minimize.
[2023-03-21 07:22:30] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2023-03-21 07:22:30] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2023-03-21 07:22:30] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 0 ms to minimize.
[2023-03-21 07:22:31] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2023-03-21 07:22:31] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 0 ms to minimize.
[2023-03-21 07:22:31] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2023-03-21 07:22:31] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 1 ms to minimize.
[2023-03-21 07:22:32] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2023-03-21 07:22:32] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2023-03-21 07:22:32] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-21 07:22:33] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 0 ms to minimize.
[2023-03-21 07:22:33] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-21 07:22:33] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-21 07:22:33] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 1 ms to minimize.
[2023-03-21 07:22:34] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 0 ms to minimize.
[2023-03-21 07:22:34] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2023-03-21 07:22:35] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-21 07:22:35] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-21 07:22:35] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 0 ms to minimize.
[2023-03-21 07:22:35] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 0 ms to minimize.
[2023-03-21 07:22:36] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-21 07:22:36] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2023-03-21 07:22:36] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 0 ms to minimize.
[2023-03-21 07:22:36] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 0 ms to minimize.
[2023-03-21 07:22:37] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2023-03-21 07:22:37] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 0 ms to minimize.
[2023-03-21 07:22:37] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 0 ms to minimize.
[2023-03-21 07:22:37] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-21 07:22:38] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2023-03-21 07:22:38] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-21 07:22:38] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-21 07:22:38] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 13441 ms
[2023-03-21 07:22:38] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-21 07:22:39] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-21 07:22:39] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2023-03-21 07:22:39] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-03-21 07:22:39] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2023-03-21 07:22:39] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-21 07:22:40] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 0 ms to minimize.
[2023-03-21 07:22:40] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 0 ms to minimize.
[2023-03-21 07:22:40] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2023-03-21 07:22:41] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-21 07:22:41] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2023-03-21 07:22:41] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2023-03-21 07:22:41] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 0 ms to minimize.
[2023-03-21 07:22:41] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-21 07:22:42] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
[2023-03-21 07:22:42] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-21 07:22:42] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-21 07:22:42] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2023-03-21 07:22:43] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2023-03-21 07:22:43] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-21 07:22:43] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2023-03-21 07:22:43] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-21 07:22:43] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2023-03-21 07:22:44] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2023-03-21 07:22:44] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2023-03-21 07:22:44] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2023-03-21 07:22:44] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2023-03-21 07:22:45] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2023-03-21 07:22:45] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6624 ms
[2023-03-21 07:22:45] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2023-03-21 07:22:46] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 1 ms to minimize.
[2023-03-21 07:22:46] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 0 ms to minimize.
[2023-03-21 07:22:46] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 1 ms to minimize.
[2023-03-21 07:22:47] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 1 ms to minimize.
[2023-03-21 07:22:47] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 0 ms to minimize.
[2023-03-21 07:22:47] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 1 ms to minimize.
[2023-03-21 07:22:48] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2023-03-21 07:22:48] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2023-03-21 07:22:48] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 1 ms to minimize.
[2023-03-21 07:22:48] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2023-03-21 07:22:49] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 0 ms to minimize.
[2023-03-21 07:22:49] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
[2023-03-21 07:22:49] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 0 ms to minimize.
[2023-03-21 07:22:50] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 1 ms to minimize.
[2023-03-21 07:22:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4586 ms
[2023-03-21 07:22:50] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 1 ms to minimize.
[2023-03-21 07:22:51] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 1 ms to minimize.
[2023-03-21 07:22:51] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-21 07:22:51] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2023-03-21 07:22:51] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2023-03-21 07:22:52] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-21 07:22:52] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-21 07:22:52] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 0 ms to minimize.
[2023-03-21 07:22:53] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2023-03-21 07:22:53] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 0 ms to minimize.
[2023-03-21 07:22:53] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-21 07:22:53] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-03-21 07:22:54] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2023-03-21 07:22:54] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 12 ms to minimize.
[2023-03-21 07:22:54] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2023-03-21 07:22:54] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-21 07:22:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4611 ms
[2023-03-21 07:22:55] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2023-03-21 07:22:55] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-21 07:22:55] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 0 ms to minimize.
[2023-03-21 07:22:56] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-21 07:22:56] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 0 ms to minimize.
[2023-03-21 07:22:56] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 2 ms to minimize.
[2023-03-21 07:22:57] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 1 ms to minimize.
[2023-03-21 07:22:57] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-21 07:22:57] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-21 07:22:58] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 1 ms to minimize.
[2023-03-21 07:22:58] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2023-03-21 07:22:58] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 0 ms to minimize.
[2023-03-21 07:22:58] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-21 07:22:59] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 1 ms to minimize.
[2023-03-21 07:22:59] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 0 ms to minimize.
[2023-03-21 07:22:59] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4417 ms
[2023-03-21 07:23:00] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2023-03-21 07:23:00] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-21 07:23:00] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2023-03-21 07:23:00] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2023-03-21 07:23:01] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-21 07:23:01] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2023-03-21 07:23:01] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-21 07:23:01] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2023-03-21 07:23:01] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2023-03-21 07:23:02] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2023-03-21 07:23:02] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2023-03-21 07:23:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2425 ms
[2023-03-21 07:23:03] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 1 ms to minimize.
[2023-03-21 07:23:03] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 1 ms to minimize.
[2023-03-21 07:23:03] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2023-03-21 07:23:04] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-21 07:23:04] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 0 ms to minimize.
[2023-03-21 07:23:04] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 0 ms to minimize.
[2023-03-21 07:23:05] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-21 07:23:05] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 1 ms to minimize.
[2023-03-21 07:23:05] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 0 ms to minimize.
[2023-03-21 07:23:06] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 0 ms to minimize.
[2023-03-21 07:23:06] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2023-03-21 07:23:06] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-21 07:23:06] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2023-03-21 07:23:07] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-21 07:23:07] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2023-03-21 07:23:07] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-21 07:23:07] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-21 07:23:08] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-21 07:23:08] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2023-03-21 07:23:08] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-21 07:23:08] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-21 07:23:09] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-21 07:23:09] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-21 07:23:09] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2023-03-21 07:23:09] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2023-03-21 07:23:09] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2023-03-21 07:23:09] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2023-03-21 07:23:10] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2023-03-21 07:23:10] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2023-03-21 07:23:10] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2023-03-21 07:23:10] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-21 07:23:10] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:23:11] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8111 ms
[2023-03-21 07:23:11] [INFO ] After 49007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1686 ms.
[2023-03-21 07:23:12] [INFO ] After 51226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-21 07:23:12] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-21 07:23:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1647 places, 2147 transitions and 9976 arcs took 14 ms.
[2023-03-21 07:23:13] [INFO ] Flatten gal took : 288 ms
Total runtime 146131 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 100B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1647 places, 2147 transitions, 9976 arcs.
Final Score: 285424.977
Took : 25 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679383419178

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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
ERROR in file model.sm near line 13803:
syntax error

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="smartxred"
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 smartxred"
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 r427-tajo-167905979300175"
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 ;