fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903718000495
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldPPPs-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9825.407 3600000.00 3710942.00 222.20 ?TFT?TFTTFTFTTTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 ShieldPPPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679519233881

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=ShieldPPPs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:07:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 21:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:07:18] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2023-03-22 21:07:18] [INFO ] Transformed 2723 places.
[2023-03-22 21:07:18] [INFO ] Transformed 2523 transitions.
[2023-03-22 21:07:18] [INFO ] Found NUPN structural information;
[2023-03-22 21:07:18] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-22 21:07:20] [INFO ] Computed 441 place invariants in 78 ms
[2023-03-22 21:07:21] [INFO ] After 1230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 21:07:22] [INFO ] [Nat]Absence check using 441 positive place invariants in 298 ms returned sat
[2023-03-22 21:07:29] [INFO ] After 6257ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-22 21:07:31] [INFO ] Deduced a trap composed of 31 places in 807 ms of which 10 ms to minimize.
[2023-03-22 21:07:32] [INFO ] Deduced a trap composed of 15 places in 808 ms of which 3 ms to minimize.
[2023-03-22 21:07:33] [INFO ] Deduced a trap composed of 27 places in 1135 ms of which 2 ms to minimize.
[2023-03-22 21:07:34] [INFO ] Deduced a trap composed of 22 places in 836 ms of which 4 ms to minimize.
[2023-03-22 21:07:35] [INFO ] Deduced a trap composed of 32 places in 774 ms of which 2 ms to minimize.
[2023-03-22 21:07:36] [INFO ] Deduced a trap composed of 30 places in 704 ms of which 2 ms to minimize.
[2023-03-22 21:07:37] [INFO ] Deduced a trap composed of 35 places in 599 ms of which 1 ms to minimize.
[2023-03-22 21:07:38] [INFO ] Deduced a trap composed of 31 places in 625 ms of which 1 ms to minimize.
[2023-03-22 21:07:39] [INFO ] Deduced a trap composed of 26 places in 914 ms of which 1 ms to minimize.
[2023-03-22 21:07:40] [INFO ] Deduced a trap composed of 14 places in 651 ms of which 1 ms to minimize.
[2023-03-22 21:07:40] [INFO ] Deduced a trap composed of 29 places in 710 ms of which 2 ms to minimize.
[2023-03-22 21:07:41] [INFO ] Deduced a trap composed of 27 places in 748 ms of which 2 ms to minimize.
[2023-03-22 21:07:42] [INFO ] Deduced a trap composed of 22 places in 483 ms of which 1 ms to minimize.
[2023-03-22 21:07:43] [INFO ] Deduced a trap composed of 41 places in 397 ms of which 1 ms to minimize.
[2023-03-22 21:07:43] [INFO ] Deduced a trap composed of 44 places in 485 ms of which 2 ms to minimize.
[2023-03-22 21:07:44] [INFO ] Deduced a trap composed of 43 places in 461 ms of which 1 ms to minimize.
[2023-03-22 21:07:45] [INFO ] Deduced a trap composed of 31 places in 709 ms of which 1 ms to minimize.
[2023-03-22 21:07:46] [INFO ] Deduced a trap composed of 27 places in 998 ms of which 1 ms to minimize.
[2023-03-22 21:07:48] [INFO ] Deduced a trap composed of 19 places in 1779 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-22 21:07:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:07:48] [INFO ] After 26861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1216 ms.
Support contains 180 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 2723 transition count 2288
Reduce places removed 235 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 251 rules applied. Total rules applied 486 place count 2488 transition count 2272
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 502 place count 2472 transition count 2272
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 502 place count 2472 transition count 2076
Deduced a syphon composed of 196 places in 13 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 894 place count 2276 transition count 2076
Discarding 244 places :
Symmetric choice reduction at 3 with 244 rule applications. Total rules 1138 place count 2032 transition count 1832
Iterating global reduction 3 with 244 rules applied. Total rules applied 1382 place count 2032 transition count 1832
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1382 place count 2032 transition count 1748
Deduced a syphon composed of 84 places in 14 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1550 place count 1948 transition count 1748
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 5 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 3 with 1070 rules applied. Total rules applied 2620 place count 1413 transition count 1213
Partial Free-agglomeration rule applied 309 times.
Drop transitions removed 309 transitions
Iterating global reduction 3 with 309 rules applied. Total rules applied 2929 place count 1413 transition count 1213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2930 place count 1412 transition count 1212
Applied a total of 2930 rules in 913 ms. Remains 1412 /2723 variables (removed 1311) and now considering 1212/2523 (removed 1311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 914 ms. Remains : 1412/2723 places, 1212/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 7) seen :4
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1212 rows 1412 cols
[2023-03-22 21:07:51] [INFO ] Computed 441 place invariants in 48 ms
[2023-03-22 21:07:51] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 21:07:52] [INFO ] [Nat]Absence check using 422 positive place invariants in 580 ms returned sat
[2023-03-22 21:07:52] [INFO ] [Nat]Absence check using 422 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-22 21:07:55] [INFO ] After 2662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 21:07:56] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2023-03-22 21:07:56] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 0 ms to minimize.
[2023-03-22 21:07:57] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-22 21:07:57] [INFO ] Deduced a trap composed of 10 places in 481 ms of which 1 ms to minimize.
[2023-03-22 21:07:58] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-22 21:07:58] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-22 21:07:58] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-22 21:07:58] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-22 21:07:59] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-22 21:07:59] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 0 ms to minimize.
[2023-03-22 21:07:59] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-22 21:07:59] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-22 21:08:00] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 0 ms to minimize.
[2023-03-22 21:08:00] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-22 21:08:01] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 14 ms to minimize.
[2023-03-22 21:08:01] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2023-03-22 21:08:01] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2023-03-22 21:08:02] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 0 ms to minimize.
[2023-03-22 21:08:02] [INFO ] Deduced a trap composed of 10 places in 637 ms of which 1 ms to minimize.
[2023-03-22 21:08:03] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 3 ms to minimize.
[2023-03-22 21:08:03] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 14 ms to minimize.
[2023-03-22 21:08:03] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-22 21:08:04] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2023-03-22 21:08:04] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 27 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 13 places in 475 ms of which 1 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-22 21:08:05] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:08:06] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 0 ms to minimize.
[2023-03-22 21:08:06] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-22 21:08:07] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2023-03-22 21:08:07] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2023-03-22 21:08:07] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-22 21:08:07] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 11765 ms
[2023-03-22 21:08:08] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 0 ms to minimize.
[2023-03-22 21:08:08] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 0 ms to minimize.
[2023-03-22 21:08:08] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2023-03-22 21:08:09] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 8 ms to minimize.
[2023-03-22 21:08:09] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2023-03-22 21:08:09] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 0 ms to minimize.
[2023-03-22 21:08:10] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-22 21:08:10] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
[2023-03-22 21:08:11] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-22 21:08:11] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2023-03-22 21:08:11] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 0 ms to minimize.
[2023-03-22 21:08:11] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:08:12] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-22 21:08:12] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:08:13] [INFO ] Deduced a trap composed of 6 places in 463 ms of which 1 ms to minimize.
[2023-03-22 21:08:13] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 14 ms to minimize.
[2023-03-22 21:08:14] [INFO ] Deduced a trap composed of 6 places in 1125 ms of which 20 ms to minimize.
[2023-03-22 21:08:15] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 23 ms to minimize.
[2023-03-22 21:08:16] [INFO ] Deduced a trap composed of 5 places in 1068 ms of which 1 ms to minimize.
[2023-03-22 21:08:17] [INFO ] Deduced a trap composed of 7 places in 797 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-22 21:08:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:08:17] [INFO ] After 25621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 86 ms.
Support contains 96 out of 1412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1412/1412 places, 1212/1212 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1412 transition count 1200
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 1400 transition count 1199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1399 transition count 1199
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 26 place count 1399 transition count 1186
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 52 place count 1386 transition count 1186
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 1383 transition count 1183
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 1383 transition count 1183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 1383 transition count 1182
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1382 transition count 1182
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 166 place count 1329 transition count 1129
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 185 place count 1329 transition count 1129
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 1325 transition count 1125
Applied a total of 189 rules in 572 ms. Remains 1325 /1412 variables (removed 87) and now considering 1125/1212 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 1325/1412 places, 1125/1212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1125 rows 1325 cols
[2023-03-22 21:08:18] [INFO ] Computed 441 place invariants in 43 ms
[2023-03-22 21:08:18] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 21:08:18] [INFO ] [Nat]Absence check using 418 positive place invariants in 156 ms returned sat
[2023-03-22 21:08:18] [INFO ] [Nat]Absence check using 418 positive and 23 generalized place invariants in 18 ms returned sat
[2023-03-22 21:08:20] [INFO ] After 1336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 21:08:20] [INFO ] Deduced a trap composed of 5 places in 387 ms of which 1 ms to minimize.
[2023-03-22 21:08:21] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 1 ms to minimize.
[2023-03-22 21:08:21] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-22 21:08:22] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-22 21:08:22] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 1 ms to minimize.
[2023-03-22 21:08:22] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-22 21:08:23] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-22 21:08:23] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-22 21:08:23] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-22 21:08:25] [INFO ] Deduced a trap composed of 7 places in 1167 ms of which 1 ms to minimize.
[2023-03-22 21:08:25] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2023-03-22 21:08:25] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:08:26] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-22 21:08:26] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2023-03-22 21:08:26] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2023-03-22 21:08:27] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-22 21:08:27] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2023-03-22 21:08:27] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-22 21:08:28] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 1 ms to minimize.
[2023-03-22 21:08:28] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2023-03-22 21:08:28] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2023-03-22 21:08:28] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 0 ms to minimize.
[2023-03-22 21:08:29] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-22 21:08:29] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-22 21:08:29] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-22 21:08:30] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2023-03-22 21:08:30] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-22 21:08:30] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-22 21:08:30] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-22 21:08:31] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-22 21:08:31] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 3 ms to minimize.
[2023-03-22 21:08:31] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2023-03-22 21:08:32] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-22 21:08:32] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2023-03-22 21:08:32] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 11961 ms
[2023-03-22 21:08:33] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 0 ms to minimize.
[2023-03-22 21:08:33] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-22 21:08:33] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:08:33] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2023-03-22 21:08:34] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-22 21:08:34] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-22 21:08:34] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-22 21:08:34] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-22 21:08:35] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2023-03-22 21:08:35] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-22 21:08:35] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-22 21:08:35] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-22 21:08:36] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-22 21:08:36] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 21:08:36] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 0 ms to minimize.
[2023-03-22 21:08:37] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2023-03-22 21:08:37] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-22 21:08:37] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-22 21:08:37] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2023-03-22 21:08:38] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-22 21:08:38] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-22 21:08:38] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2023-03-22 21:08:39] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-22 21:08:39] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-22 21:08:39] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 0 ms to minimize.
[2023-03-22 21:08:40] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 21:08:40] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-22 21:08:40] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 21:08:40] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2023-03-22 21:08:41] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
[2023-03-22 21:08:41] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 0 ms to minimize.
[2023-03-22 21:08:41] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-22 21:08:41] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 0 ms to minimize.
[2023-03-22 21:08:42] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-22 21:08:42] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-22 21:08:42] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-22 21:08:42] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-22 21:08:42] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10326 ms
[2023-03-22 21:08:43] [INFO ] After 24039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 474 ms.
[2023-03-22 21:08:43] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 109 ms.
Support contains 77 out of 1325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1325/1325 places, 1125/1125 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 1325 transition count 1124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1324 transition count 1124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1324 transition count 1122
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1322 transition count 1122
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 1307 transition count 1107
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 1307 transition count 1107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1306 transition count 1106
Applied a total of 40 rules in 190 ms. Remains 1306 /1325 variables (removed 19) and now considering 1106/1125 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 1306/1325 places, 1106/1125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 130913 steps, run timeout after 3002 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130913 steps, saw 124723 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1106 rows 1306 cols
[2023-03-22 21:08:47] [INFO ] Computed 441 place invariants in 27 ms
[2023-03-22 21:08:47] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 21:08:47] [INFO ] [Nat]Absence check using 420 positive place invariants in 79 ms returned sat
[2023-03-22 21:08:47] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-22 21:08:49] [INFO ] After 1743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 21:08:51] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2023-03-22 21:08:51] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-22 21:08:51] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 15 ms to minimize.
[2023-03-22 21:08:52] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 0 ms to minimize.
[2023-03-22 21:08:52] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-22 21:08:53] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:08:53] [INFO ] Deduced a trap composed of 7 places in 668 ms of which 1 ms to minimize.
[2023-03-22 21:08:54] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-22 21:08:54] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-22 21:08:54] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-22 21:08:55] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2023-03-22 21:08:55] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 0 ms to minimize.
[2023-03-22 21:08:55] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2023-03-22 21:08:56] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 1 ms to minimize.
[2023-03-22 21:08:56] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 1 ms to minimize.
[2023-03-22 21:08:57] [INFO ] Deduced a trap composed of 5 places in 572 ms of which 1 ms to minimize.
[2023-03-22 21:08:57] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-22 21:08:58] [INFO ] Deduced a trap composed of 7 places in 582 ms of which 1 ms to minimize.
[2023-03-22 21:08:58] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2023-03-22 21:08:58] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-22 21:08:59] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-22 21:08:59] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:08:59] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-22 21:09:00] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2023-03-22 21:09:00] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-22 21:09:00] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-22 21:09:01] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2023-03-22 21:09:01] [INFO ] Deduced a trap composed of 10 places in 693 ms of which 26 ms to minimize.
[2023-03-22 21:09:02] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-22 21:09:02] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-22 21:09:02] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-22 21:09:03] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 0 ms to minimize.
[2023-03-22 21:09:03] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 12627 ms
[2023-03-22 21:09:03] [INFO ] Deduced a trap composed of 6 places in 600 ms of which 1 ms to minimize.
[2023-03-22 21:09:04] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-22 21:09:05] [INFO ] Deduced a trap composed of 6 places in 704 ms of which 1 ms to minimize.
[2023-03-22 21:09:05] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2023-03-22 21:09:06] [INFO ] Deduced a trap composed of 5 places in 781 ms of which 1 ms to minimize.
[2023-03-22 21:09:06] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-22 21:09:06] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2023-03-22 21:09:07] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-22 21:09:07] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 1 ms to minimize.
[2023-03-22 21:09:07] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2023-03-22 21:09:08] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-22 21:09:08] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2023-03-22 21:09:08] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-22 21:09:09] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-22 21:09:09] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-22 21:09:09] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-22 21:09:09] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 21:09:09] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-22 21:09:10] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 0 ms to minimize.
[2023-03-22 21:09:10] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 1 ms to minimize.
[2023-03-22 21:09:10] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-22 21:09:11] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 0 ms to minimize.
[2023-03-22 21:09:11] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-22 21:09:11] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-22 21:09:11] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-22 21:09:12] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-22 21:09:12] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2023-03-22 21:09:12] [INFO ] Deduced a trap composed of 8 places in 483 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-22 21:09:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:09:12] [INFO ] After 25491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 107 ms.
Support contains 77 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 36 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 35 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-22 21:09:13] [INFO ] Invariant cache hit.
[2023-03-22 21:09:13] [INFO ] Implicit Places using invariants in 818 ms returned []
[2023-03-22 21:09:13] [INFO ] Invariant cache hit.
[2023-03-22 21:09:16] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 3475 ms to find 0 implicit places.
[2023-03-22 21:09:16] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-22 21:09:16] [INFO ] Invariant cache hit.
[2023-03-22 21:09:17] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4301 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 69 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 21:09:17] [INFO ] Invariant cache hit.
[2023-03-22 21:09:17] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 21:09:18] [INFO ] [Nat]Absence check using 420 positive place invariants in 130 ms returned sat
[2023-03-22 21:09:18] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-22 21:09:21] [INFO ] After 2665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 21:09:22] [INFO ] Deduced a trap composed of 7 places in 840 ms of which 1 ms to minimize.
[2023-03-22 21:09:22] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 0 ms to minimize.
[2023-03-22 21:09:23] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2023-03-22 21:09:23] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 1 ms to minimize.
[2023-03-22 21:09:23] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-22 21:09:24] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:09:24] [INFO ] Deduced a trap composed of 6 places in 431 ms of which 1 ms to minimize.
[2023-03-22 21:09:24] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-22 21:09:25] [INFO ] Deduced a trap composed of 6 places in 594 ms of which 0 ms to minimize.
[2023-03-22 21:09:25] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-22 21:09:26] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-22 21:09:26] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2023-03-22 21:09:26] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 2 ms to minimize.
[2023-03-22 21:09:27] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-22 21:09:27] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:09:27] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-22 21:09:27] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2023-03-22 21:09:28] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-22 21:09:28] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-22 21:09:28] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2023-03-22 21:09:29] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-22 21:09:29] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-22 21:09:29] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2023-03-22 21:09:29] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-22 21:09:30] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-22 21:09:30] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2023-03-22 21:09:31] [INFO ] Deduced a trap composed of 7 places in 563 ms of which 0 ms to minimize.
[2023-03-22 21:09:31] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 4 ms to minimize.
[2023-03-22 21:09:31] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-22 21:09:32] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 1 ms to minimize.
[2023-03-22 21:09:32] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:09:32] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2023-03-22 21:09:32] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-22 21:09:33] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-22 21:09:33] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-22 21:09:33] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-22 21:09:34] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-22 21:09:34] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-22 21:09:34] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-22 21:09:34] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-22 21:09:34] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 13521 ms
[2023-03-22 21:09:35] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2023-03-22 21:09:35] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-22 21:09:35] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:09:36] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2023-03-22 21:09:36] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 1 ms to minimize.
[2023-03-22 21:09:36] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-22 21:09:36] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 13 ms to minimize.
[2023-03-22 21:09:37] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 0 ms to minimize.
[2023-03-22 21:09:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2319 ms
[2023-03-22 21:09:37] [INFO ] After 19010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1234 ms.
[2023-03-22 21:09:38] [INFO ] After 20855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 21:09:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 33 ms.
[2023-03-22 21:09:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1306 places, 1106 transitions and 4838 arcs took 12 ms.
[2023-03-22 21:09:39] [INFO ] Flatten gal took : 125 ms
Total runtime 141203 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: ShieldPPPs_PT_040B
(NrP: 1306 NrTr: 1106 NrArc: 4838)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.151sec

net check time: 0m 0.000sec

init dd package: 0m 3.239sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6321944 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16097868 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.005sec

2273696 2206634 2363215

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="ShieldPPPs-PT-040B"
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 ShieldPPPs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718000495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;