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-167903718000511
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9990.424 3600000.00 3706760.00 138.50 TFTFFFTF?TTTTTFT 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-167903718000511.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K 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:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 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 888K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679520913672

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-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:35:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 21:35:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:35:16] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-22 21:35:16] [INFO ] Transformed 3403 places.
[2023-03-22 21:35:16] [INFO ] Transformed 3153 transitions.
[2023-03-22 21:35:16] [INFO ] Found NUPN structural information;
[2023-03-22 21:35:16] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 16) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-22 21:35:17] [INFO ] Computed 551 place invariants in 33 ms
[2023-03-22 21:35:19] [INFO ] After 1614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 21:35:21] [INFO ] [Nat]Absence check using 551 positive place invariants in 335 ms returned sat
[2023-03-22 21:35:27] [INFO ] After 5007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 21:35:28] [INFO ] Deduced a trap composed of 26 places in 1526 ms of which 21 ms to minimize.
[2023-03-22 21:35:30] [INFO ] Deduced a trap composed of 22 places in 1371 ms of which 5 ms to minimize.
[2023-03-22 21:35:32] [INFO ] Deduced a trap composed of 11 places in 1811 ms of which 55 ms to minimize.
[2023-03-22 21:35:33] [INFO ] Deduced a trap composed of 14 places in 1210 ms of which 6 ms to minimize.
[2023-03-22 21:35:35] [INFO ] Deduced a trap composed of 20 places in 1774 ms of which 2 ms to minimize.
[2023-03-22 21:35:37] [INFO ] Deduced a trap composed of 22 places in 1372 ms of which 3 ms to minimize.
[2023-03-22 21:35:38] [INFO ] Deduced a trap composed of 35 places in 1177 ms of which 2 ms to minimize.
[2023-03-22 21:35:39] [INFO ] Deduced a trap composed of 30 places in 1027 ms of which 2 ms to minimize.
[2023-03-22 21:35:41] [INFO ] Deduced a trap composed of 28 places in 1236 ms of which 5 ms to minimize.
[2023-03-22 21:35:42] [INFO ] Deduced a trap composed of 18 places in 1023 ms of which 2 ms to minimize.
[2023-03-22 21:35:43] [INFO ] Deduced a trap composed of 25 places in 992 ms of which 2 ms to minimize.
[2023-03-22 21:35:44] [INFO ] Deduced a trap composed of 35 places in 1010 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 21:35:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:35:44] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 1501 ms.
Support contains 124 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 3403 transition count 2831
Reduce places removed 322 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 328 rules applied. Total rules applied 650 place count 3081 transition count 2825
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 656 place count 3075 transition count 2825
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 656 place count 3075 transition count 2578
Deduced a syphon composed of 247 places in 9 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 1150 place count 2828 transition count 2578
Discarding 333 places :
Symmetric choice reduction at 3 with 333 rule applications. Total rules 1483 place count 2495 transition count 2245
Iterating global reduction 3 with 333 rules applied. Total rules applied 1816 place count 2495 transition count 2245
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 1816 place count 2495 transition count 2119
Deduced a syphon composed of 126 places in 15 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 2068 place count 2369 transition count 2119
Performed 688 Post agglomeration using F-continuation condition.Transition count delta: 688
Deduced a syphon composed of 688 places in 3 ms
Reduce places removed 688 places and 0 transitions.
Iterating global reduction 3 with 1376 rules applied. Total rules applied 3444 place count 1681 transition count 1431
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 413 times.
Drop transitions removed 413 transitions
Iterating global reduction 3 with 413 rules applied. Total rules applied 3857 place count 1681 transition count 1431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3858 place count 1680 transition count 1430
Applied a total of 3858 rules in 1179 ms. Remains 1680 /3403 variables (removed 1723) and now considering 1430/3153 (removed 1723) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1180 ms. Remains : 1680/3403 places, 1430/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 10) seen :7
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1430 rows 1680 cols
[2023-03-22 21:35:47] [INFO ] Computed 551 place invariants in 35 ms
[2023-03-22 21:35:48] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 21:35:48] [INFO ] [Nat]Absence check using 531 positive place invariants in 156 ms returned sat
[2023-03-22 21:35:48] [INFO ] [Nat]Absence check using 531 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-22 21:35:50] [INFO ] After 1521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 21:35:50] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 1 ms to minimize.
[2023-03-22 21:35:51] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 1 ms to minimize.
[2023-03-22 21:35:51] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2023-03-22 21:35:52] [INFO ] Deduced a trap composed of 10 places in 434 ms of which 0 ms to minimize.
[2023-03-22 21:35:52] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 3 ms to minimize.
[2023-03-22 21:35:52] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 0 ms to minimize.
[2023-03-22 21:35:53] [INFO ] Deduced a trap composed of 6 places in 440 ms of which 2 ms to minimize.
[2023-03-22 21:35:54] [INFO ] Deduced a trap composed of 7 places in 466 ms of which 1 ms to minimize.
[2023-03-22 21:35:54] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 0 ms to minimize.
[2023-03-22 21:35:54] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 4 ms to minimize.
[2023-03-22 21:35:55] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2023-03-22 21:35:55] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 1 ms to minimize.
[2023-03-22 21:35:55] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 1 ms to minimize.
[2023-03-22 21:35:56] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 1 ms to minimize.
[2023-03-22 21:35:57] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 2 ms to minimize.
[2023-03-22 21:35:57] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2023-03-22 21:35:57] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-22 21:35:58] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 0 ms to minimize.
[2023-03-22 21:35:58] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 0 ms to minimize.
[2023-03-22 21:35:58] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-22 21:35:59] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 0 ms to minimize.
[2023-03-22 21:35:59] [INFO ] Deduced a trap composed of 7 places in 420 ms of which 17 ms to minimize.
[2023-03-22 21:36:00] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 2 ms to minimize.
[2023-03-22 21:36:00] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2023-03-22 21:36:01] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 1 ms to minimize.
[2023-03-22 21:36:01] [INFO ] Deduced a trap composed of 7 places in 413 ms of which 0 ms to minimize.
[2023-03-22 21:36:02] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 1 ms to minimize.
[2023-03-22 21:36:02] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 10 ms to minimize.
[2023-03-22 21:36:03] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 1 ms to minimize.
[2023-03-22 21:36:03] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 1 ms to minimize.
[2023-03-22 21:36:03] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 13 ms to minimize.
[2023-03-22 21:36:04] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:36:04] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-22 21:36:04] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-22 21:36:05] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:36:05] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 1 ms to minimize.
[2023-03-22 21:36:05] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2023-03-22 21:36:06] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 1 ms to minimize.
[2023-03-22 21:36:06] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 11 ms to minimize.
[2023-03-22 21:36:06] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-22 21:36:06] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
[2023-03-22 21:36:07] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 16639 ms
[2023-03-22 21:36:07] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 1 ms to minimize.
[2023-03-22 21:36:08] [INFO ] Deduced a trap composed of 7 places in 479 ms of which 2 ms to minimize.
[2023-03-22 21:36:08] [INFO ] Deduced a trap composed of 6 places in 406 ms of which 13 ms to minimize.
[2023-03-22 21:36:09] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 14 ms to minimize.
[2023-03-22 21:36:09] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 1 ms to minimize.
[2023-03-22 21:36:09] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 1 ms to minimize.
[2023-03-22 21:36:10] [INFO ] Deduced a trap composed of 19 places in 463 ms of which 2 ms to minimize.
[2023-03-22 21:36:10] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 0 ms to minimize.
[2023-03-22 21:36:11] [INFO ] Deduced a trap composed of 8 places in 389 ms of which 1 ms to minimize.
[2023-03-22 21:36:11] [INFO ] Deduced a trap composed of 7 places in 457 ms of which 0 ms to minimize.
[2023-03-22 21:36:12] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 19 ms to minimize.
[2023-03-22 21:36:12] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 0 ms to minimize.
[2023-03-22 21:36:12] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 1 ms to minimize.
[2023-03-22 21:36:13] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 21:36:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:36:13] [INFO ] After 25251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 121 ms.
Support contains 84 out of 1680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1680/1680 places, 1430/1430 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1680 transition count 1423
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1673 transition count 1423
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 1673 transition count 1416
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 1666 transition count 1416
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 84 place count 1638 transition count 1388
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 1638 transition count 1388
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 1635 transition count 1385
Applied a total of 93 rules in 272 ms. Remains 1635 /1680 variables (removed 45) and now considering 1385/1430 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 1635/1680 places, 1385/1430 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 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
Interrupted probabilistic random walk after 148427 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 148427 steps, saw 142994 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :2
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1385 rows 1635 cols
[2023-03-22 21:36:17] [INFO ] Computed 551 place invariants in 42 ms
[2023-03-22 21:36:17] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:36:18] [INFO ] [Nat]Absence check using 527 positive place invariants in 252 ms returned sat
[2023-03-22 21:36:18] [INFO ] [Nat]Absence check using 527 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-22 21:36:19] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:36:19] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 35 ms to minimize.
[2023-03-22 21:36:20] [INFO ] Deduced a trap composed of 7 places in 607 ms of which 16 ms to minimize.
[2023-03-22 21:36:20] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 1 ms to minimize.
[2023-03-22 21:36:21] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-22 21:36:21] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 2 ms to minimize.
[2023-03-22 21:36:22] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 0 ms to minimize.
[2023-03-22 21:36:22] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 0 ms to minimize.
[2023-03-22 21:36:22] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-22 21:36:23] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 0 ms to minimize.
[2023-03-22 21:36:23] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-22 21:36:24] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 1 ms to minimize.
[2023-03-22 21:36:24] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 0 ms to minimize.
[2023-03-22 21:36:24] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-22 21:36:25] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-22 21:36:25] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 0 ms to minimize.
[2023-03-22 21:36:25] [INFO ] Deduced a trap composed of 6 places in 389 ms of which 0 ms to minimize.
[2023-03-22 21:36:26] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 0 ms to minimize.
[2023-03-22 21:36:26] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 0 ms to minimize.
[2023-03-22 21:36:27] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-22 21:36:27] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 14 ms to minimize.
[2023-03-22 21:36:28] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2023-03-22 21:36:28] [INFO ] Deduced a trap composed of 5 places in 507 ms of which 1 ms to minimize.
[2023-03-22 21:36:29] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 7 ms to minimize.
[2023-03-22 21:36:29] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-22 21:36:29] [INFO ] Deduced a trap composed of 8 places in 567 ms of which 1 ms to minimize.
[2023-03-22 21:36:30] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-22 21:36:30] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-22 21:36:30] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 1 ms to minimize.
[2023-03-22 21:36:31] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-22 21:36:31] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2023-03-22 21:36:31] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-22 21:36:32] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 2 ms to minimize.
[2023-03-22 21:36:32] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 21:36:32] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 13127 ms
[2023-03-22 21:36:32] [INFO ] After 14488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-22 21:36:32] [INFO ] After 15325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 35 out of 1635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1635/1635 places, 1385/1385 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1635 transition count 1380
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1630 transition count 1380
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 1630 transition count 1374
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 1624 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1623 transition count 1373
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1623 transition count 1373
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 72 place count 1599 transition count 1349
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 1599 transition count 1349
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 1592 transition count 1342
Applied a total of 89 rules in 362 ms. Remains 1592 /1635 variables (removed 43) and now considering 1342/1385 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 1592/1635 places, 1342/1385 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167015 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167015 steps, saw 150451 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1342 rows 1592 cols
[2023-03-22 21:36:36] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-22 21:36:36] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:36:37] [INFO ] [Nat]Absence check using 525 positive place invariants in 221 ms returned sat
[2023-03-22 21:36:37] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-22 21:36:38] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:36:38] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 0 ms to minimize.
[2023-03-22 21:36:38] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 0 ms to minimize.
[2023-03-22 21:36:39] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-22 21:36:39] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 1 ms to minimize.
[2023-03-22 21:36:39] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-22 21:36:40] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2023-03-22 21:36:40] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-22 21:36:41] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 1 ms to minimize.
[2023-03-22 21:36:41] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 1 ms to minimize.
[2023-03-22 21:36:42] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2023-03-22 21:36:42] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2023-03-22 21:36:42] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 2 ms to minimize.
[2023-03-22 21:36:43] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 1 ms to minimize.
[2023-03-22 21:36:43] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-22 21:36:43] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 1 ms to minimize.
[2023-03-22 21:36:44] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-22 21:36:44] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-03-22 21:36:44] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-22 21:36:45] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 0 ms to minimize.
[2023-03-22 21:36:45] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 1 ms to minimize.
[2023-03-22 21:36:46] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 0 ms to minimize.
[2023-03-22 21:36:46] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 21:36:46] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2023-03-22 21:36:47] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2023-03-22 21:36:47] [INFO ] Deduced a trap composed of 8 places in 558 ms of which 0 ms to minimize.
[2023-03-22 21:36:48] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2023-03-22 21:36:48] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-22 21:36:48] [INFO ] Deduced a trap composed of 6 places in 468 ms of which 1 ms to minimize.
[2023-03-22 21:36:49] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 0 ms to minimize.
[2023-03-22 21:36:49] [INFO ] Deduced a trap composed of 6 places in 432 ms of which 2 ms to minimize.
[2023-03-22 21:36:50] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2023-03-22 21:36:51] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 1 ms to minimize.
[2023-03-22 21:36:51] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 1 ms to minimize.
[2023-03-22 21:36:51] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 1 ms to minimize.
[2023-03-22 21:36:52] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2023-03-22 21:36:52] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2023-03-22 21:36:53] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 1 ms to minimize.
[2023-03-22 21:36:54] [INFO ] Deduced a trap composed of 6 places in 493 ms of which 1 ms to minimize.
[2023-03-22 21:36:54] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:36:54] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2023-03-22 21:36:55] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 13 ms to minimize.
[2023-03-22 21:36:55] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-22 21:36:55] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-22 21:36:56] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 21:36:56] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-22 21:36:57] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-22 21:36:57] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2023-03-22 21:36:57] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 1 ms to minimize.
[2023-03-22 21:36:58] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2023-03-22 21:36:58] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-22 21:36:58] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:36:59] [INFO ] Deduced a trap composed of 8 places in 487 ms of which 1 ms to minimize.
[2023-03-22 21:36:59] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 0 ms to minimize.
[2023-03-22 21:37:00] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:37:00] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:37:00] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-22 21:37:01] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 0 ms to minimize.
[2023-03-22 21:37:01] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 0 ms to minimize.
[2023-03-22 21:37:01] [INFO ] Deduced a trap composed of 17 places in 241 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:37:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:37:01] [INFO ] After 25193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 14 ms.
Support contains 35 out of 1592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1592/1592 places, 1342/1342 transitions.
Applied a total of 0 rules in 70 ms. Remains 1592 /1592 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1592/1592 places, 1342/1342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1592/1592 places, 1342/1342 transitions.
Applied a total of 0 rules in 53 ms. Remains 1592 /1592 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
[2023-03-22 21:37:02] [INFO ] Invariant cache hit.
[2023-03-22 21:37:03] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2023-03-22 21:37:03] [INFO ] Invariant cache hit.
[2023-03-22 21:37:06] [INFO ] Implicit Places using invariants and state equation in 3329 ms returned []
Implicit Place search using SMT with State Equation took 4577 ms to find 0 implicit places.
[2023-03-22 21:37:06] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-22 21:37:06] [INFO ] Invariant cache hit.
[2023-03-22 21:37:07] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5896 ms. Remains : 1592/1592 places, 1342/1342 transitions.
Applied a total of 0 rules in 70 ms. Remains 1592 /1592 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 21:37:07] [INFO ] Invariant cache hit.
[2023-03-22 21:37:08] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:37:08] [INFO ] [Nat]Absence check using 525 positive place invariants in 161 ms returned sat
[2023-03-22 21:37:08] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-22 21:37:09] [INFO ] After 894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:37:09] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 1 ms to minimize.
[2023-03-22 21:37:10] [INFO ] Deduced a trap composed of 8 places in 439 ms of which 2 ms to minimize.
[2023-03-22 21:37:10] [INFO ] Deduced a trap composed of 14 places in 424 ms of which 0 ms to minimize.
[2023-03-22 21:37:11] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2023-03-22 21:37:11] [INFO ] Deduced a trap composed of 6 places in 543 ms of which 1 ms to minimize.
[2023-03-22 21:37:12] [INFO ] Deduced a trap composed of 6 places in 470 ms of which 1 ms to minimize.
[2023-03-22 21:37:12] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-22 21:37:13] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 1 ms to minimize.
[2023-03-22 21:37:13] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-22 21:37:13] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-22 21:37:14] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 1 ms to minimize.
[2023-03-22 21:37:14] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 0 ms to minimize.
[2023-03-22 21:37:15] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 0 ms to minimize.
[2023-03-22 21:37:15] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 15 ms to minimize.
[2023-03-22 21:37:15] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:37:16] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-22 21:37:16] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 2 ms to minimize.
[2023-03-22 21:37:16] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 4 ms to minimize.
[2023-03-22 21:37:17] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2023-03-22 21:37:17] [INFO ] Deduced a trap composed of 6 places in 460 ms of which 1 ms to minimize.
[2023-03-22 21:37:17] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2023-03-22 21:37:18] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-22 21:37:18] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2023-03-22 21:37:18] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:37:19] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2023-03-22 21:37:19] [INFO ] Deduced a trap composed of 11 places in 537 ms of which 1 ms to minimize.
[2023-03-22 21:37:20] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:37:20] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-22 21:37:20] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:37:21] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 0 ms to minimize.
[2023-03-22 21:37:21] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-22 21:37:21] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-22 21:37:21] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-22 21:37:22] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2023-03-22 21:37:22] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:37:22] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 13137 ms
[2023-03-22 21:37:22] [INFO ] After 14160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-22 21:37:22] [INFO ] After 14753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:37:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-22 21:37:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1592 places, 1342 transitions and 5870 arcs took 8 ms.
[2023-03-22 21:37:23] [INFO ] Flatten gal took : 163 ms
Total runtime 127366 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_050B
(NrP: 1592 NrTr: 1342 NrArc: 5870)

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

net check time: 0m 0.000sec

init dd package: 0m 3.193sec


before gc: list nodes free: 1013308

after gc: idd nodes used:1496995, unused:62503005; list nodes free:276270364

before gc: list nodes free: 1259824

after gc: idd nodes used:3841101, unused:60158899; list nodes free:273965207
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6155588 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096028 kB

BK_TIME_CONFINEMENT_REACHED

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

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

1234546 3850114

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-050B"
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-050B, 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-167903718000511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B 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 ;