About the Execution of Marcie+red for ShieldRVs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9952.315 | 1132980.00 | 1186550.00 | 351.50 | ??TT?FT?TF??T?T? | normal |
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.r426-tajo-167905978600175.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 marciexred
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 r426-tajo-167905978600175
=====================================================================
--------------------
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 1679345949902
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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:59:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:59:12] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2023-03-20 20:59:12] [INFO ] Transformed 4003 places.
[2023-03-20 20:59:12] [INFO ] Transformed 4503 transitions.
[2023-03-20 20:59:12] [INFO ] Found NUPN structural information;
[2023-03-20 20:59:12] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 16) seen :4
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 67 ms. (steps per millisecond=149 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-20 20:59:13] [INFO ] Computed 401 place invariants in 42 ms
[2023-03-20 20:59:15] [INFO ] After 2086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 20:59:18] [INFO ] [Nat]Absence check using 401 positive place invariants in 355 ms returned sat
[2023-03-20 20:59:40] [INFO ] After 21817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 20:59:40] [INFO ] After 21826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 20:59:40] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 935 ms.
Support contains 299 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 4003 transition count 4159
Reduce places removed 344 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 360 rules applied. Total rules applied 704 place count 3659 transition count 4143
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 720 place count 3643 transition count 4143
Performed 478 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 478 Pre rules applied. Total rules applied 720 place count 3643 transition count 3665
Deduced a syphon composed of 478 places in 14 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 3 with 956 rules applied. Total rules applied 1676 place count 3165 transition count 3665
Discarding 644 places :
Symmetric choice reduction at 3 with 644 rule applications. Total rules 2320 place count 2521 transition count 3021
Iterating global reduction 3 with 644 rules applied. Total rules applied 2964 place count 2521 transition count 3021
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 2964 place count 2521 transition count 2814
Deduced a syphon composed of 207 places in 8 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 3378 place count 2314 transition count 2814
Performed 636 Post agglomeration using F-continuation condition.Transition count delta: 636
Deduced a syphon composed of 636 places in 15 ms
Reduce places removed 636 places and 0 transitions.
Iterating global reduction 3 with 1272 rules applied. Total rules applied 4650 place count 1678 transition count 2178
Partial Free-agglomeration rule applied 161 times.
Drop transitions removed 161 transitions
Iterating global reduction 3 with 161 rules applied. Total rules applied 4811 place count 1678 transition count 2178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4812 place count 1677 transition count 2177
Applied a total of 4812 rules in 2547 ms. Remains 1677 /4003 variables (removed 2326) and now considering 2177/4503 (removed 2326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2550 ms. Remains : 1677/4003 places, 2177/4503 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 12) 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-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 90 ms. (steps per millisecond=111 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2177 rows 1677 cols
[2023-03-20 20:59:45] [INFO ] Computed 401 place invariants in 9 ms
[2023-03-20 20:59:45] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 20:59:46] [INFO ] [Nat]Absence check using 401 positive place invariants in 81 ms returned sat
[2023-03-20 20:59:49] [INFO ] After 2557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 20:59:49] [INFO ] Deduced a trap composed of 10 places in 517 ms of which 6 ms to minimize.
[2023-03-20 20:59:50] [INFO ] Deduced a trap composed of 9 places in 651 ms of which 2 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 18 places in 386 ms of which 2 ms to minimize.
[2023-03-20 20:59:51] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 3 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 1 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 0 ms to minimize.
[2023-03-20 20:59:52] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 1 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 1 ms to minimize.
[2023-03-20 20:59:53] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 1 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 15 places in 342 ms of which 1 ms to minimize.
[2023-03-20 20:59:54] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 2 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 1 ms to minimize.
[2023-03-20 20:59:55] [INFO ] Deduced a trap composed of 13 places in 343 ms of which 1 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 1 ms to minimize.
[2023-03-20 20:59:56] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 0 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2023-03-20 20:59:57] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 1 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 18 places in 315 ms of which 0 ms to minimize.
[2023-03-20 20:59:58] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 1 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 2 ms to minimize.
[2023-03-20 20:59:59] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 3 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 0 ms to minimize.
[2023-03-20 21:00:00] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 0 ms to minimize.
[2023-03-20 21:00:01] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 1 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 1 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 4 ms to minimize.
[2023-03-20 21:00:02] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 1 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
[2023-03-20 21:00:03] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-20 21:00:04] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2023-03-20 21:00:05] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-20 21:00:06] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2023-03-20 21:00:06] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 16889 ms
[2023-03-20 21:00:06] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2023-03-20 21:00:07] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 1 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 1 ms to minimize.
[2023-03-20 21:00:08] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 1 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 0 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
[2023-03-20 21:00:09] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
[2023-03-20 21:00:10] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2023-03-20 21:00:10] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 9 ms to minimize.
[2023-03-20 21:00:11] [INFO ] Deduced a trap composed of 2 places in 1061 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 21:00:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:00:11] [INFO ] After 26081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 679 ms.
Support contains 267 out of 1677 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1677/1677 places, 2177/2177 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 1677 transition count 2174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1674 transition count 2174
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 1674 transition count 2166
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 22 place count 1666 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1665 transition count 2165
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1665 transition count 2165
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 1655 transition count 2155
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 1655 transition count 2155
Applied a total of 49 rules in 247 ms. Remains 1655 /1677 variables (removed 22) and now considering 2155/2177 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 1655/1677 places, 2155/2177 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 75028 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75028 steps, saw 35275 distinct states, run finished after 3016 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2155 rows 1655 cols
[2023-03-20 21:00:16] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 21:00:17] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 21:00:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 119 ms returned sat
[2023-03-20 21:00:21] [INFO ] After 3309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 21:00:21] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 1 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-20 21:00:22] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 1 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 0 ms to minimize.
[2023-03-20 21:00:23] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 13 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2023-03-20 21:00:24] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:00:25] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 0 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 0 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 0 ms to minimize.
[2023-03-20 21:00:26] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 0 ms to minimize.
[2023-03-20 21:00:27] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 1 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 0 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 1 ms to minimize.
[2023-03-20 21:00:28] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 0 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-20 21:00:29] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2023-03-20 21:00:30] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:00:31] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 0 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:00:32] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-20 21:00:33] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-20 21:00:33] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11854 ms
[2023-03-20 21:00:33] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:00:34] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2023-03-20 21:00:34] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 0 ms to minimize.
[2023-03-20 21:00:34] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 0 ms to minimize.
[2023-03-20 21:00:35] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 0 ms to minimize.
[2023-03-20 21:00:35] [INFO ] Deduced a trap composed of 14 places in 332 ms of which 1 ms to minimize.
[2023-03-20 21:00:35] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:00:36] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 0 ms to minimize.
[2023-03-20 21:00:36] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 1 ms to minimize.
[2023-03-20 21:00:37] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 1 ms to minimize.
[2023-03-20 21:00:37] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 1 ms to minimize.
[2023-03-20 21:00:37] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 1 ms to minimize.
[2023-03-20 21:00:38] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 1 ms to minimize.
[2023-03-20 21:00:38] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2023-03-20 21:00:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5299 ms
[2023-03-20 21:00:39] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2023-03-20 21:00:39] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2023-03-20 21:00:39] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-20 21:00:40] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 1 ms to minimize.
[2023-03-20 21:00:40] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 0 ms to minimize.
[2023-03-20 21:00:40] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:00:41] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 1 ms to minimize.
[2023-03-20 21:00:41] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2023-03-20 21:00:42] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2023-03-20 21:00:43] [INFO ] Deduced a trap composed of 2 places in 1325 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 21:00:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:00:43] [INFO ] After 26364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 637 ms.
Support contains 267 out of 1655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1655/1655 places, 2155/2155 transitions.
Applied a total of 0 rules in 60 ms. Remains 1655 /1655 variables (removed 0) and now considering 2155/2155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1655/1655 places, 2155/2155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1655/1655 places, 2155/2155 transitions.
Applied a total of 0 rules in 51 ms. Remains 1655 /1655 variables (removed 0) and now considering 2155/2155 (removed 0) transitions.
[2023-03-20 21:00:44] [INFO ] Invariant cache hit.
[2023-03-20 21:00:45] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2023-03-20 21:00:45] [INFO ] Invariant cache hit.
[2023-03-20 21:00:47] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 3153 ms to find 0 implicit places.
[2023-03-20 21:00:48] [INFO ] Redundant transitions in 662 ms returned []
[2023-03-20 21:00:48] [INFO ] Invariant cache hit.
[2023-03-20 21:00:49] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5283 ms. Remains : 1655/1655 places, 2155/2155 transitions.
Applied a total of 0 rules in 58 ms. Remains 1655 /1655 variables (removed 0) and now considering 2155/2155 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-20 21:00:49] [INFO ] Invariant cache hit.
[2023-03-20 21:00:49] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 21:00:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 74 ms returned sat
[2023-03-20 21:00:53] [INFO ] After 2754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 21:00:54] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2023-03-20 21:00:54] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2023-03-20 21:00:54] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2023-03-20 21:00:55] [INFO ] Deduced a trap composed of 14 places in 293 ms of which 1 ms to minimize.
[2023-03-20 21:00:55] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 0 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:00:56] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 0 ms to minimize.
[2023-03-20 21:00:57] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 0 ms to minimize.
[2023-03-20 21:00:57] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 1 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 0 ms to minimize.
[2023-03-20 21:00:58] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 0 ms to minimize.
[2023-03-20 21:00:59] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 0 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2023-03-20 21:01:00] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-20 21:01:01] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2023-03-20 21:01:02] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-20 21:01:03] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
[2023-03-20 21:01:03] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2023-03-20 21:01:03] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2023-03-20 21:01:03] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10122 ms
[2023-03-20 21:01:04] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:01:04] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:01:05] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-20 21:01:05] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-20 21:01:05] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 0 ms to minimize.
[2023-03-20 21:01:06] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2023-03-20 21:01:06] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-20 21:01:06] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 0 ms to minimize.
[2023-03-20 21:01:06] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 1 ms to minimize.
[2023-03-20 21:01:07] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 0 ms to minimize.
[2023-03-20 21:01:07] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2023-03-20 21:01:07] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2023-03-20 21:01:07] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2023-03-20 21:01:08] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:01:08] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-20 21:01:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4343 ms
[2023-03-20 21:01:08] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2023-03-20 21:01:09] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2023-03-20 21:01:09] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:01:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 763 ms
[2023-03-20 21:01:10] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-20 21:01:10] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 1 ms to minimize.
[2023-03-20 21:01:10] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 1 ms to minimize.
[2023-03-20 21:01:11] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-20 21:01:11] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 1 ms to minimize.
[2023-03-20 21:01:11] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 0 ms to minimize.
[2023-03-20 21:01:12] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 1 ms to minimize.
[2023-03-20 21:01:12] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:01:13] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 1 ms to minimize.
[2023-03-20 21:01:13] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 4 ms to minimize.
[2023-03-20 21:01:13] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 0 ms to minimize.
[2023-03-20 21:01:14] [INFO ] Deduced a trap composed of 10 places in 413 ms of which 1 ms to minimize.
[2023-03-20 21:01:14] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-20 21:01:15] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 1 ms to minimize.
[2023-03-20 21:01:15] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:01:15] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-20 21:01:15] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-20 21:01:16] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 1 ms to minimize.
[2023-03-20 21:01:16] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2023-03-20 21:01:17] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 0 ms to minimize.
[2023-03-20 21:01:17] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 1 ms to minimize.
[2023-03-20 21:01:17] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2023-03-20 21:01:18] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2023-03-20 21:01:18] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2023-03-20 21:01:18] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 0 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:01:19] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 10374 ms
[2023-03-20 21:01:20] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-20 21:01:20] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 0 ms to minimize.
[2023-03-20 21:01:20] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-20 21:01:21] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2023-03-20 21:01:21] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2023-03-20 21:01:21] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2023-03-20 21:01:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1453 ms
[2023-03-20 21:01:22] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2023-03-20 21:01:22] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2023-03-20 21:01:22] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2023-03-20 21:01:22] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 0 ms to minimize.
[2023-03-20 21:01:23] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 1 ms to minimize.
[2023-03-20 21:01:23] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 1 ms to minimize.
[2023-03-20 21:01:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1961 ms
[2023-03-20 21:01:24] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 0 ms to minimize.
[2023-03-20 21:01:24] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 1 ms to minimize.
[2023-03-20 21:01:24] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-20 21:01:24] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-20 21:01:25] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 0 ms to minimize.
[2023-03-20 21:01:25] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2023-03-20 21:01:25] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 0 ms to minimize.
[2023-03-20 21:01:25] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2023-03-20 21:01:26] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:01:26] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2023-03-20 21:01:26] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:01:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2974 ms
[2023-03-20 21:01:27] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2023-03-20 21:01:28] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 1 ms to minimize.
[2023-03-20 21:01:28] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 1 ms to minimize.
[2023-03-20 21:01:29] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 1 ms to minimize.
[2023-03-20 21:01:29] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 1 ms to minimize.
[2023-03-20 21:01:29] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-20 21:01:30] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2023-03-20 21:01:30] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2023-03-20 21:01:30] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2023-03-20 21:01:31] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 3 ms to minimize.
[2023-03-20 21:01:31] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 1 ms to minimize.
[2023-03-20 21:01:32] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 2 ms to minimize.
[2023-03-20 21:01:32] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 2 ms to minimize.
[2023-03-20 21:01:33] [INFO ] Deduced a trap composed of 9 places in 366 ms of which 1 ms to minimize.
[2023-03-20 21:01:33] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-20 21:01:34] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2023-03-20 21:01:34] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2023-03-20 21:01:34] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 0 ms to minimize.
[2023-03-20 21:01:35] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2023-03-20 21:01:35] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 1 ms to minimize.
[2023-03-20 21:01:35] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8436 ms
[2023-03-20 21:01:35] [INFO ] After 45381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2334 ms.
[2023-03-20 21:01:38] [INFO ] After 48295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-20 21:01:38] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2023-03-20 21:01:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1655 places, 2155 transitions and 9994 arcs took 20 ms.
[2023-03-20 21:01:38] [INFO ] Flatten gal took : 287 ms
Total runtime 147113 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldRVs_PT_100B
(NrP: 1655 NrTr: 2155 NrArc: 9994)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.365sec
net check time: 0m 0.001sec
init dd package: 0m 3.150sec
before gc: list nodes free: 1331732
after gc: idd nodes used:38844885, unused:25155115; list nodes free:107475529
RS generation: 15m55.820sec
-> last computed set: #nodes 38843231 (3.9e+07) #states 2,404,558,294,355,320,012,890 (21)
CANNOT_COMPUTE
BK_STOP 1679347082882
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.027sec
idd.cc:820: DD Exception: No free nodes
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="marciexred"
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 marciexred"
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 r426-tajo-167905978600175"
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 '
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 ;